Tabu search and iterated local search for the cyclic bottleneck assignment problem
From MaRDI portal
Publication:1652664
DOI10.1016/j.cor.2018.04.004zbMath1458.90445OpenAlexW2796934628WikidataQ130038656 ScholiaQ130038656MaRDI QIDQ1652664
A. B. Chaouch, Fazle Baki, Lanjian Zhu, Xiangyong Li
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2018.04.004
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Application of the cohort-intelligence optimization method to three selected combinatorial optimization problems
- Quadratic assignment problems
- Selected topics on assignment problems
- A tabu search heuristic for the quay crane scheduling problem
- Assignment problems: a golden anniversary survey
- On the bottleneck assignment problem
- Engineering stochastic local search algorithms. Designing, implementing and analyzing effective heuristics. International workshop, SLS 2007, Brussels, Belgium, September 6--8, 2007. Proceedings.
- The Quadratic Assignment Problem
- Tuning an Algorithm Using Design of Experiments
- Assignment Problems and the Location of Economic Activities
- Cyclic Scheduling via Integer Programs with Circular Ones
- P-Complete Approximation Problems
- A Simplex Method for Function Minimization
- Handbook of metaheuristics
- Using experimental design to find effective parameter settings for heuristics
This page was built for publication: Tabu search and iterated local search for the cyclic bottleneck assignment problem
