MetaIP - A New Approach to Combinatorial Optimization: Case Studies.
Yanzhi LiAndrew LimPublished in: ICTAI (2004)
Keyphrases
- combinatorial optimization
- case study
- combinatorial optimization problems
- traveling salesman problem
- metaheuristic
- simulated annealing
- mathematical programming
- branch and bound
- lessons learned
- combinatorial problems
- branch and bound algorithm
- optimization problems
- real world
- hard combinatorial optimization problems
- open source
- vehicle routing problem
- knowledge management
- quadratic assignment problem
- single machine scheduling problem
- path relinking
- constraint satisfaction
- image segmentation
- exact algorithms
- memetic algorithm
- computer vision
- combinatorial search
- job shop scheduling problem
- lower bound
- evolutionary algorithm
- dynamic programming
- tabu search