Dominance rules in combinatorial optimization problems.
Antoine JougletJacques CarlierPublished in: Eur. J. Oper. Res. (2011)
Keyphrases
- combinatorial optimization problems
- dominance rules
- branch and bound algorithm
- combinatorial optimization
- scheduling problem
- single machine
- lower bound
- knapsack problem
- maximum lateness
- metaheuristic
- optimization problems
- discrete optimization
- branch and bound
- upper bound
- optimal solution
- ant colony optimization
- job shop scheduling problem
- traveling salesman problem
- job shop scheduling
- np hard
- continuous optimization problems
- lagrangian relaxation
- precedence constraints
- simulated annealing
- shortest path problem
- processing times
- min cost
- release dates
- dynamic programming
- worst case
- computational complexity
- flowshop
- objective function