Analysis of a local search heuristic for the generalized assignment problem with resource-independent task profits and identical resource capacity

Search Heuristic ◽

Independent Task ◽

Local Search Heuristic ◽

Generalized Assignment ◽

Resource Capacity

A New Local Search Heuristic for the Multidimensional Assignment Problem

NEO 2016 - Studies in Computational Intelligence ◽

10.1007/978-3-319-64063-1_8 ◽

2017 ◽

pp. 183-202

Author(s):

Sergio Luis Pérez Pérez ◽

Carlos E. Valencia ◽

Francisco Javier Zaragoza Martínez

Keyword(s):

Local Search ◽

Assignment Problem ◽

Search Heuristic ◽

Multidimensional Assignment Problem ◽

Local Search Heuristic

A Tabu search heuristic for the generalized assignment problem

European Journal of Operational Research ◽

10.1016/s0377-2217(00)00108-9 ◽

2001 ◽

Vol 132 (1) ◽

pp. 22-38 ◽

Cited By ~ 76

Author(s):

Juan A. Dı́az ◽

Elena Fernández

Keyword(s):

Tabu Search ◽

Assignment Problem ◽

Search Heuristic ◽

Local search intensified: Very large-scale variable neighborhood search for the multi-resource generalized assignment problem

Discrete Optimization ◽

10.1016/j.disopt.2009.04.004 ◽

2009 ◽

Vol 6 (4) ◽

pp. 370-377 ◽

Cited By ~ 25

Author(s):

Snežana Mitrović-Minić ◽

Abraham P. Punnen

Keyword(s):

Local Search ◽

Assignment Problem ◽

Large Scale ◽

Variable Neighborhood Search ◽

Neighborhood Search ◽

Generalized Assignment ◽

Scale Variable

On the variable-depth-search heuristic for the linear-cost generalized assignment problem

International Journal of Computer Mathematics ◽

10.1080/00207160108805083 ◽

2001 ◽

Vol 77 (4) ◽

pp. 535-544

Author(s):

Bertrand M.T. Lin ◽

Y.S. Huang ◽

H.K. Yu

Keyword(s):

Assignment Problem ◽

Variable Depth ◽

Search Heuristic ◽

Generalized Assignment ◽

Linear Cost

A new Lagrangian relaxation approach to the generalized assignment problem

European Journal of Operational Research ◽

10.1016/0377-2217(86)90328-0 ◽

1986 ◽

Vol 27 (3) ◽

pp. 313-323 ◽

Cited By ~ 67

Author(s):

Kurt Jörnsten ◽

Mikael Näsberg

Keyword(s):

Lagrangian Relaxation ◽

Assignment Problem ◽

A piecewise linearization for retail shelf space allocation problem and a local search heuristic

Annals of Operations Research ◽

10.1007/s10479-008-0455-6 ◽

2008 ◽

Vol 179 (1) ◽

pp. 149-167 ◽

Cited By ~ 11

Author(s):

Hasmukh K. Gajjar ◽

Gajendra K. Adil

Keyword(s):

Local Search ◽

Allocation Problem ◽

Shelf Space ◽

Piecewise Linearization ◽

Search Heuristic ◽

Local Search Heuristic ◽

Space Allocation ◽

Shelf Space Allocation

A branch and bound algorithm for the generalized assignment problem

Mathematical Programming ◽

10.1007/bf01580430 ◽

1975 ◽

Vol 8 (1) ◽

pp. 91-103 ◽

Cited By ~ 280

Author(s):

G. Terry Ross ◽

Richard M. Soland

Keyword(s):

Branch And Bound ◽

Assignment Problem ◽

Branch And Bound Algorithm ◽

An efficient approximation for the Generalized Assignment Problem

Information Processing Letters ◽

10.1016/j.ipl.2006.06.003 ◽

2006 ◽

Vol 100 (4) ◽

pp. 162-166 ◽

Cited By ~ 135

Author(s):

Reuven Cohen ◽

Liran Katzir ◽

Danny Raz

Keyword(s):

Assignment Problem ◽

Generalized Assignment ◽

Efficient Approximation

A Variant of the Generalized Assignment Problem for Reliable Allocation of Sensor Measurements in a Diagnostic System

AIRO Springer Series - A View of Operations Research Applications in Italy, 2018 ◽

10.1007/978-3-030-25842-9_6 ◽

2019 ◽

pp. 71-83

Author(s):

Gianmaria De Tommasi ◽

André C. Neto ◽

Antonio Sforza ◽

Claudio Sterle

Keyword(s):

Assignment Problem ◽

Diagnostic System ◽

Stable Resolving - A Randomized Local Search Heuristic for MaxSAT

Lecture Notes in Computer Science - KI 2020: Advances in Artificial Intelligence ◽

10.1007/978-3-030-58285-2_12 ◽

2020 ◽

pp. 163-175

Author(s):

Julian Reisch ◽

Peter Großmann ◽

Natalia Kliewer

Keyword(s):

Local Search ◽

Search Heuristic ◽

Local Search Heuristic