A Lagrangian Based Branch-and-Bound Algorithm for Production-transportation Problems.
Takahito KunoTakahiro UtsunomiyaPublished in: J. Glob. Optim. (2000)
Keyphrases
- branch and bound algorithm
- transportation problem
- lagrangian relaxation
- optimal solution
- lower bound
- np hard
- branch and bound
- integer programming
- production planning
- test problems
- upper bound
- precedence constraints
- lower bounding
- combinatorial optimization
- single machine scheduling problem
- set covering problem
- mixed integer linear programming
- randomly generated problems
- branch and bound method
- finding an optimal solution
- variable ordering
- upper bounding
- maximum clique
- knapsack problem
- integer variables
- mixed integer programming
- objective function
- production cost
- max sat
- column generation
- linear program
- constraint satisfaction
- linear programming