3433 search results - page 53 / 687 » Heuristics for a bidding problem |
HEURISTICS
1998
13 years 7 months ago
1998
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...
ECAI
2010
Springer
13 years 8 months ago
2010
Springer
The landmark cut heuristic is perhaps the strongest known polytime admissible approximation of the optimal delete relaxation heuristic h+ . Equipped with this heuristic, a best-fir...
ISSS
1996
IEEE
13 years 12 months ago
1996
IEEE
This paper considers the problem of task allocation for embedded, bus
AAAI
1997
13 years 9 months ago
1997
Cooperative distributed problem solving (CDPS) loosely-coupledagentscan be effectively modeledas a distributed constraint satisfaction problem(DCSP) whereeach agent has multiple l...
HEURISTICS
2002
13 years 7 months ago
2002
This paper presents operators searching large neighborhoods in order to solve the vehicle routing problem. They make use of the pruning and propagation techniques of constraint pr...