Branching with hyperplanes in the criterion space: The frontier partitioner algorithm for biobjective integer programming.
Marianna De SantisGiorgio GraniLaura PalagiPublished in: Eur. J. Oper. Res. (2020)
Keyphrases
- integer programming
- set covering problem
- np hard
- set covering
- bi objective
- benchmark problems
- objective function
- search space
- lagrangian relaxation
- linear programming
- cost function
- branch and bound
- ant colony optimization
- graph partitioning
- network flow
- shortest path problem
- dynamic programming
- cutting plane algorithm