Sciweavers

121 search results - page 8 / 25
» Optimal Group Manipulation in Facility Location Problems
Sort
View
EOR
2007
93views more  EOR 2007»
14 years 9 months ago
Contour line construction for a new rectangular facility in an existing layout with rectangular departments
In a recent paper, Savas, Batta and Nagi [14] consider the optimal placement of a finite-sized facility in the presence of arbitrarily-shaped barriers under rectilinear travel. T...
Hari Kelachankuttu, Rajan Batta, Rakesh Nagi
STOC
2004
ACM
118views Algorithms» more  STOC 2004»
15 years 10 months ago
Boosted sampling: approximation algorithms for stochastic optimization
Several combinatorial optimization problems choose elements to minimize the total cost of constructing a feasible solution that satisfies requirements of clients. In the STEINER T...
Anupam Gupta, Martin Pál, R. Ravi, Amitabh ...
COR
2006
88views more  COR 2006»
14 years 9 months ago
An exact algorithm for the capacitated vertex p-center problem
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...
F. Aykut Özsoy, Mustafa Ç. Pinar
STOC
2001
ACM
122views Algorithms» more  STOC 2001»
15 years 10 months ago
Provisioning a virtual private network: a network design problem for multicommodity flow
Consider a setting in which a group of nodes, situated in a large underlying network, wishes to reserve bandwidth on which to support communication. Virtual private networks (VPNs...
Anupam Gupta, Jon M. Kleinberg, Amit Kumar, Rajeev...
65
Voted
DAM
2000
126views more  DAM 2000»
14 years 9 months ago
2-Medians in trees with pos/neg weights
This paper deals with facility location problems with pos=neg weights in trees. We consider two di erent objective functions which model two di erent ways to handle obnoxious faci...
Rainer E. Burkard, Eranda Çela, Helidon Dol...