A class of greedy algorithms for the generalized assignment problem
type: Item
instance of: scholarly article
title: A class of greedy algorithms for the generalized assignment problem
zbMATH Open document ID: 1064.90019
DOI: 10.1016/S0166-218X(99)00224-3
author: H. Edwin Romeijn
author: Dolores Romero Morales
published in: Discrete Applied Mathematics
publication date: 2000-01-01T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 1474737
zbMATH Keywords: Generalized Assignment Problem
zbMATH Keywords: Greedy heuristic
zbMATH Keywords: Asymptotic feasibility
zbMATH Keywords: Asymptotic optimality
MaRDI profile type: Publication
cites work: An Integer Generalized Transportation Model for Optimal Job Assignment in Computer Networks
cites work: A property of assignment type mixed integer linear programming problems
cites work: A survey of algorithms for the generalized assignment problem
cites work: An all Zero-One Algorithm for a Certain Class of Transportation Problems
cites work: Probabilistic analysis of the generalised assignment problem
cites work: A Multiplier Adjustment Method for the Generalized Assignment Problem
cites work: Multicommodity Distribution System Design by Benders Decomposition
cites work: Two Lines Least Squares
cites work: Q3929530
cites work: Q3993418
cites work: A probabilistic analysis of the multiknapsack value function
cites work: A class of generalized greedy algorithms for the multi-knapsack problem
cites work: Convex Analysis
cites work: A probabilistic feasibility and value analysis of the generalized assignment problem
cites work: A branch and bound algorithm for the generalized assignment problem
cites work: Modeling Facility Location Problems as Generalized Assignment Problems
full work available at URL: s0166-218x(99)00224-3
OpenAlex ID: W2034917120
description: scientific article; zbMATH DE number 1474737