An LP-based metaheuristic procedure for the k-sequential generalized assignment problem

DOI10.1080/10556788.2010.494020MaRDI QIDQ3093042zbMATH OpenOpenAlexFDO

Authors Alan P. French, Bjørn Nygreen, John M. Wilson

Publication date 12 October 2011

Published in Optimization Methods \& Software (Search for Journal in Brave)

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

zbMATH Keywords

linear programmingmetaheuristicslocal searchgeneralized assignment problemdivide and conquer

Mathematics Subject Classification ID

Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59) Applications of mathematical programming (90C90) Discrete location and assignment (90B80)

Recommendations

• An LP-based heuristic procedure for the generalized assignment problem with special ordered sets
• An Effective Lagrangian Heuristic For The Generalized Assignment Problem
• Lagrangian Decomposition Based Heuristic For The Generalized Assignment Problem
• Lagrangian relaxation guided problem space search heuristics for generalized assignment problems
• A hybrid heuristic for the generalized assignment problem
• Lagrangian heuristic for a class of the generalized assignment problems
• Generalized sequential stochastic assignment problem
• LP based heuristics for the multiple knapsack problem with assignment restrictions

Cited in

(1)

• An ejection chain approach for the generalized assignment problem

Describes a project that uses

Uses Software

• Tabu search
• XPRESS

This page was built for publication: An LP-based metaheuristic procedure for the k-sequential generalized assignment problem

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