A hybrid algorithm for the generalized assignment problem

DOI10.1080/02331939108843666zbMATH Open0726.90065OpenAlexW1977094745MaRDI QIDQ3348709FDOQ3348709

Authors: Peter Värbrand, Kurt Jörnsten 

Publication date: 1991

Published in: Optimization (Search for Journal in Brave)

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

Recommendations

• A hybrid heuristic for the generalized assignment problem
• An approximation algorithm for the generalized assignment problem
• An efficient algorithm for a class of generalized assignment problem
• A hybrid tabu search/branch \& bound approach to solving the generalized assignment problem
• An efficient approximation for the generalized assignment problem
• A survey of algorithms for the generalized assignment problem
• A class of greedy algorithms for the generalized assignment problem
• The generalized assignment problem
• scientific article; zbMATH DE number 3918100
• An algorithm for the bottleneck generalized assignment problem

zbMATH Keywords

hybrid algorithmcutting planesbranch and boundvalid inequalitiesgeneralized assignmentfathcoming tests

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (9)

• A survey of algorithms for the generalized assignment problem
• An approximation algorithm for the generalized assignment problem
• Analysis of a local search heuristic for the generalized assignment problem with resource-independent task profits and identical resource capacity
• A \((1-1/e)\)-approximation algorithm for the generalized assignment problem
• A simple dual algorithm for the generalised assignment problem
• A hybrid tabu search/branch \& bound approach to solving the generalized assignment problem
• Title not available (Why is that?)
• Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches
• A hybrid heuristic for the generalized assignment problem

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

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