Cut-and-solve: An iterative search strategy for combinatorial optimization problems.
Sharlee ClimerWeixiong ZhangPublished in: Artif. Intell. (2006)
Keyphrases
- search strategy
- combinatorial optimization problems
- search space
- search strategies
- metaheuristic
- optimization problems
- knapsack problem
- search algorithm
- combinatorial optimization
- discrete optimization
- ant colony optimization
- traveling salesman problem
- job shop scheduling
- shortest path problem
- effective pruning
- job shop scheduling problem
- min cost
- continuous optimization problems
- genetic algorithm
- search heuristics
- minmax regret
- vehicle routing problem
- exact algorithms
- evolutionary algorithm
- relevance feedback
- branch and bound