Lagrangian heuristic for a class of the generalized assignment problems
type: Item
instance of: scholarly article
title: Lagrangian heuristic for a class of the generalized assignment problems
zbMATH Open document ID: 1201.90119
author: Miguel Mata
author: Socorro Rangel
author: Jania Saucedo
author: I. Litvinchev
publication date: 2010-12-14T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5826487
zbMATH Keywords: Lagrangian heuristic
zbMATH Keywords: integer programming
zbMATH Keywords: many-to-many assignment problem
describes a project that uses: CPLEX
MaRDI profile type: Publication
full work available at URL: j.camwa.2010.03.070
OpenAlex ID: W1975799243
cites work: Q4529638
cites work: Q4265265
cites work: About Lagrangian methods in integer optimization
cites work: A Survey of Lagrangean Techniques for Discrete Optimization
cites work: A Lagrangian bound for many-to-many assignment problems
cites work: Assignment problems: a golden anniversary survey
cites work: Assignment Problems
cites work: Benders decomposition, Lagrangean relaxation and metaheuristic design
cites work: The Traveling-Salesman Problem and Minimum Spanning Trees
cites work: Q4054818
cites work: Relaxation heuristics for a generalized assignment problem
cites work: Lagrangean/surrogate relaxation for generalized assignment problems
cites work: Lagrangian relaxation guided problem space search heuristics for generalized assignment problems
cites work: The volume algorithm revisited: relation with bundle methods
DOI: 10.1016/J.CAMWA.2010.03.070
published in: Computers & Mathematics with Applications
description: scientific article; zbMATH DE number 5826487