Initialization of the Benders master problem using valid inequalities applied to fixed-charge network problems.
Georgios K. D. SaharidisMaria BoiléSotirios TheofanisPublished in: Expert Syst. Appl. (2011)
Keyphrases
- fixed charge
- transportation problem
- network flow problem
- network design
- valid inequalities
- minimum cost
- network design problem
- integer programming
- mixed integer programming
- network flow
- cutting plane
- mixed integer
- communication networks
- capacity expansion
- column generation
- minimal cost
- traveling salesman problem
- linear programming
- integer program
- lower and upper bounds
- feasible solution
- convex hull
- genetic algorithm
- continuous variables
- shortest path
- upper bound