The reduced cost branch and bound algorithm for mixed integer programming.
R. Kipp MartinDennis J. SweeneyMichael E. DohertyPublished in: Comput. Oper. Res. (1985)
Keyphrases
- branch and bound algorithm
- mixed integer programming
- lagrangian relaxation
- branch and bound method
- branch and bound
- column generation
- lower bound
- optimal solution
- upper bound
- network design problem
- lower bounding
- np hard
- combinatorial optimization
- valid inequalities
- upper bounding
- mixed integer
- lot sizing
- single machine scheduling problem
- production planning
- linear programming relaxation
- neural network
- lower and upper bounds
- total cost
- minimal cost
- search algorithm
- bayesian networks
- feasible solution
- search space
- genetic algorithm