3433 search results - page 133 / 687 » Heuristics for a bidding problem |
149
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
A variant of two-dimensional packing problem was given in the GECCO’2008 competition. This paper describes the genetic algorithm that produced the best result and thus won the N...
169
click to vote
EVOW
2007
Springer
16 years 20 days ago
2007
Springer
The Shortest Common Supersequence Problem (SCSP) is a well-known hard combinatorial optimization problem that formalizes many real world problems. This paper presents a novel rando...
155
click to vote
WEA
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. We implement the approximation algorithm for the multicast congestion problem in communication networks in [14] based on the fast approximation algorithm for packing prob...
183
click to vote
GECCO
2000
Springer
15 years 10 months ago
2000
Springer
A genetic local search (GLS) algorithm, which is a combination technique of genetic algorithm and local search, for the unconstrained binary quadratic programming problem (BQP) is...
148
click to vote
EOR
2007
15 years 6 months ago
2007
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...