On two new formulations for the fixed charge network design problem with shortest path constraints.
Ikram BourasRosa FigueiredoMichael PossFen ZhouPublished in: Comput. Oper. Res. (2019)
Keyphrases
- shortest path
- valid inequalities
- network design problem
- lagrangian relaxation
- network flow problem
- mixed integer
- integer programming
- mixed integer programming
- lower and upper bounds
- traveling salesman problem
- linear programming
- convex hull
- feasible solution
- integer program
- road network
- cutting plane
- network design
- column generation
- primal dual
- routing algorithm
- travel time
- transportation networks
- routing problem
- constraint programming
- linear program
- upper bound
- continuous variables
- approximation algorithms
- state space
- tabu search
- minimal cost
- transportation problem
- lower bound
- lot sizing
- lp relaxation
- branch and bound
- network flow
- reinforcement learning