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

DOI10.1080/09720502.2008.10700590MaRDI QIDQ3604030zbMATHOpenAlexFDO

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

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)

Recommendations

• 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
• scientific article; zbMATH DE number 1488098
• A robust heuristic for the generalized assignment problem
• A survey of very large-scale neighborhood search techniques

Cites work

• scientific article; zbMATH DE number 40470 (Why is no real title available?)
• A Branch-and-Price Algorithm for the Generalized Assignment Problem
• A genetic algorithm for the generalised assignment problem
• A path relinking approach with ejection chains for the generalized assignment problem
• A set partitioning heuristic for the generalized assignment problem
• A survey of algorithms for the generalized assignment problem
• A survey of very large-scale neighborhood search techniques
• An ejection chain approach for the generalized assignment problem
• Effective algorithm and heuristic for the generalized assignment problem.
• Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches
• Relaxation heuristics for a generalized assignment problem
• Solving the generalized assignment problem: an optimizing and heuristic approach
• Tabu search for the multilevel generalized assignment problem
• Variable neighborhood search

Cited in

(14)

• VLSN search algorithms for partitioning problems using matching neighbourhoods
• Variable-fixing then subgradient optimization guided very large scale neighborhood search for the generalized assignment problem
• A survey of very large-scale neighborhood search techniques
• A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem
• Clustered maximum weight clique problem: algorithms and empirical analysis
• Solving the task assignment problem with a variable neighborhood search
• A variable depth search algorithm with branching search for the generalized assignment problem
• Matheuristics: survey and synthesis
• Very large-scale neighborhood search for the quadratic assignment problem
• Local search intensified: very large-scale variable neighborhood search for the multi-resource generalized assignment problem
• Optimization-based very large-scale neighborhood search for generalized assignment problems with location/allocation considerations
• On the variable-depth-search heuristic for the linear-cost generalized assignment problem
• General variable neighborhood search for the data mule scheduling problem
• A generalized variable neighborhood search for combinatorial optimization problems

Describes a project that uses

Uses Software

• CPLEX

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

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