Line planning, path constrained network flow and inapproximability.
Christina BüsingSebastian StillerPublished in: Networks (2011)
Keyphrases
- network flow
- minimum cost
- approximation algorithms
- linear programming
- integer programming
- traffic control
- capacity constraints
- network flow problem
- min cost
- np hard
- endpoints
- planning problems
- shortest path
- set cover
- optimization model
- collision free
- line segments
- quadratic programming
- heuristic search
- np complete
- special case
- network flow formulation