Combinatorial Benders' Cuts for Mixed-Integer Linear Programming.
Gianni CodatoMatteo FischettiPublished in: Oper. Res. (2006)
Keyphrases
- mixed integer linear programming
- mixed integer
- benders decomposition
- cutting plane
- branch and bound algorithm
- decomposition method
- mathematical programming
- production planning
- mixed integer linear program
- decomposition algorithm
- minimum cost
- mixed integer nonlinear programming
- convex hull
- optimal solution
- network design problem
- branch and bound
- upper bound
- lot sizing
- approximate solutions
- linear program
- computationally expensive
- valid inequalities
- probabilistic model
- cost function
- lower bound
- bayesian networks