Sciweavers

3433 search results - page 209 / 687
» Heuristics for a bidding problem
Sort
View
GECCO
2008
Springer
132views Optimization» more  GECCO 2008»
15 years 7 months ago
Subheuristic search and scalability in a hyperheuristic
Our previous work has introduced a hyperheuristic (HH) approach based on Genetic Programming (GP). There, GP employs usergiven languages where domain-specific local heuristics ar...
Robert E. Keller, Riccardo Poli
HEURISTICS
2008
153views more  HEURISTICS 2008»
15 years 6 months ago
Bringing order into the neighborhoods: relaxation guided variable neighborhood search
In this article we investigate a new variant of Variable Neighborhood Search (VNS): Relaxation Guided Variable Neighborhood Search. It is based on the general VNS scheme and a new...
Jakob Puchinger, Günther R. Raidl
DAM
2006
89views more  DAM 2006»
15 years 6 months ago
First vs. best improvement: An empirical study
When applying the 2-opt heuristic to the travelling salesman problem, selecting the best improvement at each iteration gives worse results on average than selecting the first impr...
Pierre Hansen, Nenad Mladenovic
TC
2002
15 years 6 months ago
Distributing Layered Encoded Video through Caches
The efficient distribution of stored information has become a major concern in the Internet which has increasingly become a vehicle for the transport of stored video. Because of th...
Jussi Kangasharju, Felix Hartanto, Martin Reisslei...
EVOW
2009
Springer
16 years 1 months ago
Iterated Local Search for Minimum Power Symmetric Connectivity in Wireless Networks
The problem of finding a symmetric connectivity topology with minimum power consumption in a wireless ad-hoc network is NPhard. This work presents a new iterated local search to s...
Steffen Wolf, Peter Merz