179 search results - page 12 / 36 » Polynomial Time Approximation Schemes for Geometric k-Cluste... |
FOCM
2011
12 years 11 months ago
2011
We consider a wide class of semi linear Hamiltonian partial differential equations and their approximation by time splitting methods. We assume that the nonlinearity is polynomia...
WAOA
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. We consider the train delivery problem which is a generalization of the bin packing problem and is equivalent to a one dimensional version of the vehicle routing problem ...
DISOPT
2010
13 years 8 months ago
2010
While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few studies abou...
WAOA
2007
Springer
14 years 1 months ago
2007
Springer
We continue the study of bin packing with splittable items and cardinality constraints. In this problem, a set of items must be packed into as few bins as possible. Items may be s...
ICTCS
2001
Springer
14 years 8 days ago
2001
Springer
In this paper we study the job shop scheduling problem under the assumption that the jobs have controllable processing times. The fact that the jobs have controllable processing t...