Feasible rounding based diving strategies in branch-and-bound methods for mixed-integer optimization.
Christoph NeumannStefan SchwarzeOliver SteinBenjamin MüllerPublished in: EURO J. Comput. Optim. (2022)
Keyphrases
- branch and bound
- mixed integer
- lagrangian heuristic
- network design problem
- optimal solution
- quadratic program
- feasible solution
- lower bound
- search algorithm
- combinatorial optimization
- linear programming
- neural network
- linear programming relaxation
- valid inequalities
- mixed integer programming
- search strategies
- upper bound
- column generation
- lot sizing
- search space
- linear program
- constraint satisfaction problems