Sensitivity analysis and relaxation of the Static Traffic Assignment Problem with Capacity Constraints.
Theophile CabannesElizabeth GlistaKshama DwarakanathXu RaoTanya VeeravalliAlexandre M. BayenPublished in: CDC (2019)
Keyphrases
- sensitivity analysis
- capacity constraints
- lagrangian relaxation
- np hard
- network flow
- minimum cost
- managerial insights
- integer programming
- feasible solution
- lp relaxation
- linear programming
- branch and bound algorithm
- dynamic programming
- column generation
- single item
- lower bound
- bicriteria
- lower and upper bounds
- iterative algorithms
- approximation algorithms
- optimal solution
- special case
- random variables
- shortest path
- search algorithm