Integer programming column generation: accelerating branch-and-price using a novel pricing scheme for finding high-quality solutions in set covering, packing, and partitioning problems.
Stephen J. MaherElina RönnbergPublished in: Math. Program. Comput. (2023)
Keyphrases
- set covering
- integer programming
- column generation
- set covering problem
- exact solution
- integer program
- mixed integer programming
- integer programming formulations
- linear programming
- cutting plane
- constraint programming
- np hard
- set partitioning
- cutting plane algorithm
- lagrangian relaxation
- optimal solution
- branch and bound
- dantzig wolfe decomposition
- lp relaxation
- vehicle routing
- benchmark problems
- network flow
- crew pairing
- linear relaxation
- linear program
- production planning
- linear programming relaxation
- vehicle routing problem with time windows
- valid inequalities
- branch and bound algorithm
- problems involving
- dantzig wolfe
- genetic algorithm
- exact algorithms
- solution quality
- bi objective
- combinatorial optimization
- combinatorial auctions
- efficient solutions