A genetic algorithm for the generalised assignment problem
type: Item
instance of: scholarly article
title: A genetic algorithm for the generalised assignment problem
zbMATH Open document ID: 0881.90070
DOI: 10.1016/S0305-0548(96)00032-9
author: O. Diekmann
published in: Computers \& Operations Research
publication date: 1998-02-19T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 68T05
zbMATH DE Number: 1038845
zbMATH Keywords: genetic algorithm
zbMATH Keywords: heuristic
zbMATH Keywords: generalised assignment
zbMATH Keywords: near optimal solutions
MaRDI profile type: Publication
cites work: A survey of algorithms for the generalized assignment problem
cites work: Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches
cites work: A genetic algorithm for the set covering problem
cites work: A set partitioning heuristic for the generalized assignment problem
cites work: A Rigorous Computational Comparison of Alternative Solution Methods for the Generalized Assignment Problem
cites work: Note—On the Maximal Covering Location Problem and the Generalized Assignment Problem
cites work: Q3993983
cites work: A Multiplier Adjustment Method for the Generalized Assignment Problem
cites work: Q3751373
cites work: A branch and bound algorithm for the generalized assignment problem
cites work: Q3929530
cites work: Q3993418
full work available at URL: s0305-0548(96)00032-9
OpenAlex ID: W1993062444
description: scientific article; zbMATH DE number 1038845