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

DOI10.1287/opre.44.2.347zbMath0855.90105OpenAlexW1986204507MaRDI QIDQ4888185

Alain Lavoie, Jacques A. Ferland, Alain Hertz

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

object oriented programmingassignment-type problemgeneral purpose software

Mathematics Subject Classification ID

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

Related Items (6)

Efficient and Local Efficient Solutions for Assignment Type Problems ⋮ A Survey of the Generalized Assignment Problem and Its Applications ⋮ Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem ⋮ Scheduling using tabu search methods with intensification and diversification ⋮ Constructing a course schedule by solving a series of assignment type problems ⋮ A Two-Echelon Neighborhood Search Algorithm for a Forwarder's Job Assignment in a Multi-Agent Logistics Network

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