Approximation Algorithms for a New Truck Loading Problem in Urban Freight Transportation.
Jie FanGuoqing WangMatthias ThürerPublished in: Transp. Sci. (2020)
Keyphrases
- approximation algorithms
- transportation networks
- network design problem
- public transportation
- public transport
- special case
- np hard
- travel time
- minimum cost
- worst case
- vertex cover
- road network
- facility location problem
- set cover
- open shop
- traveling salesman problem
- primal dual
- vehicle routing problem
- approximation ratio
- np hardness
- constant factor
- exact algorithms
- urban areas
- disjoint paths
- precedence constraints
- randomized algorithms
- approximation schemes
- polynomial time approximation
- traffic congestion
- undirected graph