Sciweavers

193 search results - page 13 / 39
» Solving the multiple competitive facilities location problem
Sort
View
CEC
2010
IEEE
13 years 5 months ago
The one-commodity traveling salesman problem with selective pickup and delivery: An ant colony approach
We introduce a novel combinatorial optimization problem: the one-commodity traveling salesman problem with selective pickup and delivery (1-TSP-SELPD), characterized by the fact th...
Rafael Falcón, Xu Li, Amiya Nayak, Ivan Sto...
CHI
1995
ACM
13 years 11 months ago
Hyper-G and harmony: towards the next generation of networked information technology
Current networked information systems on the Internet, whilst extremely successful, run into problems of fragmentation, consistency, scalability, and loss of orientation. The deve...
Keith Andrews, Frank Kappe, Hermann A. Maurer
EUROCAST
1994
Springer
139views Hardware» more  EUROCAST 1994»
13 years 11 months ago
Illustrating Constraint Programming Systems in Logistic Planning
Logistic systems analysts use a wide array of modeling systems such as algebraic and logic programs. Two simple examples show how they mesh as Constraint Logic programs, emphasizin...
Jean-Michel Thizy
TC
2002
13 years 7 months ago
Grid Coverage for Surveillance and Target Location in Distributed Sensor Networks
We present novel grid coverage strategies for effective surveillance and target location in distributed sensor networks. We represent the sensor field as a grid (two or three-dimen...
Krishnendu Chakrabarty, S. Sitharama Iyengar, Hair...
TALG
2008
93views more  TALG 2008»
13 years 7 months ago
Limitations of cross-monotonic cost-sharing schemes
A cost-sharing scheme is a set of rules defining how to share the cost of a service (often computed by solving a combinatorial optimization problem) amongst serviced customers. A ...
Nicole Immorlica, Mohammad Mahdian, Vahab S. Mirro...