Greedy approaches for a class of nonlinear generalized assignment problems

DOI10.1016/J.DAM.2009.11.002MaRDI QIDQ968176zbMATH OpenOpenAlexFDO

Authors Thomas C. Sharkey, H. Edwin Romeijn

Publication date 5 May 2010

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2009.11.002

zbMATH Keywords

asymptotic analysisgreedy heuristicsnonlinear generalized assignment problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Recommendations

• A class of greedy algorithms for the generalized assignment problem
• Generalized Assignment with Nonlinear Capacity Interaction
• The generalized assignment problem with flexible jobs
• Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem
• Some recent results in the analysis of greedy algorithms for assignment problems

Cites work

• scientific article; zbMATH DE number 3174984 (Why is no real title available?)
• scientific article; zbMATH DE number 3743004 (Why is no real title available?)
• scientific article; zbMATH DE number 1206370 (Why is no real title available?)
• scientific article; zbMATH DE number 729680 (Why is no real title available?)
• A Branch-and-Price Algorithm for the Multiperiod Single-Sourcing Problem
• A class of greedy algorithms for the generalized assignment problem
• A heuristic approach to the multi-period single-sourcing problem with production and inventory capacities and perishability constraints
• A probabilistic feasibility and value analysis of the generalized assignment problem
• An asymptotically optimal greedy heuristic for the multiperiod single-sourcing problem: The cyclic case
• Asymptotic analysis of a greedy heuristic for the multi-period single-sourcing problem: The acyclic case
• Interior-point methods for optimization
• On optimality conditions in nondifferentiable programming
• Probabilistic analysis of the generalised assignment problem
• The continuous-time single-sourcing problem with capacity expansion opportunities
• The generalized assignment problem with flexible jobs

Cited in

(6)

• A note of reduced dimension optimization algorithm of assignment problem
• Greedy algorithms for high-dimensional non-symmetric linear problems
• On greedy approximation algorithms for a class of two-stage stochastic assignment problems
• Some recent results in the analysis of greedy algorithms for assignment problems
• Lower and upper bounds for the non-linear generalized assignment problem
• A class of greedy algorithms for the generalized assignment problem

This page was built for publication: Greedy approaches for a class of nonlinear generalized assignment problems

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