A portable and scalable algorithm for a class of constrained combinatorial optimization problems.
Sancho Salcedo-SanzCarlos Bousoño-CalzónPublished in: Comput. Oper. Res. (2005)
Keyphrases
- combinatorial optimization problems
- combinatorial optimization
- single pass
- knapsack problem
- optimal solution
- ant colony optimization
- k means
- detection algorithm
- np hard
- dynamic programming
- worst case
- metaheuristic
- job shop scheduling
- optimization problems
- cost function
- search space
- preprocessing
- computational complexity
- expectation maximization
- multi class classification
- min cost
- job shop scheduling problem
- graph model
- learning algorithm
- linear programming
- objective function