A Mixed Integer Linear Program for the Rapid Transit Network Design Problem with Static Modal Competition (Short Paper).
Gabriel Gutiérrez-JarpaGilbert LaporteVladimir MarianovLuigi MocciaPublished in: ATMOS (2015)
Keyphrases
- network design problem
- mixed integer linear program
- mixed integer
- rapid transit
- feasible solution
- linear program
- continuous relaxation
- lagrangian relaxation
- mixed integer linear programming
- network design
- minimal cost
- valid inequalities
- mixed integer programming
- approximation algorithms
- transportation networks
- linear programming problems
- linear programming
- cutting plane
- convex hull
- lot sizing
- column generation
- integer programming
- optimal solution
- branch and bound
- continuous variables
- lp relaxation
- mathematical model
- tabu search
- objective function
- packing problem
- integer variables
- special case
- lower bound
- quadratic program
- dynamic systems
- graphical models