A Fast Greedy Algorithm for the Relocation Problem
From MaRDI portal
Publication:2807030
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)- scientific article; zbMATH DE number 1522930 (Why is no real title available?)
- An adaptive large neighborhood search for relocating vehicles in electric carsharing services
- A linear program for points of interest relocation in adaptive maps
- Carrying umbrellas: An online relocation game on a graph
- On the online min-wait relocation problem
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)