A maritime inventory routing problem: Discrete time formulations and valid inequalities.
Agostinho AgraHenrik AnderssonMarielle ChristiansenLaurence A. WolseyPublished in: Networks (2013)
Keyphrases
- valid inequalities
- integer programming
- cutting plane algorithm
- network design problem
- cutting plane
- linear programming
- mixed integer linear programs
- randomly generated problems
- linear programming relaxation
- capacitated fixed charge
- column generation
- np hard
- lagrangian relaxation
- integer programming formulation
- production planning
- traveling salesman problem
- constraint programming
- integer program
- mixed integer
- network flow
- lower and upper bounds
- convex hull
- mixed integer programming
- lp relaxation
- transportation problem
- primal dual
- feasible solution
- dynamic programming