1647 search results - page 115 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
150
Voted
SSDBM
2003
IEEE
15 years 10 months ago
2003
IEEE
Space constrained optimization problems arise in a multitude of important applications such as data warehouses and pervasive computing. A typical instance of such problems is to s...
126
click to vote
FOCS
1998
IEEE
15 years 9 months ago
1998
IEEE
In the Finite Capacity Dial-a-Ride problem the input is a metric space, a set of objects {di}, each specifying a source si and a destination ti, and an integer k--the capacity of t...
148
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
130
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
Recently, studies with the XCS classifier system on Boolean functions have shown that in certain types of functions simple crossover operators can lead to disruption and, conseque...
141
click to vote
COR
2006
15 years 5 months ago
2006
This paper presents an extension of the capacitated facility location problem (CFLP), in which the general setup cost functions and multiple facilities in one site are considered....