On the public citation graph

Robust Service Network Design under Travel Time Uncertainty: Formulations and Exact Solutions

0 signed · 33 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/net.21497openalex-extracted
Robust network design: Formulations, valid inequalities, and computations
inferredcites →https://doi.org/10.1007/s00291-007-0079-2openalex-extracted
Service network design for freight transportation: a review
inferredcites →https://doi.org/10.1007/s10696-016-9267-1openalex-extracted
Hybrid simulation and optimization approach for green intermodal transportation problem with travel time uncertainty
inferredcites →https://doi.org/10.1016/j.cie.2018.09.021openalex-extracted
A simulation-optimization approach for scheduling in stochastic freight transportation
inferredcites →https://doi.org/10.1016/j.ejor.2018.08.031openalex-extracted
A survey of adjustable robust optimization
inferredcites →https://doi.org/10.1016/j.ejor.2020.05.031openalex-extracted
Scheduled service network design with quality targets and stochastic travel times
inferredcites →https://doi.org/10.1016/j.ejor.2023.04.007openalex-extracted
Synchronisation in vehicle routing: Classification schema, modelling framework and literature review
inferredcites →https://doi.org/10.1016/j.orl.2013.05.003openalex-extracted
Solving two-stage robust optimization problems using a column-and-constraint generation method
inferredcites →https://doi.org/10.1016/j.trb.2015.09.007openalex-extracted
A green intermodal service network design problem with travel time uncertainty
inferredcites →https://doi.org/10.1016/j.trb.2023.04.002openalex-extracted
New formulations for the Scheduled Service Network Design Problem
inferredcites →https://doi.org/10.1111/poms.13799openalex-extracted
Advance admission scheduling via resource satisficing
inferredcites →https://doi.org/10.1111/poms.13920openalex-extracted
Target‐based resource pooling problem
inferredcites →https://doi.org/10.1137/080734510openalex-extracted
Theory and Applications of Robust Optimization
inferredcites →https://doi.org/10.1287/ijoc.1100.0380openalex-extracted
The Robust Network Loading Problem Under Hose Demand Uncertainty: Formulation, Polyhedral Analysis, and Computations
inferredcites →https://doi.org/10.1287/ijoc.2015.0643openalex-extracted
Robust Network Design with Uncertain Outsourcing Cost
inferredcites →https://doi.org/10.1287/ijoc.2018.0819openalex-extracted
Stochastic Network Design for Planning Scheduled Transportation Services: The Value of Deterministic Solutions
inferredcites →https://doi.org/10.1287/opre.1030.0065openalex-extracted
The Price of Robustness
inferredcites →https://doi.org/10.1287/opre.1070.0428openalex-extracted
Two-Stage Robust Network Flow and Design Under Demand Uncertainty
inferredcites →https://doi.org/10.1287/opre.2013.1246openalex-extracted
A Mean-Risk Model for the Traffic Assignment Problem with Stochastic Travel Times
inferredcites →https://doi.org/10.1287/opre.2015.1462openalex-extracted
Routing Optimization Under Uncertainty
inferredcites →https://doi.org/10.1287/opre.2017.1624openalex-extracted
The Continuous-Time Service Network Design Problem
inferredcites →https://doi.org/10.1287/opre.2018.1784openalex-extracted
Travel Time Estimation in the Age of Big Data
inferredcites →https://doi.org/10.1287/opre.2021.2238openalex-extracted
Robust Satisficing
inferredcites →https://doi.org/10.1287/opre.51.4.655.16098openalex-extracted
Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design
inferredcites →https://doi.org/10.1287/trsc.1090.0265openalex-extracted
A Study of Demand Stochasticity in Service Network Design
inferredcites →https://doi.org/10.1287/trsc.2014.0525openalex-extracted
Service Network Design with Resource Constraints
inferredcites →https://doi.org/10.1287/trsc.2019.0890openalex-extracted
Enhanced Dynamic Discretization Discovery for the Continuous Time Load Plan Design Problem
inferredcites →https://doi.org/10.1287/trsc.2019.0935openalex-extracted
Robust Service Network Design Under Demand Uncertainty
inferredcites →https://doi.org/10.1287/trsc.2020.0994openalex-extracted
Interval-Based Dynamic Discretization Discovery for Solving the Continuous-Time Service Network Design Problem
inferredcites →https://doi.org/10.1287/trsc.2022.0104openalex-extracted
Incorporating Holding Costs in Continuous-Time Service Network Design: New Model, Relaxation, and Exact Algorithm
inferredcites →https://doi.org/10.2139/ssrn.2298389openalex-extracted
inferredcites →https://doi.org/10.2139/ssrn.3394845openalex-extracted
inferredcites →https://doi.org/10.2139/ssrn.4232772openalex-extracted
New Formulations for the Scheduled Service Network Design Problem
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.