Login / Signup
Using dual feasible functions to construct fast lower bounds for routing and location problems.
Daniel Cosmin Porumbel
Gilles Goncalves
Published in:
Discret. Appl. Math. (2015)
Keyphrases
</>
location problems
lower bound
dual feasible
single facility
linear programming
upper bound
branch and bound algorithm
branch and bound
objective function
lower and upper bounds
bicriteria
np hard
routing algorithm
optimal solution
primal dual
worst case
knapsack problem
dynamic programming