On the public citation graph
Path inequalities for the vehicle routing problem with time windows
0 signed · 51 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/1097-0037(200009)36:2<69::aid-net1>3.0.co;2-qopenalex-snapshot
A polyhedral study of the asymmetric traveling salesman problem with time windows
inferredcites →https://doi.org/10.1002/1097-024x(200009)30:11<1325::aid-spe342>3.0.co;2-topenalex-snapshot
The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
inferredcites →https://doi.org/10.1007/bf01585767openalex-snapshot
The precedence-constrained asymmetric traveling salesman polytope
inferredcites →https://doi.org/10.1007/bf02022044openalex-snapshot
Local search in routing problems with time windows
inferredcites →https://doi.org/10.1007/pl00011432openalex-snapshot
Solving the Asymmetric Travelling Salesman Problem with time windows by branch-and-cut
inferredcites →https://doi.org/10.1007/s10107-003-0440-4openalex-snapshot
Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems
inferredcites →https://doi.org/10.1016/0167-6377(91)90083-2openalex-snapshot
Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints
inferredcites →https://doi.org/10.1016/0377-2217(85)90284-xopenalex-snapshot
Integer programming formulations of vehicle routing problems
inferredcites →https://doi.org/10.1016/j.cor.2004.11.002openalex-snapshot
Lagrangian duality applied to the vehicle routing problem with time windows
inferredcites →https://doi.org/10.1145/321043.321046openalex-snapshot
Integer Programming Formulation of Traveling Salesman Problems
inferredcites →https://doi.org/10.1287/ijoc.7.1.10openalex-snapshot
A GRASP for the Vehicle Routing Problem with Time Windows
inferredcites →https://doi.org/10.1287/mnsc.43.11.1520openalex-snapshot
A Polyhedral Approach to the Asymmetric Traveling Salesman Problem
inferredcites →https://doi.org/10.1287/opre.35.2.254openalex-snapshot
Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
inferredcites →https://doi.org/10.1287/opre.40.2.342openalex-snapshot
A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
inferredcites →https://doi.org/10.1287/trsc.33.1.101openalex-snapshot
2-Path Cuts for the Vehicle Routing Problem with Time Windows
inferredcites →https://doi.org/10.1287/trsc.36.2.250.565openalex-snapshot
A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4793503openalex-extracted
A Novel Mixed-Integer Linear Programming Formulation for Continuous-Time Inventory Routing
inferred← citeshttps://doi.org/10.1002/net.20375openalex-snapshot
Exact solutions to the double travelling salesman problem with multiple stacks
inferred← citeshttps://doi.org/10.1002/net.21942openalex-snapshot
On the road to better routes: Five decades of published research on the vehicle routing problem
inferred← citeshttps://doi.org/10.1002/net.70005openalex-snapshot
Vehicle Routing Problem With Time Windows—New Valid Inequalities From Polar Duality
inferred← citeshttps://doi.org/10.1007/978-0-387-77778-8_14openalex-snapshot
Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-66158-2_37openalex-snapshot
Branch-and-Check with Explanations for the Vehicle Routing Problem with Time Windows
inferred← citeshttps://doi.org/10.1007/978-3-319-68496-3_6openalex-snapshot
A Polyhedral Study of the Elementary Shortest Path Problem with Resource Constraints
inferred← citeshttps://doi.org/10.1007/978-3-642-32147-4_23openalex-snapshot
Layered Formulation for the Robust Vehicle Routing Problem with Time Windows
inferred← citeshttps://doi.org/10.1007/s00500-019-04312-9openalex-snapshot
The new optimization algorithm for the vehicle routing problem with time windows using multi-objective discrete learnable evolution model
inferred← citeshttps://doi.org/10.1007/s10696-011-9105-4openalex-snapshot
A branch and cut algorithm for the container shipping network design problem
inferred← citeshttps://doi.org/10.1016/j.cie.2020.106491openalex-snapshot
Discrete scenario-based optimization for the robust vehicle routing problem: The case of time windows under delay uncertainty
inferred← citeshttps://doi.org/10.1016/j.cor.2012.10.002openalex-snapshot
The robust vehicle routing problem with time windows
inferred← citeshttps://doi.org/10.1016/j.cor.2013.03.008openalex-snapshot
Lifted and Local Reachability Cuts for the Vehicle Routing Problem with Time Windows
inferred← citeshttps://doi.org/10.1016/j.cor.2016.02.014openalex-snapshot
Lower bounds for large traveling umpire instances: New valid inequalities and a branch-and-cut algorithm
inferred← citeshttps://doi.org/10.1016/j.cor.2024.106883openalex-snapshot
A novel mixed-integer linear programming formulation for continuous-time inventory routing
inferred← citeshttps://doi.org/10.1016/j.ejor.2012.08.014openalex-snapshot
Rich routing problems arising in supply chain management
inferred← citeshttps://doi.org/10.1016/j.ejor.2014.12.038openalex-snapshot
Two exact algorithms for the traveling umpire problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2026.03.031openalex-snapshot
The robust pickup and delivery problem with time windows
inferred← citeshttps://doi.org/10.1016/j.trb.2018.09.008openalex-snapshot
A scenario decomposition algorithm for strategic time window assignment vehicle routing problems
inferred← citeshttps://doi.org/10.1016/j.trc.2010.07.008openalex-snapshot
A branch-and-cut-and-price algorithm for the multi-depot heterogeneous vehicle routing problem with time windows
inferred← citeshttps://doi.org/10.1016/j.trc.2020.102929openalex-snapshot
The benefits of autonomous vehicles for community-based trip sharing
inferred← citeshttps://doi.org/10.1016/j.trpro.2022.02.017openalex-snapshot
Decomposition of the vehicle routing problem with time windows on the time dimension
inferred← citeshttps://doi.org/10.1051/ro/2024069openalex-snapshot
An improved sequential insertion algorithm and tabu search to vehicle routing problem with time windows
inferred← citeshttps://doi.org/10.1080/23249935.2018.1427157openalex-snapshot
Formulations and branch-and-cut algorithms for production routing problems with time windows
inferred← citeshttps://doi.org/10.1109/ieem63636.2025.11357775openalex-snapshot
Vehicle Routing Problem with Time Constraints for Local Delivery
inferred← citeshttps://doi.org/10.1111/mice.12368openalex-snapshot
A Customized Hybrid Approach to Infrastructure Maintenance Scheduling in Railroad Networks under Variable Productivities
inferred← citeshttps://doi.org/10.1287/trsc.1070.0223openalex-snapshot
Tabu Search, Partial Elementarity, and Generalized k-Path Inequalities for the Vehicle Routing Problem with Time Windows
inferred← citeshttps://doi.org/10.1287/trsc.2017.0780openalex-snapshot
Exact Approach for the Vehicle Routing Problem with Stochastic Demands and Preventive Returns
inferred← citeshttps://doi.org/10.20944/preprints202206.0074.v1openalex-snapshot
A Cooperative Parallel Tabu Search Meta-heuristic for the Vehicle Routing Problem with Time Windows
inferred← citeshttps://doi.org/10.2139/ssrn.6595201openalex-snapshot
Polyhedral Analysis and a Preprocessed Labeling Algorithm for the Elementary Shortest Path Problem with Resource Constraints
inferred← citeshttps://doi.org/10.36443/10259/4609openalex-snapshot
Optimización multiobjetivo del transporte de personas discapacitadas: diseño de nuevas metodologías metaheurísticas
inferred← citeshttps://doi.org/10.37266/iser.2015v3i1.pp17-36openalex-snapshot
Energy-Efficient Location-Routing Problem with Time Windows with Dynamic Demand
inferred← citeshttps://doi.org/10.37936/ecti-cit.2024181.253577openalex-snapshot
D-Wave Implementation of Quantum Annealing for Optimal Resource Allocation in Disaster Response Operation of Marikina City
inferred← citeshttps://doi.org/10.47749/t/unicamp.2016.979626openalex-snapshot
O problema dos árbitros viajantes
inferred← citeshttps://doi.org/10.70675/4eb4bf0azefa4z40e3z990czefbb2c6327daopenalex-snapshot
Maintenance Scheduling and Vehicle Routing Optimisation with Stochastic Components
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.