Valid inequalities for the non-unit demand capacitated minimum spanning tree problem with arc time windows and flow costs.
Manolis N. KritikosGeorge IoannouPublished in: Int. J. Prod. Res. (2024)
Keyphrases
- valid inequalities
- traveling salesman problem
- network flow problem
- network design problem
- mixed integer
- mixed integer programming
- integer programming
- linear programming
- cutting plane algorithm
- fixed cost
- cutting plane
- mixed integer linear programs
- feasible solution
- lower and upper bounds
- convex hull
- production cost
- column generation
- combinatorial optimization
- vehicle routing problem
- primal dual
- ant colony optimization
- total cost
- capacity expansion
- integer program
- planning horizon
- lot sizing
- facet defining inequalities
- transportation networks
- expected cost
- network design
- linear program
- computational complexity