Solution of the cumulative assignment problem with a well-structured tabu search method
From MaRDI portal
Publication:1806772
DOI10.1023/A:1009647225748zbMATH Open0938.90047OpenAlexW1576274444WikidataQ59222302 ScholiaQ59222302MaRDI QIDQ1806772FDOQ1806772
Andrea Lodi, Francesco Maffioli, Mauro Dell'Amico
Publication date: 8 November 1999
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1009647225748
Recommendations
Cited In (10)
- Comparing metaheuristic algorithms for SONET network design problems
- Hybrid Metaheuristics: An Introduction
- A tabu search algorithm for the routing and capacity assignment problem in computer networks
- Local search algorithms for the \(k\)-cardinality tree problem.
- A branch-and-cut method for the obnoxious \(p\)-median problem
- An Object-Oriented Methodology for Solving Assignment-Type Problems with Neighborhood Search Techniques
- Tabu search for the multilevel generalized assignment problem
- Categorized Assignment Scheduling: a Tabu Search Approach
- Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care
- A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem
This page was built for publication: Solution of the cumulative assignment problem with a well-structured tabu search method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1806772)