Solution of the cumulative assignment problem with a well-structured tabu search method

DOI10.1023/A:1009647225748MaRDI QIDQ1806772zbMATH OpenOpenAlexWikidataFDO

Authors Mauro Dell'Amico, Andrea Lodi, Francesco Maffioli

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

zbMATH Keywords

metaheuristicstabu searchlinear assignmentcumulative functions

Mathematics Subject Classification ID

Search theory (90B40) Discrete location and assignment (90B80)

Recommendations

• Categorized Assignment Scheduling: a Tabu Search Approach
• A tabu search heuristic for the generalized assignment problem
• A Tabu Search Algorithm for the Resource-Constrained Assignment Problem
• Solving the quadratic assignment problem by the repeated iterated tabu search method

Cited in

(11)

• Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care
• Local search algorithms for the \(k\)-cardinality tree problem.
• Tabu search and iterated local search for the cyclic bottleneck assignment problem
• A branch-and-cut method for the obnoxious \(p\)-median problem
• Categorized Assignment Scheduling: a Tabu Search Approach
• Comparing metaheuristic algorithms for SONET network design problems
• A tabu search algorithm for the routing and capacity assignment problem in computer networks
• Hybrid metaheuristics: an introduction
• Tabu search for the multilevel generalized assignment problem
• An Object-Oriented Methodology for Solving Assignment-Type Problems with Neighborhood Search Techniques
• 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)