Branch-and-Cut Algorithms for Combinatorial Optimization and Their Implementation in ABACUS.
Matthias ElfCarsten GutwengerMichael JüngerGiovanni RinaldiPublished in: Computational Combinatorial Optimization (2001)
Keyphrases
- combinatorial optimization
- combinatorial optimization problems
- traveling salesman problem
- simulated annealing
- optimization problems
- metaheuristic
- exact algorithms
- combinatorial problems
- branch and bound
- branch and bound algorithm
- mathematical programming
- genetic algorithm
- quadratic assignment problem
- worst case
- multiscale
- learning algorithm
- tabu search
- multi objective
- evolutionary algorithm
- greedy algorithm
- search space
- efficient implementation
- benchmark problems
- computational complexity
- data structure
- heuristic methods
- neural network