4 search results - page 1 / 1 » To Fill or Not to Fill: The Gas Station Problem |
ESA
2007
Springer
13 years 11 months ago
2007
Springer
In this paper we study several routing problems that generalize shortest paths and the Traveling Salesman Problem. We consider a more general model that incorporates the actual co...
GECCO
2006
Springer
13 years 8 months ago
2006
Springer
The quadratic multiple knapsack problem extends the quadratic knapsack problem with K knapsacks, each with its own capacity Ck. A greedy heuristic fills the knapsacks one at a tim...
TIS
1998
13 years 4 months ago
1998
: Every information channel within Africa is restricted. Limited budgets cause televison stations to produce few shows of their own and to fill airtime with cheap American imports ...
DASFAA
2003
IEEE
13 years 10 months ago
2003
IEEE
Modern database applications including computeraided design (CAD), medical imaging, or molecular biology impose new requirements on spatial query processing. Particular problems a...