Volume 156,
Number 1,
December 2007
Special Issue on Stochastic Search Algorithms
- Holger H. Hoos, Thomas Stützle:
Preface.
1-4
- Paolo Detti, Carlo Meloni, Marco Pranzo:
Local search algorithms for finding the Hamiltonian completion number of line graphs.
5-24
- Mirjam Dür, Charoenchai Khompatraporn, Zelda B. Zabinsky:
Solving fractional problems with dynamic multistart improving hit-and-run.
25-44
- D. Duvivier, O. Roux, V. Dhaevers, Nadine Meskens, Abdelhakim Artiba:
Multicriteria optimisation and simulation: an industrial application.
45-60
- Haipeng Guo, William H. Hsu:
A machine learning approach to algorithm selection for NP\mathcal{NP} -hard optimization problems: a case study on the MPE problem.
61-82
- Luis Paquete, Tommaso Schiavinotto, Thomas Stützle:
On local optima in multiobjective combinatorial optimization problems.
83-97
- Y. G. Petalas, Konstantinos E. Parsopoulos, Michael N. Vrahatis:
Memetic particle swarm optimization.
99-127
- Steven David Prestwich:
Exploiting relaxation in local search for LABS.
129-141
- Rubén Ruiz, Ali Allahverdi:
Some effective heuristics for no-wait flowshops with setup times to minimize total completion time.
143-171
Copyright © Tue Dec 1 16:28:24 2009
by Michael Ley (ley@uni-trier.de)