36 search results - page 2 / 8 » Capacitated facility location problem with general setup cos... |
MP
1998
14 years 11 months ago
1998
We consider the polyhedral approach to solving the capacitated facility location problem. The valid inequalities considered are the knapsack, ow cover, e ective capacity, single d...
SODA
2008
ACM
15 years 1 months ago
2008
ACM
This paper studies an extension of the k-median problem where we are given a metric space (V, d) and not just one but m client sets {Si V }m i=1, and the goal is to open k facili...
HEURISTICS
2008
14 years 11 months ago
2008
In this talk we present a unified Variable Neighborhood Search (VNS) algorithm for the Capacitated Arc Routing Problem (CARP) and some of its variants - the Capacitated Arc Routin...
EOR
2007
14 years 11 months ago
2007
Capacity effects are investigated, particularly as regards congestion of facilities with immobile (or fixed) servers. A review is given of research to date in this area, togethe...
110
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
We introduce a problem that is a common generalization of the uncapacitated facility location (UFL) and minimum latency (ML) problems, where facilities not only need to be opened ...