Very large-scale variable neighborhood search for the generalized assignment problem
From MaRDI portal
Publication:3604030
DOI10.1080/09720502.2008.10700590zbMATH Open1156.90403OpenAlexW2319855622MaRDI QIDQ3604030FDOQ3604030
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
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
- A survey of algorithms for the generalized assignment problem
- Variable neighborhood search
- A survey of very large-scale neighborhood search techniques
- A Branch-and-Price Algorithm for the Generalized Assignment Problem
- Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches
- An ejection chain approach for the generalized assignment problem
- Title not available (Why is that?)
- Tabu search for the multilevel generalized assignment problem
- Effective algorithm and heuristic for the generalized assignment problem.
- A path relinking approach with ejection chains for the generalized assignment problem
- A set partitioning heuristic for the generalized assignment problem
- A genetic algorithm for the generalised assignment problem
- Solving the generalized assignment problem: an optimizing and heuristic approach
- Relaxation heuristics for a generalized assignment problem
Cited In (14)
- A generalized variable neighborhood search for combinatorial optimization problems
- A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem
- Optimization-based very large-scale neighborhood search for generalized assignment problems with location/allocation considerations
- VLSN search algorithms for partitioning problems using matching neighbourhoods
- On the variable-depth-search heuristic for the linear-cost generalized assignment problem
- A survey of very large-scale neighborhood search techniques
- Matheuristics: survey and synthesis
- Clustered maximum weight clique problem: algorithms and empirical analysis
- A variable depth search algorithm with branching search for the generalized assignment problem
- General variable neighborhood search for the data mule scheduling problem
- 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
- Solving the task assignment problem with a variable neighborhood search
- Variable-fixing then subgradient optimization guided very large scale neighborhood search for the generalized assignment problem
Uses Software
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)
