Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation.
Daniel PorumbelPublished in: Math. Program. (2016)
Keyphrases
- set covering
- column generation
- integer program
- valid inequalities
- set covering problem
- constraint programming
- linear programming problems
- integer programming
- linear programming
- branch and bound
- mixed integer programming
- cutting plane
- linear relaxation
- linear program
- vehicle routing
- linear programming relaxation
- optimal solution
- set partitioning
- integer linear programming
- crew pairing
- lagrangean relaxation
- lagrangian relaxation
- exact solution
- dual variables
- vehicle routing problem with time windows
- hypergraph model
- convex hull
- cutting plane algorithm
- constraint satisfaction
- branch and bound algorithm
- mixed integer
- linear constraints
- network flow
- constraint propagation
- objective function
- lp relaxation
- constraint satisfaction problems
- optimization problems
- np hard
- search space
- dantzig wolfe decomposition