Xuesong Zhou
Industrial and Manufacturing Engineering · 2007–2021
A researcher in the Science corpus: 5 papers; trusts 9 researchers and is trusted by 1 researcher here, as inferred from the citation graph.
Subfields
- Industrial and Manufacturing Engineering — 7 citations into it; #1,483 of 2,521 by trust here, #2,320 by citations
- Automotive Engineering — 6 citations into it
- Transportation — 6 citations into it
- Building and Construction — 5 citations into it
Whom Xuesong Zhou trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Jean-François Cordeau
- Ravindra K. Ahuja
- Stefan Røpke
- Marshall L. Fisher
- Carlo G. Prato
- Robert B. Noland
- James B. Orlin
- Yu (Marco) Nie
- John W. Polak
- Richard M. Karp
Who trusts Xuesong Zhou overall
Papers from Xuesong Zhou's perspective
Ordered by how strongly the researchers Xuesong Zhou trusts endorse each paper. Same corpus, a different order for every researcher.
- A Branch-and-Cut Algorithm for the Dial-a-Ride Problem (Operational Research)
- Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows (Transportation Science)
- Travel time variability: A review of theoretical and empirical issues
- Shortest path problem considering on-time arrival probability
- Network Flows: Theory, Algorithms, and Applications
- A dynamic programming approach to sequencing problems
- Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows (Networks)
- The shared-taxi problem: Formulation and solution methods
- Vehicle routing under time-dependent travel times: The impact of congestion avoidance (Computers & Operations Research)
- Route choice modeling: past, present and future research directions
Their papers
- DARWIN – a next-generation liquid xenon observatory for dark matter and neutrino physics (2021) — 168 citations
- Optimizing on-time arrival probability and percentile travel time for elementary path finding in time-dependent transportation networks: Linear mixed integer programming reformulations (2017) — 88 citations
- Finding Optimal Solutions for Vehicle Routing Problem with Pickup and Delivery Services with Time Windows: A Dynamic Programming Approach Based on State-space-time Network Representations (2015) — 311 citations
- Finding the most reliable path with and without link travel time correlation: A Lagrangian substitution based approach (2011) — 136 citations
- Single-Track Train Timetabling with Guaranteed Optimality: Branch-and-Bound Algorithms with Enhanced Lower Bounds (2007) — 325 citations