Investigation of some branch and bound strategies for the solution of mixed integer linear programs.
Gautam MitraPublished in: Math. Program. (1973)
Keyphrases
- branch and bound
- optimal solution
- mixed integer linear programs
- branch and bound search
- branch and bound algorithm
- lower bound
- integer variables
- column generation
- search algorithm
- network design problem
- search strategies
- lagrangian relaxation
- upper bound
- search space
- tree search
- beam search
- combinatorial optimization
- np hard
- continuous relaxation
- exact solution
- search procedures
- search strategy
- linear program
- genetic algorithm
- integer program
- max sat
- mathematical programming
- constraint programming
- mathematical model
- linear programming
- probabilistic model