Sciweavers

2354 search results - page 102 / 471
» Assignment Problems
Sort
View
CORR
2007
Springer
95views Education» more  CORR 2007»
13 years 10 months ago
Solving the subset-sum problem with a light-based device
We propose a special computational device which uses light rays for solving the subset-sum problem. The device has a graph-like representation and the light is traversing it by fol...
Mihai Oltean, Oana Muntean
EOR
2007
82views more  EOR 2007»
13 years 10 months ago
The equitable location problem on the plane
This paper considers the problem of locating M facilities on the unit square so as to minimize the maximal demand faced by each facility subject to closest assignments and coverag...
Opher Baron, Oded Berman, Dmitry Krass, Qian Wang
TEC
2002
163views more  TEC 2002»
13 years 9 months ago
Ants can solve constraint satisfaction problems
In this paper, we describe a new incomplete approach for solving constraint satisfaction problems (CSPs) based on the ant colony optimization (ACO) metaheuristic. The idea is to us...
Christine Solnon
ICCSA
2007
Springer
14 years 4 months ago
Solving a Practical Examination Timetabling Problem: A Case Study
This paper presents a Greedy-Least Saturation Degree (G-LSD) heuristic (which is an adaptation of the least saturation degree heuristic) to solve a real-world examination timetabli...
Masri Ayob, Ariff Md. Ab. Malik, Salwani Abdullah,...
COCO
2004
Springer
133views Algorithms» more  COCO 2004»
14 years 3 months ago
Parameterized Complexity of Constraint Satisfaction Problems
We prove a parameterized analog of Schaefer’s Dichotomy Theorem: we show that for every finite boolean constraint family F, deciding whether a formula containing constraints fr...
Dániel Marx