1647 search results - page 15 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
APPROX
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. We consider the two-dimensional bin packing and strip packing problem, where a list of rectangles has to be packed into a minimal number of rectangular bins or a strip of...
COMPGEOM
2009
ACM
14 years 3 months ago
2009
ACM
We present the Iterated-Tverberg algorithm, the first deterministic algorithm for computing an approximate centerpoint of a set S ∈ Rd with running time sub-exponential in d. T...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
In multi-criteria optimization, several objective functions are to be optimized. Since the different objective functions are usually in conflict with each other, one cannot conside...
SODA
2012
ACM
11 years 11 months ago
2012
ACM
In the Stochastic Orienteering problem, we are given a metric, where each node also has a job located there with some deterministic reward and a random size. (Think of the jobs as...
WEA
2010
Springer
14 years 1 months ago
2010
Springer
We investigate how the recently developed different approaches to generate randomized roundings satisfying disjoint cardinality constraints behave when used in two classical algori...