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

DOI10.1016/J.COR.2020.104933zbMATH Open1458.90541OpenAlexW3008875886MaRDI QIDQ2664280FDOQ2664280

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

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

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)

Cites Work

• An approximation algorithm for the generalized assignment problem
• Title not available (Why is that?)
• The multiple subset sum problem
• Generalized Assignment with Nonlinear Capacity Interaction
• An algorithm for the generalized quadratic assignment problem
• A Branch-and-Price Algorithm for the Multiperiod Single-Sourcing Problem
• Knapsack problems with sigmoid utilities: approximation algorithms via hybrid optimization
• Relaxations and heuristics for the multiple non-linear separable knapsack problem
• 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
• The Generalized Assignment Problem and Extensions
• Approximation hardness for a class of sparse optimization problems

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)