Sciweavers

CEC
2010
IEEE
14 years 16 days ago
Population-Based Guided Local Search: Some preliminary experimental results
Based on the Proximate Optimality Principle in metaheuristics, a Population Based Guided Local Search (PGLS) framework for dealing with difficult combinatorial optimization problem...
Nasser Tairan, Qingfu Zhang
WSC
2008
14 years 1 months ago
Randomized methods for solving the Winner Determination Problem in combinatorial auctions
Combinatorial auctions, where buyers can bid on bundles of items rather than bidding them sequentially, often lead to more economically efficient allocations of financial resource...
Joshua C. C. Chan, Dirk P. Kroese
GECCO
2006
Springer
137views Optimization» more  GECCO 2006»
14 years 3 months ago
Structure and metaheuristics
Metaheuristics have often been shown to be effective for difficult combinatorial optimization problems. The reason for that, however, remains unclear. A framework for a theory of ...
Yossi Borenstein, Riccardo Poli