Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540744450

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Comparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions

Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics - Lecture Notes in Computer Science ◽

10.1007/978-3-540-74446-7_5 ◽

2007 ◽

pp. 61-75 ◽

Cited By ~ 9

Author(s):

Frank Neumann ◽

Dirk Sudholt ◽

Carsten Witt

Keyword(s):

Boolean Functions

A Multi-sphere Scheme for 2D and 3D Packing Problems

Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics - Lecture Notes in Computer Science ◽

10.1007/978-3-540-74446-7_19 ◽

2007 ◽

pp. 207-211 ◽

Cited By ~ 8

Author(s):

Takashi Imamichi ◽

Hiroshi Nagamochi

Keyword(s):

Packing Problems ◽

3D Packing ◽

2D And 3D

A Path Relinking Approach for the Multi-Resource Generalized Quadratic Assignment Problem

Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics - Lecture Notes in Computer Science ◽

10.1007/978-3-540-74446-7_9 ◽

2007 ◽

pp. 121-135 ◽

Cited By ~ 3

Author(s):

Mutsunori Yagiura ◽

Akira Komiya ◽

Kenya Kojima ◽

Koji Nonobe ◽

Hiroshi Nagamochi ◽

...

Keyword(s):

Assignment Problem ◽

Quadratic Assignment Problem ◽

Path Relinking ◽

Quadratic Assignment ◽

Generalized Quadratic Assignment Problem

Tuning the Performance of the MMAS Heuristic

Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics - Lecture Notes in Computer Science ◽

10.1007/978-3-540-74446-7_4 ◽

2007 ◽

pp. 46-60 ◽

Cited By ~ 17

Author(s):

Enda Ridge ◽

Daniel Kudenko

An Algorithm Portfolio for the Sub-graph Isomorphism Problem

Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics - Lecture Notes in Computer Science ◽

10.1007/978-3-540-74446-7_8 ◽

2007 ◽

pp. 106-120 ◽

Cited By ~ 7

Author(s):

Roberto Battiti ◽

Franco Mascia

Keyword(s):

Graph Isomorphism ◽

Isomorphism Problem ◽

Graph Isomorphism Problem ◽

Algorithm Portfolio

A Study of Neighborhood Structures for the Multiple Depot Vehicle Scheduling Problem

Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics - Lecture Notes in Computer Science ◽

10.1007/978-3-540-74446-7_17 ◽

2007 ◽

pp. 197-201 ◽

Cited By ~ 1

Author(s):

Benoît Laurent ◽

Jin-Kao Hao

Keyword(s):

Vehicle Scheduling ◽

Scheduling Problem ◽

Neighborhood Structures ◽

Multiple Depot

Simple Metaheuristics Using the Simplex Algorithm for Non-linear Programming

Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics - Lecture Notes in Computer Science ◽

10.1007/978-3-540-74446-7_21 ◽

2007 ◽

pp. 217-221 ◽

Cited By ~ 3

Author(s):

João Pedro Pedroso

Keyword(s):

Linear Programming ◽

Simplex Algorithm ◽

Non Linear Programming ◽

Non Linear

Probabilistic Beam Search for the Longest Common Subsequence Problem

Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics - Lecture Notes in Computer Science ◽

10.1007/978-3-540-74446-7_11 ◽

2007 ◽

pp. 150-161 ◽

Cited By ~ 7

Author(s):

Christian Blum ◽

Maria J. Blesa

Keyword(s):

Longest Common Subsequence ◽

Beam Search ◽

Longest Common Subsequence Problem ◽

Common Subsequence

Mixed Models for the Analysis of Local Search Components

Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics - Lecture Notes in Computer Science ◽

10.1007/978-3-540-74446-7_7 ◽

2007 ◽

pp. 91-105 ◽

Cited By ~ 2

Author(s):

Jørgen Bang-Jensen ◽

Marco Chiarandini ◽

Yuri Goegebeur ◽

Bent Jørgensen

Keyword(s):

Local Search ◽

Mixed Models

Designing and Tuning SLS Through Animation and Graphics: An Extended Walk-Through

Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics - Lecture Notes in Computer Science ◽

10.1007/978-3-540-74446-7_2 ◽

2007 ◽

pp. 16-30 ◽

Cited By ~ 2

Author(s):

Steven Halim ◽

Roland H. C. Yap

Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Comparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions

A Multi-sphere Scheme for 2D and 3D Packing Problems

A Path Relinking Approach for the Multi-Resource Generalized Quadratic Assignment Problem

Tuning the Performance of the MMAS Heuristic

An Algorithm Portfolio for the Sub-graph Isomorphism Problem

A Study of Neighborhood Structures for the Multiple Depot Vehicle Scheduling Problem

Simple Metaheuristics Using the Simplex Algorithm for Non-linear Programming

Probabilistic Beam Search for the Longest Common Subsequence Problem

Mixed Models for the Analysis of Local Search Components

Designing and Tuning SLS Through Animation and Graphics: An Extended Walk-Through

Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics - Lecture Notes in Computer Science
Latest Publications