Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSLS 2007: Brussels, Belgium
- Thomas Stützle, Mauro Birattari, Holger H. Hoos:
Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics, International Workshop, SLS 2007, Brussels, Belgium, September 6-8, 2007, Proceedings. Lecture Notes in Computer Science 4638, Springer 2007, ISBN 978-3-540-74445-0
- Arne Løkketangen:
The Importance of Being Careful. 1-15 - Steven Halim, Roland H. C. Yap:
Designing and Tuning SLS Through Animation and Graphics: An Extended Walk-Through. 16-30 - Paola Pellegrini, Mauro Birattari
:
Implementation Effort and Performance. 31-45 - Enda Ridge, Daniel Kudenko:
Tuning the Performance of the MMAS Heuristic. 46-60 - Frank Neumann, Dirk Sudholt, Carsten Witt:
Comparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions. 61-75 - Luca Di Gaspero, Andrea Roli, Andrea Schaerf:
EasyAnalyzer: An Object-Oriented Framework for the Experimental Analysis of Stochastic Local Search Algorithms. 76-90 - Jørgen Bang-Jensen, Marco Chiarandini, Yuri Goegebeur, Bent Jørgensen:
Mixed Models for the Analysis of Local Search Components. 91-105 - Roberto Battiti, Franco Mascia:
An Algorithm Portfolio for the Sub-graph Isomorphism Problem. 106-120 - Mutsunori Yagiura, Akira Komiya, Kenya Kojima, Koji Nonobe, Hiroshi Nagamochi, Toshihide Ibaraki, Fred W. Glover:
A Path Relinking Approach for the Multi-Resource Generalized Quadratic Assignment Problem. 121-135 - Hisafumi Kokubugata, Ayako Moriyama, Hironao Kawashima:
A Practical Solution Using Simulated Annealing for General Routing Problems with Nodes, Edges, and Arcs. 136-149 - Christian Blum, Maria J. Blesa:
Probabilistic Beam Search for the Longest Common Subsequence Problem. 150-161 - Dag Haugland:
A Bidirectional Greedy Heuristic for the Subspace Selection Problem. 162-176
Short Papers
- Luca Di Gaspero, Andrea Schaerf:
EasySyn++: A Tool for Automatic Synthesis of Stochastic Local Search Algorithms. 177-181 - Jaya Sreevalsan-Nair, Meike Verhoeven, David L. Woodruff, Ingrid Hotz, Bernd Hamann:
Human-Guided Enhancement of a Stochastic Local Search: Visualization and Adjustment of 3D Pheromone. 182-186 - Joseph M. Pasia, Karl F. Doerner, Richard F. Hartl, Marc Reimann:
Solving a Bi-objective Vehicle Routing Problem by Pareto-Ant Colony Optimization. 187-191 - Hideki Hashimoto, Youichi Ezaki, Mutsunori Yagiura, Koji Nonobe, Toshihide Ibaraki, Arne Løkketangen:
A Set Covering Approach for the Pickup and Delivery Problem with General Constraints on Each Route. 192-196 - Benoît Laurent, Jin-Kao Hao:
A Study of Neighborhood Structures for the Multiple Depot Vehicle Scheduling Problem. 197-201 - Thijs Urlings, Rubén Ruiz:
Local Search in Complex Scheduling Problems. 202-206 - Takashi Imamichi, Hiroshi Nagamochi:
A Multi-sphere Scheme for 2D and 3D Packing Problems. 207-211 - Nenad Mladenovic, Frank Plastria, Dragan Urosevic:
Formulation Space Search for Circle Packing Problems. 212-216 - João Pedro Pedroso:
Simple Metaheuristics Using the Simplex Algorithm for Non-linear Programming. 217-221
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2023-09-28 01:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
