SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Branch-and-bound parallelization strategies applied to a depot location and container fleet management problem
6 references·1 citing·23 second hop
Branch-and-bound parallelization strategies applied to a depot location and container fleet management problem (2000)Branch-and-bound parallelization strategi…Discrete location theory (1991)Discrete location theoryThe uncapacitated facility location problem (1990)The uncapacitated facility lo…Models for multimode multicommodity location problems with interdepot balancing requirements (1989)Models for multimode multicom…Network Design and Transportation Planning: Models and Algorithms (1984)Network Design and Transporta…The simple plant location problem: Survey and synthesis (1983)The simple plant location pro…A Dual-Based Procedure for Uncapacitated Facility Location (1978)A Dual-Based Procedure for Un…Solving hub arc location problems on a cluster of workstations (2003)Solving hub arc location prob…Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph (1964)Facility location : applications and theory (2001)Cores of convex games (1971)An Overview of Representative Problems in Location Research (1989)Facility Layout and Location: An Analytical Approach (1991)PROCEEDINGS OF THE 1997 WINTER SIMULATION CONFERENCE (1997)The design of reverse distribution networks: Models and solution procedures (2003)Multicommodity Distribution System Design by Benders Decomposition * † ‡ (2010)Decisions with Multiple Objectives: Preferences and Value Tradeoffs. (1994)Models and algorithms for road network design: a review and some new developments (1998)Dynamic Version of the Economic Lot Size Model (2004)Transit network design and scheduling: A global review (2008)A review of urban transportation network design problems (2013)The generalized maximal covering location problem (2002)The gradual covering decay location problem on a network (2003)Facility Location in Supply Chain Design (2005)Dual-Ascent Procedures for Multicommodity Location-Allocation Problems with Balancing Requirements (1993)Synchronous tabu search parallelization strategies for multicommodity location-allocation with balancing requirements (1995)Parallel asynchronous tabu search for multicommodity location-allocation with balancing requirements (1996)Integer programming formulations of discrete hub location problems (1994)Location analysis: A synthesis and survey (2004)Quantitative models for reverse logistics: A review (1997)Green supply‐chain management: A state‐of‐the‐art literature review (2007)
this work references cited by second hop

References

  • 1984Network Design and Transportation Planning: Models and Algorithms1,296 cited
  • 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
  • 1989Models for multimode multicommodity location problems with interdepot balancing requirements85 cited

Cited by

  • 2003Solving hub arc location problems on a cluster of workstations24 cited

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