Login / Signup
Fast Approximation Algorithms for the One-Warehouse Multi-Retailer Problem Under General Cost Structures and Capacity Constraints.
Jean-Philippe Gayon
Guillaume Massonnet
Christophe Rapine
Gautier Stauffer
Published in:
Math. Oper. Res. (2017)
Keyphrases
</>
approximation algorithms
minimum cost
capacity constraints
special case
np hard
network flow
worst case
constant factor
supply chain
primal dual
combinatorial auctions
optimal solution
scheduling problem
knapsack problem
integer programming