SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Bicriterion a priori route choice in stochastic time-dependent networks
3 references·2 citing·21 second hop
Bicriterion a priori route choice in stochastic time-dependent networks (2006)Bicriterion a priori route choice in stoc…Route Choice in Stochastic Time-Dependent Networks (2004)Route Choice in Stochastic Ti…Optimal Routing of Hazardous Materials in Stochastic, Time-Varying Transportation Networks (1998)Optimal Routing of Hazardous …The Fastest Path through a Network with Random Time-Dependent Travel Times (1986)The Fastest Path through a Ne…Capacitated dynamic lot sizing with capacity acquisition (2010)Capacitated dynamic lot sizin…An inventory control project in a major Danish company using compound renewal demand models (2007)An inventory control project …Optimal Obnoxious Paths on a Network: Transportation of Hazardous Materials (1988)Modeling and Analysis for Hazardous Materials Transportation: Risk Analysis, Routing/Scheduling and Facility Location (1991)Simultaneous Siting and Routing in the Disposal of Hazardous Wastes (1991)Applying genetic algorithm to a new location and routing model of hazardous materials (2014)Applying genetic algorithm to a new bi-objective stochastic model for transportation, location, and allocation of hazardous materials (2016)Hazardous materials truck transportation problems: A classification and state of the art literature review (2019)Analysis of Inventory Systems. (1964)Inventory management and production planning and scheduling (1999)Foundations of Inventory Management (2000)Rationing policies in a spare parts inventory system with customers differentiation (2020)Dynamic Version of the Economic Lot Size Model (1958)Optimal Investment in Product-Flexible Manufacturing Capacity (1990)Dynamic Version of the Economic Lot Size Model (2004)Equilibrium traffic assignment for large scale transit networks (1988)Introduction to Stochastic Programming (2011)Ranking paths in stochastic time-dependent networks (2013)Finding the Most Reliable Strategy on Stochastic and Time-Dependent Transportation Networks: A Hypergraph Based Formulation (2017)Algorithms for most reliable routes on stochastic and time-dependent networks (2020)Expected shortest paths in dynamic and stochastic traffic networks (1998)Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks (2000)Shortest path problem considering on-time arrival probability (2009)
this work references cited by second hop

References

  • 1986The Fastest Path through a Network with Random Time-Dependent Travel Times404 cited
  • 1998Optimal Routing of Hazardous Materials in Stochastic, Time-Varying Transportation Networks102 cited
  • 2004Route Choice in Stochastic Time-Dependent Networks33 cited

Cited by

  • 2007An inventory control project in a major Danish company using compound renewal demand models20 cited
  • 2010Capacitated dynamic lot sizing with capacity acquisition12 cited

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