1204 search results - page 167 / 241 » Termination of Polynomial Programs |
ICALP
2005
Springer
15 years 6 months ago
2005
Springer
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been r...
120
Voted
IFIP
2004
Springer
15 years 6 months ago
2004
Springer
We study the general packing problem with M constraints. In [Jansen and Zhang, TCS 2002] a c(1 + ε)-approximation algorithm for the general packing problem was proposed. A block s...
116
click to vote
APPROX
2008
Springer
15 years 2 months ago
2008
Springer
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
100
Voted
EOR
2007
15 years 17 days ago
2007
In this paper, we present a stochastic version of the Location Model with Risk Pooling (LMRP) that optimizes location, inventory, and allocation decisions under random parameters ...
73
Voted
ORL
2007
15 years 3 days ago
2007
This paper introduces the single item lot sizing problem with inventory gains. This problem is a generalization of the classical single item capacitated lot sizing problem to one ...