|
|
Conferences in DBLP
(sls)
2007 (conf/sls/2007)
- Arne Løkketangen
The Importance of Being Careful. [Citation Graph (0, 0)][DBLP]
SLS, 2007, pp:1-15 [Conf]
- Steven Halim, Roland H. C. Yap
Designing and Tuning SLS Through Animation and Graphics: An Extended Walk-Through. [Citation Graph (0, 0)][DBLP]
SLS, 2007, pp:16-30 [Conf]
- Paola Pellegrini, Mauro Birattari
Implementation Effort and Performance. [Citation Graph (0, 0)][DBLP]
SLS, 2007, pp:31-45 [Conf]
- Enda Ridge, Daniel Kudenko
Tuning the Performance of the MMAS Heuristic. [Citation Graph (0, 0)][DBLP]
SLS, 2007, pp:46-60 [Conf]
- Frank Neumann, Dirk Sudholt, Carsten Witt
Comparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions. [Citation Graph (0, 0)][DBLP]
SLS, 2007, pp:61-75 [Conf]
- Luca Di Gaspero, Andrea Roli, Andrea Schaerf
EasyAnalyzer: An Object-Oriented Framework for the Experimental Analysis of Stochastic Local Search Algorithms. [Citation Graph (0, 0)][DBLP]
SLS, 2007, pp:76-90 [Conf]
- Jørgen Bang-Jensen, Marco Chiarandini, Yuri Goegebeur, Bent Jørgensen
Mixed Models for the Analysis of Local Search Components. [Citation Graph (0, 0)][DBLP]
SLS, 2007, pp:91-105 [Conf]
- Roberto Battiti, Franco Mascia
An Algorithm Portfolio for the Sub-graph Isomorphism Problem. [Citation Graph (0, 0)][DBLP]
SLS, 2007, pp:106-120 [Conf]
- Mutsunori Yagiura, Akira Komiya, Kenya Kojima, Koji Nonobe, Hiroshi Nagamochi, Toshihide Ibaraki, Fred Glover
A Path Relinking Approach for the Multi-Resource Generalized Quadratic Assignment Problem. [Citation Graph (0, 0)][DBLP]
SLS, 2007, pp:121-135 [Conf]
- Hisafumi Kokubugata, Ayako Moriyama, Hironao Kawashima
A Practical Solution Using Simulated Annealing for General Routing Problems with Nodes, Edges, and Arcs. [Citation Graph (0, 0)][DBLP]
SLS, 2007, pp:136-149 [Conf]
- Christian Blum, Maria J. Blesa
Probabilistic Beam Search for the Longest Common Subsequence Problem. [Citation Graph (0, 0)][DBLP]
SLS, 2007, pp:150-161 [Conf]
- Dag Haugland
A Bidirectional Greedy Heuristic for the Subspace Selection Problem. [Citation Graph (0, 0)][DBLP]
SLS, 2007, pp:162-176 [Conf]
- Luca Di Gaspero, Andrea Schaerf
EasySyn++: A Tool for Automatic Synthesis of Stochastic Local Search Algorithms. [Citation Graph (0, 0)][DBLP]
SLS, 2007, pp:177-181 [Conf]
- 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. [Citation Graph (0, 0)][DBLP]
SLS, 2007, pp:182-186 [Conf]
- Joseph M. Pasia, Karl F. Doerner, Richard F. Hartl, Marc Reimann
Solving a Bi-objective Vehicle Routing Problem by Pareto-Ant Colony Optimization. [Citation Graph (0, 0)][DBLP]
SLS, 2007, pp:187-191 [Conf]
- 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. [Citation Graph (0, 0)][DBLP]
SLS, 2007, pp:192-196 [Conf]
- Benoît Laurent, Jin-Kao Hao
A Study of Neighborhood Structures for the Multiple Depot Vehicle Scheduling Problem. [Citation Graph (0, 0)][DBLP]
SLS, 2007, pp:197-201 [Conf]
- Thijs Urlings, Rubén Ruiz
Local Search in Complex Scheduling Problems. [Citation Graph (0, 0)][DBLP]
SLS, 2007, pp:202-206 [Conf]
- Takashi Imamichi, Hiroshi Nagamochi
A Multi-sphere Scheme for 2D and 3D Packing Problems. [Citation Graph (0, 0)][DBLP]
SLS, 2007, pp:207-211 [Conf]
- Nenad Mladenovic, Frank Plastria, Dragan Urosevic
Formulation Space Search for Circle Packing Problems. [Citation Graph (0, 0)][DBLP]
SLS, 2007, pp:212-216 [Conf]
- João Pedro Pedroso
Simple Metaheuristics Using the Simplex Algorithm for Non-linear Programming. [Citation Graph (0, 0)][DBLP]
SLS, 2007, pp:217-221 [Conf]
|
