Deliver or hold: Approximation Algorithms for the Periodic Inventory Routing Problem.
Takuro FukunagaAfshin NikzadR. RaviPublished in: APPROX-RANDOM (2014)
Keyphrases
- approximation algorithms
- np hard
- integer programming
- special case
- worst case
- vertex cover
- open shop
- facility location problem
- exact algorithms
- primal dual
- minimum cost
- constant factor
- set cover
- undirected graph
- network design problem
- approximation ratio
- randomized algorithms
- polynomial time approximation
- np hardness
- approximation schemes
- combinatorial auctions
- disjoint paths
- upper bound
- linear programming
- branch and bound algorithm
- optimal solution
- column generation