On the variable-depth-search heuristic for the linear-cost generalized assignment problem

DOI10.1080/00207160108805083MaRDI QIDQ2752253zbMATH OpenOpenAlexFDO

Authors B. M. T. Lin, Haikuo Yu

Publication date 16 October 2001

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207160108805083

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A robust heuristic for the generalized assignment problem
• scientific article; zbMATH DE number 1488098
• A variable depth search algorithm with branching search for the generalized assignment problem
• scientific article; zbMATH DE number 1960697
• Very large-scale variable neighborhood search for the generalized assignment problem

Cites work

• A branch and bound algorithm for the generalized assignment problem
• A genetic algorithm for the generalised assignment problem
• A Multiplier Adjustment Method for the Generalized Assignment Problem
• A Rigorous Computational Comparison of Alternative Solution Methods for the Generalized Assignment Problem
• Algorithms for the Multi-Resource Generalized Assignment Problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• scientific article; zbMATH DE number 825000 (Why is no real title available?)
• Modeling Facility Location Problems as Generalized Assignment Problems
• Resource-Constrained Assignment Scheduling
• Weighted Assignment Models and Their Application

Cited in

(3)

• A Rigorous Computational Comparison of Alternative Solution Methods for the Generalized Assignment Problem
• scientific article; zbMATH DE number 1488098 (Why is no real title available?)
• A variable depth search algorithm with branching search for the generalized assignment problem

This page was built for publication: On the variable-depth-search heuristic for the linear-cost generalized assignment problem

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