77 search results - page 1 / 16 » An exact algorithm for the capacitated vertex p-center probl... |
COR
2006
13 years 4 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...
EOR
2010
13 years 4 months ago
2010
In this work we study the Capacitated p-Center Problem (CpCP) and we propose an exact algorithm to solve it. We study two auxiliary problems and their relation to CpCP, and we pro...
WADS
2005
Springer
13 years 10 months ago
2005
Springer
Important generalizations of the Vertex Cover problem (Connected Vertex Cover, Capacitated Vertex Cover, and Maximum Partial Vertex Cover) have been intensively studied in terms of...
ICTCS
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We study efficient exact algorithms for several problems including Vertex Bipartization, Feedback Vertex Set, 3-Hitting Set, Max Cut in graphs with maximum degree at most...
COCOON
2010
Springer
13 years 9 months ago
2010
Springer