Greedy approaches for a class of nonlinear generalized assignment problems

DOI10.1016/J.DAM.2009.11.002zbMATH Open1185.90137OpenAlexW1982624147MaRDI QIDQ968176FDOQ968176

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

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

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)

Cites Work

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

Cited In (5)

• Greedy algorithms for high-dimensional non-symmetric linear problems
• A note of reduced dimension optimization algorithm of assignment problem
• 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)