A Fast Greedy Algorithm for the Relocation Problem
From MaRDI portal
Publication:2807030
DOI10.1007/978-3-319-28697-6_89zbMATH Open1342.90032OpenAlexW2462615596MaRDI QIDQ2807030FDOQ2807030
Authors: Rabih Zakaria, Laurent Moalic, Mohammad Dib, Alexandre Caminada
Publication date: 19 May 2016
Published in: Operations Research Proceedings (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-28697-6_89
Recommendations
- A fast feasibility test for relocation problems
- A fast algorithm for the rectilinear distance location problem
- Solving the container relocation problem by an improved greedy look-ahead heuristic
- An exact algorithm for the unrestricted block relocation problem
- Greedy algorithms for the single-demand facility location problem
- An exact algorithm for the blocks relocation problem with new lower bounds
- Minimizing the total weighted completion time in the relocation problem
- A tree search procedure for the container relocation problem
- scientific article; zbMATH DE number 1303608
Cited In (5)
Uses Software
This page was built for publication: A Fast Greedy Algorithm for the Relocation Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2807030)