Benchmark Instances and Branch-and-Cut Algorithm for the Hashiwokakero Puzzle.
Leandro C. CoelhoGilbert LaporteArinei LindbeckThibaut VidalPublished in: CoRR (2019)
Keyphrases
- benchmark instances
- dynamic programming
- job shop scheduling problem
- optimization algorithm
- cost function
- tabu search
- benchmark problems
- hybrid algorithm
- objective function
- ant colony optimization
- linear programming
- memetic algorithm
- orders of magnitude
- metaheuristic
- traveling salesman problem
- worst case
- solution quality
- randomly generated
- test problems
- multi class
- computational complexity