3433 search results - page 23 / 687 » Heuristics for a bidding problem |
AMAI
2004
Springer
14 years 1 months ago
2004
Springer
In this paper we formulate the combinatorial auction brokering problem as a Set Packing Problem (SPP) and apply a simulated annealing heuristic to solve SPP. Experimental results ...
COR
1999
13 years 7 months ago
1999
This article describes applications of modern heuristic search methods to pattern sequencing problems, i.e., problems seeking for a permutation of the rows of a given matrix with r...
HEURISTICS
2002
13 years 7 months ago
2002
Given a graph G, the Shortest Capacitated Paths Problem (SCPP) consists of determining a set of paths of least total length, linking given pairs of vertices in G, and satisfying c...
GECCO
2009
Springer
13 years 11 months ago
2009
Springer
When evaluating a heuristic for a combinatorial problem, randomly generated instances of the problem may not provide a thorough exploration of the heuristic's performance, an...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
The quadratic multiple knapsack problem extends the quadratic knapsack problem with K knapsacks, each with its own capacity Ck. A greedy heuristic fills the knapsacks one at a tim...