The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization.
Michael JüngerStefan ThienelPublished in: Softw. Pract. Exp. (2000)
Keyphrases
- combinatorial optimization
- integer programming
- combinatorial optimization problems
- optimization problems
- traveling salesman problem
- branch and bound
- exact algorithms
- combinatorial problems
- simulated annealing
- branch and bound algorithm
- linear programming
- metaheuristic
- learning algorithm
- mathematical programming
- inference problems
- constraint programming
- set covering
- computational complexity
- cutting plane algorithm
- hard combinatorial optimization problems
- max flow min cut
- cutting plane
- integer program
- vehicle routing problem
- ant colony optimization
- worst case
- objective function