An approximate algorithm for combinatorial optimization problems with two parameters.
David BlokhGregory Z. GutinPublished in: Australas. J Comb. (1996)
Keyphrases
- combinatorial optimization problems
- combinatorial optimization
- knapsack problem
- expectation maximization
- dynamic programming
- continuous optimization problems
- probabilistic model
- input data
- detection algorithm
- learning algorithm
- benchmark problems
- search strategy
- particle swarm optimization
- objective function
- parameter estimation
- segmentation algorithm
- data clustering
- search space
- parameter settings
- constraint satisfaction problems
- parameter space
- maximum likelihood
- optimization problems
- discrete optimization
- neural network