Very large-scale variable neighborhood search for the generalized assignment problem

DOI10.1080/09720502.2008.10700590zbMath1156.90403OpenAlexW2319855622MaRDI QIDQ3604030

Abraham P. Punnen, Snežana Mitrović-Minić

Publication date: 24 February 2009

Published in: Journal of Interdisciplinary Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720502.2008.10700590

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Related Items (4)

Clustered maximum weight clique problem: algorithms and empirical analysis ⋮ Matheuristics: survey and synthesis ⋮ Local search intensified: very large-scale variable neighborhood search for the multi-resource generalized assignment problem ⋮ Variable-fixing then subgradient optimization guided very large scale neighborhood search for the generalized assignment problem

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• A survey of very large-scale neighborhood search techniques
• A survey of algorithms for the generalized assignment problem
• Relaxation heuristics for a generalized assignment problem
• A set partitioning heuristic for the generalized assignment problem
• A genetic algorithm for the generalised assignment problem
• Variable neighborhood search
• Tabu search for the multilevel generalized assignment problem
• Effective algorithm and heuristic for the generalized assignment problem.
• Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches
• A path relinking approach with ejection chains for the generalized assignment problem
• Solving the Generalized Assignment Problem: An Optimizing and Heuristic Approach
• An Ejection Chain Approach for the Generalized Assignment Problem
• A Branch-and-Price Algorithm for the Generalized Assignment Problem

This page was built for publication: Very large-scale variable neighborhood search for the generalized assignment problem