371 search results - page 3 / 75 » Algorithms for the transportation problem in geometric setti... |
COMPGEOM
2009
ACM
14 years 9 days ago
2009
ACM
Given a set system (X, R), the hitting set problem is to find a smallest-cardinality subset H ⊆ X, with the property that each range R ∈ R has a non-empty intersection with H...
STOC
2010
ACM
13 years 10 months ago
2010
ACM
There has been much progress on geometric set cover problems, but most known techniques only apply to the unweighted setting. For the weighted setting, very few results are known ...
COCOON
2006
Springer
13 years 9 months ago
2006
Springer
We consider the problem of placing a set of disks in a region containing obstacles such that no two disks intersect. We are given a bounding polygon P and a set R of possibly inte...
GECCO
2007
Springer
13 years 9 months ago
2007
Springer
EVITA, standing for Evolutionary Inventory and Transportation Algorithm, aims to be a commercial tool to address the problem of minimising both the transport and inventory costs o...
AI
2009
Springer
14 years 12 days ago
2009
Springer
Abstract. This paper solves a static and transportation facility location allocation problem defined as follows: given a set of locations Loc and a set of demand objects D located ...