Faster integer-feasibility in mixed-integer linear programs by branching to force change.
Jennifer PryorJohn W. ChinneckPublished in: Comput. Oper. Res. (2011)
Keyphrases
- mixed integer linear programs
- integer variables
- continuous relaxation
- branch and bound algorithm
- branch and bound
- network design problem
- cutting plane algorithm
- branch and bound search
- higher dimensional
- knapsack problem
- memory efficient
- mixed integer
- search tree
- learning algorithm
- linear programming
- valid inequalities
- vehicle routing problem
- feasible solution
- scheduling problem