Asynchronous Cooperative Local Search for the Office-Space-Allocation Problem
From MaRDI portal
Publication:2892369
DOI10.1287/IJOC.1060.0200zbMath1241.91093OpenAlexW2124887127MaRDI QIDQ2892369
Dario Landa-Silva, Edmund Kieran Burke
Publication date: 18 June 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/937736c4a0833c95b4b82bdaaae7041435f0661a
Learning and adaptive systems in artificial intelligence (68T05) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Matching models (91B68)
Related Items (3)
A 0/1 Integer Programming Model for the Office Space Allocation Problem ⋮ Metaheuristic methods based on tabu search for assigning judges to competitions ⋮ A heterogeneous cellular processing algorithm for minimizing the power consumption in wireless communications systems
This page was built for publication: Asynchronous Cooperative Local Search for the Office-Space-Allocation Problem
