Effectiveness of the MineReduce approach in reducing the size of combinatorial optimization problem instances.
Marcelo Rodrigues de Holanda MaiaAlexandre PlastinoUéverton dos Santos SouzaPublished in: RAIRO Oper. Res. (2024)
Keyphrases
- combinatorial optimization
- quadratic assignment problem
- combinatorial optimization problems
- metaheuristic
- traveling salesman problem
- combinatorial problems
- simulated annealing
- mathematical programming
- branch and bound algorithm
- optimization problems
- branch and bound
- max flow min cut
- graph theory
- vehicle routing problem
- computational complexity
- exact algorithms
- objective function
- upper bound
- evolutionary algorithm
- estimation of distribution algorithms
- search procedures
- hard combinatorial optimization problems
- neural network