Active-constraint variable ordering for faster feasibility of mixed integer linear programs.
Jagat PatelJohn W. ChinneckPublished in: Math. Program. (2007)
Keyphrases
- variable ordering
- mixed integer linear programs
- branch and bound algorithm
- integer variables
- lower bound
- branch and bound
- np hard
- upper bound
- optimal solution
- combinatorial optimization
- lagrangian relaxation
- continuous relaxation
- search tree
- max sat
- binary decision diagrams
- cutting plane algorithm
- column generation
- cutting plane
- memory efficient
- valid inequalities
- np complete
- graphical models
- genetic algorithm