Lower and upper bounds for the non-linear generalized assignment problem

DOI10.1016/J.COR.2020.104933MaRDI QIDQ2664280zbMATH OpenOpenAlexFDO

Authors Claudia D'Ambrosio, Michele Monaci, Silvano Martello

Publication date 20 April 2021

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2020.104933

zbMATH Keywords

computational experimentsupper boundsheuristic algorithmsnonlinear generalized assignment problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Nonlinear programming (90C30) Discrete location and assignment (90B80)

Recommendations

• A path relinking approach with ejection chains for the generalized assignment problem
• A set partitioning heuristic for the generalized assignment problem
• Generalized Assignment with Nonlinear Capacity Interaction
• An ejection chain approach for the generalized assignment problem
• Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches

Cites work

• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• A Branch-and-Price Algorithm for the Multiperiod Single-Sourcing Problem
• An algorithm for the generalized quadratic assignment problem
• An approximation algorithm for the generalized assignment problem
• Approximation hardness for a class of sparse optimization problems
• Complexity and algorithms for convex network optimization and other nonlinear problems
• Generalized Assignment with Nonlinear Capacity Interaction
• Greedy approaches for a class of nonlinear generalized assignment problems
• Heuristic algorithms for the general nonlinear separable knapsack problem
• Knapsack problems with sigmoid utilities: approximation algorithms via hybrid optimization
• Relaxations and heuristics for the multiple non-linear separable knapsack problem
• The Generalized Assignment Problem and Extensions
• The multiple subset sum problem

Cited in

(3)

• A three-phase matheuristic algorithm for the multi-day task assignment problem
• Comparison of Lagrangian bounds for one class of generalized assignment problems
• Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems

This page was built for publication: Lower and upper bounds for the non-linear generalized assignment problem

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