Greedy approaches for a class of nonlinear generalized assignment problems

DOI10.1016/j.dam.2009.11.002zbMath1185.90137OpenAlexW1982624147MaRDI QIDQ968176

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)

Related Items

Lower and upper bounds for the non-linear generalized assignment problem ⋮ A note of reduced dimension optimization algorithm of assignment problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The generalized assignment problem with flexible jobs
• Probabilistic analysis of the generalised assignment problem
• A class of greedy algorithms for the generalized assignment problem
• A probabilistic feasibility and value analysis of the generalized assignment problem
• Asymptotic analysis of a greedy heuristic for the multi-period single-sourcing problem: The acyclic case
• A Heuristic Approach to the Multi-Period Single-Sourcing Problem with Production and Inventory Capacities and Perishability Constraints
• Interior-point methods for optimization
• A Branch-and-Price Algorithm for the Multiperiod Single-Sourcing Problem
• On optimality conditions in nondifferentiable programming
• An asymptotically optimal greedy heuristic for the multiperiod single-sourcing problem: The cyclic case
• The continuous-time single-sourcing problem with capacity expansion opportunities