Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

A branch-and-bound algorithm for depot location and container fleet management

8 references·7 citing·32 second hop

FromToDepth

this work references cited by second hop

References

1991Discrete location theory1,284 cited
1978A Dual-Based Procedure for Uncapacitated Facility Location910 cited
1983The simple plant location problem: Survey and synthesis544 cited
1990The uncapacitated facility location problem484 cited
1982A Dual-Based Procedure for Dynamic Facility Location264 cited
1993A tabu search procedure for multicommodity location/allocation with balancing requirements131 cited
1989Models for multimode multicommodity location problems with interdepot balancing requirements85 cited
1993Dual-Ascent Procedures for Multicommodity Location-Allocation Problems with Balancing Requirements63 cited

Cited by

1999Applying Lagrangian relaxation to the resolution of two‐stage location problems50 cited
2020Dynamic location of modular manufacturing facilities with relocation of individual modules47 cited
2003A Tabu Search with Slope Scaling for the Multicommodity Capacitated Location Problem with Balancing Requirements41 cited
1997A parallel branch-and-bound algorithm for multicommodity location with balancing requirements38 cited
2008New facets for the two-stage uncapacitated facility location polytope23 cited
2003A parallel hybrid heuristic for the multicommodity capacitated location problem with balancing requirements

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work

20 cited

1997A branch-and-bound algorithm for the transportation problem with location of p transshipment points20 cited