Methodological Advances and New Formulations for Bilevel Network Design Problems.
Pirmin FontainePublished in: OR (2017)
Keyphrases
- network design problem
- valid inequalities
- linear programming
- integer programming
- capacitated fixed charge
- approximation algorithms
- network design
- network flow problem
- mixed integer programming
- traveling salesman problem
- feasible solution
- lagrangian relaxation
- mixed integer
- branch and bound
- minimal cost
- primal dual
- convex hull
- linear program
- column generation
- cutting plane
- lower and upper bounds
- mathematical programming
- np hard
- objective function
- dynamic programming