Sciweavers

374 search results - page 33 / 75
» Lower-bounded facility location
Sort
View
SIAMCOMP
1998
117views more  SIAMCOMP 1998»
13 years 9 months ago
The Queue-Read Queue-Write PRAM Model: Accounting for Contention in Parallel Algorithms
This paper introduces the queue-read, queue-write (qrqw) parallel random access machine (pram) model, which permits concurrent reading and writing to shared memory locations, but ...
Phillip B. Gibbons, Yossi Matias, Vijaya Ramachand...
EOR
2006
81views more  EOR 2006»
13 years 10 months ago
A note on duality gap in the simple plant location problem
This paper studies the duality gap in the simple plant location problem, and presents general formulas for the gap when certain complementary slackness conditions are satisfied. W...
Nenad Mladenovic, Jack Brimberg, Pierre Hansen
MDM
2004
Springer
14 years 3 months ago
Middleware Providing Dynamic Group Communication Facility for Cellular Phone Applications
In this paper, we propose a middleware library for efficiently developing distributed cooperative applications consisting of a large number of cellular phones with Java executors....
Kouji Nishigaki, Keiichi Yasumoto, Takaaki Umedu, ...
CP
2004
Springer
14 years 3 months ago
A Hybrid Method for Planning and Scheduling
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve planning and scheduling problems. Tasks are allocated to facilities using MILP and sche...
John N. Hooker
HEURISTICS
1998
103views more  HEURISTICS 1998»
13 years 9 months ago
Computing Approximate Solutions of the Maximum Covering Problem with GRASP
We consider the maximum covering problem, a combinatorial optimization problem that arises in many facility location problems. In this problem, a potential facility site covers a s...
Mauricio G. C. Resende