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

DOI10.1016/j.cor.2020.104933zbMath1458.90541OpenAlexW3008875886MaRDI QIDQ2664280

Michele Monaci, Claudia D'Ambrosio, 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

upper boundscomputational experimentsheuristic algorithmsnonlinear generalized assignment problem

Mathematics Subject Classification ID

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

Related Items (2)

Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ A three-phase matheuristic algorithm for the multi-day task assignment problem

Cites Work

• Unnamed Item
• Unnamed Item
• Heuristic algorithms for the general nonlinear separable knapsack problem
• Complexity and algorithms for convex network optimization and other nonlinear problems
• Greedy approaches for a class of nonlinear generalized assignment problems
• An algorithm for the generalized quadratic assignment problem
• An approximation algorithm for the generalized assignment problem
• Relaxations and heuristics for the multiple non-linear separable knapsack problem
• Knapsack problems with sigmoid utilities: approximation algorithms via hybrid optimization
• The Multiple Subset Sum Problem
• A Branch-and-Price Algorithm for the Multiperiod Single-Sourcing Problem
• Generalized Assignment with Nonlinear Capacity Interaction
• The Generalized Assignment Problem and Extensions

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