Predicting the Solution Time of Branch-and-Bound Algorithms for Mixed-Integer Programs.
Osman Y. ÖzaltinBrady HunsakerAndrew J. SchaeferPublished in: INFORMS J. Comput. (2011)
Keyphrases
- branch and bound algorithm
- mixed integer program
- lagrangian relaxation
- optimal solution
- lower bound
- branch and bound
- feasible solution
- upper bound
- cutting plane
- np hard
- mixed integer
- finding an optimal solution
- linear program
- combinatorial optimization
- set covering problem
- haplotype inference
- column generation
- continuous variables
- lot sizing
- mixed integer programming
- knapsack problem
- valid inequalities
- boolean satisfiability