3433 search results - page 155 / 687 » Heuristics for a bidding problem |
155
click to vote
AISB
1995
Springer
15 years 10 months ago
1995
Springer
This paper discusses a series of recombination operators for the timetabling problem. These operators act upon a direct representation of the timetable and maintain the property of...
160
click to vote
GECCO
2004
Springer
15 years 12 months ago
2004
Springer
Several inverse problems exist in the atmospheric sciences that are computationally costly when using traditional gradient based methods. Unfortunately, many standard evolutionary ...
145
click to vote
EVOW
2003
Springer
15 years 11 months ago
2003
Springer
This paper considers the problem of minimizing the response time for a given database workload by a proper choice of indexes. This problem is NP-hard and known in the literature as...
148
click to vote
FLAIRS
2006
15 years 8 months ago
2006
The goal of this paper is to propose a tabu search heuristic for the car sequencing problem (CSP) used for the ROADEF 2005 international Challenge. This NP-hard problem was propos...
160
click to vote
COR
2010
15 years 6 months ago
2010
The Max-Min Diversity Problem (MMDP) consists in selecting a subset of elements from a given set in such a way that the diversity among the selected elements is maximized. The prob...