A hybrid algorithm for the generalized assignment problem

DOI10.1080/02331939108843666zbMath0726.90065OpenAlexW1977094745MaRDI QIDQ3348709

Peter Värbrand, Kurt O. Jørnsten

Publication date: 1991

Published in: Optimization (Search for Journal in Brave)

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

zbMATH Keywords

branch and boundcutting planesvalid inequalitieshybrid algorithmgeneralized assignmentfathcoming tests

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Linear programming (90C05) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (3)

Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches ⋮ Analysis of a local search heuristic for the generalized assignment problem with resource-independent task profits and identical resource capacity ⋮ A survey of algorithms for the generalized assignment problem

Cites Work

• A Multiplier Adjustment Method for the Generalized Assignment Problem
• An Automatic Method of Solving Discrete Programming Problems
• Pivot and Complement–A Heuristic for 0-1 Programming
• Note—On the Maximal Covering Location Problem and the Generalized Assignment Problem
• A branch and bound algorithm for the generalized assignment problem
• Technical Note—A Note on Zero-One Programming
• Facets of the knapsack polytope
• An Integer Generalized Transportation Model for Optimal Job Assignment in Computer Networks
• Facets of the Knapsack Polytope From Minimal Covers
• A tree-search algorithm for mixed integer programming problems

This page was built for publication: A hybrid algorithm for the generalized assignment problem