Improved penalty calculations for a mixed integer branch-and-bound algorithm.
Ronald D. ArmstrongPrabhakant SinhaPublished in: Math. Program. (1974)
Keyphrases
- branch and bound algorithm
- mixed integer
- optimal solution
- mixed integer linear programming
- integer variables
- lower bound
- branch and bound
- linear program
- objective function
- upper bound
- feasible solution
- cutting plane
- np hard
- lot sizing
- combinatorial optimization
- network design problem
- mixed integer programming
- lagrangian relaxation
- knapsack problem
- linear programming
- genetic algorithm
- valid inequalities
- continuous variables
- max sat
- search space
- column generation
- evolutionary algorithm
- search algorithm
- scheduling problem