Sciweavers

Share
120 search results - page 2 / 24
» Randomized Local Search, Evolutionary Algorithms, and the Mi...
Sort
View
GECCO
2005
Springer
107views Optimization» more  GECCO 2005»
10 years 4 months ago
Minimum spanning trees made easier via multi-objective optimization
Many real-world problems are multi-objective optimization problems and evolutionary algorithms are quite successful on such problems. Since the task is to compute or approximate t...
Frank Neumann, Ingo Wegener
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
10 years 4 months ago
Evolutionary algorithms and matroid optimization problems
We analyze the performance of evolutionary algorithms on various matroid optimization problems that encompass a vast number of efficiently solvable as well as NP-hard combinatoria...
Joachim Reichel, Martin Skutella
EUROCAST
2009
Springer
185views Hardware» more  EUROCAST 2009»
10 years 5 months ago
Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
Martin Gruber, Günther R. Raidl
IJKESDP
2010
149views more  IJKESDP 2010»
9 years 9 months ago
An approximate solution method based on tabu search for k-minimum spanning tree problems
—This paper considers k-minimum spanning tree problems. An existing solution algorithm based on tabu search, which was proposed by Katagiri et al., includes an iterative solving ...
Hideki Katagiri, Tomohiro Hayashida, Ichiro Nishiz...
GECCO
2006
Springer
148views Optimization» more  GECCO 2006»
10 years 2 months ago
An effective genetic algorithm for the minimum-label spanning tree problem
Given a connected, undirected graph G with labeled edges, the minimum-label spanning tree problem seeks a spanning tree on G to whose edges are attached the smallest possible numb...
Jeremiah Nummela, Bryant A. Julstrom
books