8 search results - page 1 / 2 » On the capacitated concentrator location problem: a reformul... |
COR
2006
13 years 5 months ago
2006
COR
2008
13 years 5 months ago
2008
This work deals with a multi-period capacitated location problem inspired by telecommunication access network planning problems, where demands and costs vary from one period to an...
COR
2006
13 years 5 months ago
2006
We develop a simple and practical exact algorithm for the problem of locating p facilities and assigning clients7 to them within capacity restrictions in order to minimize the max...
CP
1999
Springer
13 years 9 months ago
1999
Springer
Reformulating constraint satisfaction problems (CSPs) in lower arity is a common procedure when computing consistency. Lower arity CSPs are simpler to treat than high arity CSPs. ...
SODA
2010
ACM
14 years 2 months ago
2010
ACM
In the capacitated vehicle routing problem, introduced by Dantzig and Ramser in 1959, we are given the locations of n customers and a depot, along with a vehicle of capacity k, an...