Login / Signup
An asymptotic 98.5%-effective lower bound on fixed partition policies for the inventory-routing problem.
Shoshana Anily
Julien Bramel
Published in:
Discret. Appl. Math. (2004)
Keyphrases
</>
lower bound
upper bound
worst case
sufficiently accurate
data sets
high quality
np hard
real time
objective function
optimal policy
branch and bound algorithm
database
machine learning
markov random field
lower bounding