Iterated local search for the quadratic assignment problem-Reference-Cited by-同舟云学术

Iterated local search for the quadratic assignment problem

Published:2006-11 Issue:3 Volume:174 Page:1519-1539
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Stützle Thomas

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference50 articles.

1. Solving large quadratic assignment problems on computational grids;Anstreicher;Mathematical Programming,2002

2. Guided local search with shifting bottleneck for job shop scheduling;Balas;Management Science,1998

3. Parallel biased search for combinatorial optimization: Genetic algorithms and TABU;Battiti;Microprocessor and Microsystems,1992

4. The reactive tabu search;Battiti;ORSA Journal on Computing,1994

5. E.B. Baum, Iterated descent: A better algorithm for local search in combinatorial optimization problems, Manuscript, 1986.

Cited by 199 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Service Selection under Uncertainty;Computers & Operations Research;2025-01

2. Solving the tourist trip planning problem with attraction patterns using meta-heuristic techniques;Information Technology & Tourism;2024-08-12

3. Information Flow and Laplacian Dynamics on Local Optima Networks;2024 IEEE Congress on Evolutionary Computation (CEC);2024-06-30

4. Adaptive iterated local search for quadratic assignment problem;AIP Conference Proceedings;2024

5. Entropy, Search Trajectories, and Explainability for Frequency Fitness Assignment;Lecture Notes in Computer Science;2024