Greedy approaches for a class of nonlinear generalized assignment problems
type: Item
instance of: scholarly article
title: Greedy approaches for a class of nonlinear generalized assignment problems
zbMATH Open document ID: 1185.90137
author: Thomas C. Sharkey
author: H. Edwin Romeijn
published in: Discrete Applied Mathematics
publication date: 2010-05-05T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5703758
zbMATH Keywords: nonlinear generalized assignment problem
zbMATH Keywords: greedy heuristics
zbMATH Keywords: asymptotic analysis
MaRDI profile type: Publication
full work available at URL: j.dam.2009.11.002
OpenAlex ID: W1982624147
cites work: A heuristic approach to the multi-period single-sourcing problem with production and inventory capacities and perishability constraints
cites work: Q4209222
cites work: Probabilistic analysis of the generalised assignment problem
cites work: A Branch-and-Price Algorithm for the Multiperiod Single-Sourcing Problem
cites work: On optimality conditions in nondifferentiable programming
cites work: The continuous-time single-sourcing problem with capacity expansion opportunities
cites work: Q3929530
cites work: Q3293867
cites work: Interior-point methods for optimization
cites work: Q4324980
cites work: The generalized assignment problem with flexible jobs
cites work: A probabilistic feasibility and value analysis of the generalized assignment problem
cites work: A class of greedy algorithms for the generalized assignment problem
cites work: An asymptotically optimal greedy heuristic for the multiperiod single-sourcing problem: The cyclic case
cites work: Asymptotic analysis of a greedy heuristic for the multi-period single-sourcing problem: The acyclic case
DOI: 10.1016/J.DAM.2009.11.002
description: scientific article; zbMATH DE number 5703758