An integer optimality condition for column generation on zero-one linear programs.
Elina RönnbergTorbjörn LarssonPublished in: Discret. Optim. (2019)
Keyphrases
- linear program
- column generation
- optimal solution
- linear programming
- extreme points
- vehicle routing
- integer program
- integer linear programming
- set partitioning
- linear programming problems
- simplex method
- dynamic programming
- mixed integer programming
- cutting plane
- primal dual
- mixed integer
- sufficient conditions
- interior point methods
- objective function
- np hard
- exact solution
- dantzig wolfe decomposition
- vehicle routing problem with time windows
- lagrangian relaxation
- branch and bound
- valid inequalities
- branch and bound algorithm
- metaheuristic
- knapsack problem
- linear relaxation
- semidefinite programming
- linear programming relaxation
- constraint satisfaction
- integer programming
- evolutionary algorithm