An Object-Oriented Methodology for Solving Assignment-Type Problems with Neighborhood Search Techniques

DOI10.1287/OPRE.44.2.347MaRDI QIDQ4888185zbMATH OpenOpenAlexFDO

Authors Jacques A. Ferland, Alain Hertz, Alain Lavoie

Publication date 28 October 1996

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.44.2.347

zbMATH Keywords

assignment-type problemgeneral purpose softwareobject oriented programming

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 956867
• Algorithms and codes for dense assignment problems: The state of the art
• Solution of the cumulative assignment problem with a well-structured tabu search method
• Linear assignment procedures
• scientific article; zbMATH DE number 446511

Cited in

(6)

• Constructing a course schedule by solving a series of assignment type problems
• Efficient and Local Efficient Solutions for Assignment Type Problems
• A two-echelon neighborhood search algorithm for a forwarder's job assignment in a multi-agent logistics network
• Scheduling using tabu search methods with intensification and diversification
• A Survey of the Generalized Assignment Problem and Its Applications
• Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem

This page was built for publication: An Object-Oriented Methodology for Solving Assignment-Type Problems with Neighborhood Search Techniques

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4888185)