An LP-based heuristic procedure for the generalized assignment problem with special ordered sets
From MaRDI portal
Publication:868998
DOI10.1016/j.cor.2005.09.008zbMath1119.90043OpenAlexW2064012109MaRDI QIDQ868998
John M. Wilson, Alan P. French
Publication date: 26 February 2007
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2005.09.008
Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (3)
Data-driven branching and selection for lot-sizing and scheduling problems with sequence-dependent setups and setup carryover ⋮ Win-win match using a genetic algorithm ⋮ A Survey of the Generalized Assignment Problem and Its Applications
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Solving the generalised assignment problem using polyhedral results
- Tabu search for the multilevel generalized assignment problem
- Logic cuts for multilevel generalized assignment problems.
- Effective algorithm and heuristic for the generalized assignment problem.
- A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem
- A path relinking approach with ejection chains for the generalized assignment problem
- An ejection chain approach 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 bound algorithm for the generalized assignment problem
- Global optimization using special ordered sets
- A Branch-and-Price Algorithm for the Generalized Assignment Problem
- A generalized assignment problem with special ordered sets: a polyhedral approach.
- A tabu search heuristic for the generalized assignment problem
- A dynamic tabu search for large-scale generalized assignment problems
This page was built for publication: An LP-based heuristic procedure for the generalized assignment problem with special ordered sets