Sciweavers

121 search results - page 12 / 25
» Optimal Group Manipulation in Facility Location Problems
Sort
View
MP
1998
109views more  MP 1998»
14 years 9 months ago
Rounding algorithms for covering problems
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
Dimitris Bertsimas, Rakesh V. Vohra
APPROX
2005
Springer
136views Algorithms» more  APPROX 2005»
15 years 3 months ago
What About Wednesday? Approximation Algorithms for Multistage Stochastic Optimization
The field of stochastic optimization studies decision making under uncertainty, when only probabilistic information about the future is available. Finding approximate solutions to...
Anupam Gupta, Martin Pál, R. Ravi, Amitabh ...
ANOR
2002
99views more  ANOR 2002»
14 years 9 months ago
An Inventory-Location Model: Formulation, Solution Algorithm and Computational Results
We introduce a distribution center (DC) location model that incorporates working inventory and safety stock inventory costs at the distribution centers. In addition, the model inco...
Mark S. Daskin, Collette R. Coullard, Zuo-Jun Max ...
RAS
2007
109views more  RAS 2007»
14 years 9 months ago
On point-to-point motion planning for underactuated space manipulator systems
In free-floating mode, space manipulator systems have their actuators turned off, and exhibit nonholonomic behavior due to angular momentum conservation. The system is underactua...
Ioannis Tortopidis, Evangelos Papadopoulos
TALG
2008
93views more  TALG 2008»
14 years 9 months ago
Limitations of cross-monotonic cost-sharing schemes
A cost-sharing scheme is a set of rules defining how to share the cost of a service (often computed by solving a combinatorial optimization problem) amongst serviced customers. A ...
Nicole Immorlica, Mohammad Mahdian, Vahab S. Mirro...