A note on the Bertsimas & Sim algorithm for robust combinatorial optimization problems.
Eduardo Álvarez-MirandaIvana LjubicPaolo TothPublished in: 4OR (2013)
Keyphrases
- combinatorial optimization problems
- combinatorial optimization
- dynamic programming
- learning algorithm
- ant colony optimization
- knapsack problem
- detection algorithm
- metaheuristic
- probabilistic model
- cost function
- np hard
- computational complexity
- particle swarm optimization
- expectation maximization
- objective function
- job shop scheduling problem
- search strategy
- matching algorithm
- shortest path problem
- computationally efficient
- optimization problems
- k means
- energy function
- worst case
- particle swarm optimization algorithm
- preprocessing
- image segmentation