Sciweavers

603 search results - page 53 / 121
» A General Approximation Technique for Constrained Forest Pro...
Sort
View
ORL
2006
105views more  ORL 2006»
15 years 1 months ago
Inventory placement in acyclic supply chain networks
The strategic safety stock placement problem is a constrained separable concave minimization problem and so is solvable, in principle, as a sequence of mixed-integer programming p...
Thomas L. Magnanti, Zuo-Jun Max Shen, Jia Shu, Dav...
SIAMMAX
2010
117views more  SIAMMAX 2010»
14 years 8 months ago
On the Convergence of Rational Ritz Values
Ruhe's rational Krylov method is a popular tool for approximating eigenvalues of a given matrix, though its convergence behavior is far from being fully understood. Under fair...
Bernhard Beckermann, Stefan Güttel, Raf Vande...
CORR
2010
Springer
142views Education» more  CORR 2010»
14 years 12 months ago
Budget Feasible Mechanisms
We study a novel class of mechanism design problems in which the outcomes are constrained by the payments. This basic class of mechanism design problems captures many common econom...
Christos H. Papadimitriou, Yaron Singer
WEA
2005
Springer
100views Algorithms» more  WEA 2005»
15 years 7 months ago
Rounding to an Integral Program
We present a general framework for approximating several NP-hard problems that have two underlying properties in common. First, the problems we consider can be formulated as intege...
Refael Hassin, Danny Segev
ANOR
2004
68views more  ANOR 2004»
15 years 1 months ago
Multilevel Refinement for Combinatorial Optimisation Problems
We consider the multilevel paradigm and its potential to aid the solution of combinatorial optimisation problems. The multilevel paradigm is a simple one, which at its most basic ...
Chris Walshaw