Construct, Merge, Solve & Adapt A new general algorithm for combinatorial optimization.
Christian BlumPedro Pinacho DavidsonManuel López-IbáñezJosé Antonio LozanoPublished in: Comput. Oper. Res. (2016)
Keyphrases
- combinatorial optimization
- simulated annealing
- np hard
- combinatorial optimization problems
- k means
- learning algorithm
- mathematical programming
- search space
- dynamic programming
- benchmark problems
- metaheuristic
- neural network
- branch and bound algorithm
- branch and bound
- objective function
- combinatorial search
- hard combinatorial optimization problems
- optimization problems
- computational complexity
- worst case
- special case
- quadratic assignment problem
- exact algorithms
- memetic algorithm
- max flow min cut
- graph theory
- vehicle routing problem
- traveling salesman problem
- ant colony optimization
- energy function
- cost function