On the public citation graph

Formulations and Branch-and-Cut Algorithms for the Heterogeneous Fleet Vehicle Routing Problem with Due Dates

https://doi.org/10.2139/ssrn.4682185
0 signed · 26 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.20330openalex-extracted
A robust branch‐cut‐and‐price algorithm for the heterogeneous fleet vehicle routing problem
inferredcites →https://doi.org/10.1002/net.20331openalex-extracted
Valid inequalities for the fleet size and mix vehicle routing problem with fixed costs
inferredcites →https://doi.org/10.1007/978-3-540-72845-0_12openalex-extracted
A Robust Branch-Cut-and-Price Algorithm for the Heterogeneous Fleet Vehicle Routing Problem
inferredcites →https://doi.org/10.1007/bf01582064openalex-extracted
The Steiner tree polytope and related polyhedra
inferredcites →https://doi.org/10.1007/s10107-005-0652-xopenalex-extracted
Projection results for vehicle routing
inferredcites →https://doi.org/10.1007/s10107-008-0218-9openalex-extracted
A unified exact method for solving different classes of vehicle routing problems
inferredcites →https://doi.org/10.1007/s10288-010-0136-6openalex-extracted
A column generation algorithm for the vehicle routing problem with soft time windows
inferredcites →https://doi.org/10.1007/s10288-021-00498-7openalex-extracted
A branch-cut-and-price algorithm for the cumulative capacitated vehicle routing problem
inferredcites →https://doi.org/10.1007/s12351-017-0299-4openalex-extracted
Mixed integer formulations for the multiple minimum latency problem
inferredcites →https://doi.org/10.1007/s13676-018-0121-3openalex-extracted
The opportunity cost of time window violations
inferredcites →https://doi.org/10.1016/j.cor.2010.03.015openalex-extracted
Industrial aspects and literature survey: Fleet composition and routing
inferredcites →https://doi.org/10.1016/j.cor.2016.06.019openalex-extracted
Time constrained maximal covering salesman problem with weighted demands and partial coverage
inferredcites →https://doi.org/10.1016/j.ejor.2013.08.032openalex-extracted
A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem
inferredcites →https://doi.org/10.1016/j.ejor.2013.09.014openalex-extracted
Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints
inferredcites →https://doi.org/10.1016/j.ejor.2015.07.020openalex-extracted
Thirty years of heterogeneous vehicle routing
inferredcites →https://doi.org/10.1016/j.ejor.2017.05.039openalex-extracted
Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems
inferredcites →https://doi.org/10.1016/j.ejor.2018.04.009openalex-extracted
Enhanced Branch-Cut-and-Price algorithm for heterogeneous fleet vehicle routing problems
inferredcites →https://doi.org/10.1016/j.eswa.2013.05.036openalex-extracted
Variable neighborhood search algorithm for heterogeneous traveling repairmen problem with time windows
inferredcites →https://doi.org/10.1016/j.tre.2009.04.007openalex-extracted
An exact solution approach for vehicle routing and scheduling problems with soft time windows
inferredcites →https://doi.org/10.1016/j.tre.2013.12.003openalex-extracted
The trade-off between fixed vehicle costs and time-dependent arrival penalties in a routing problem
inferredcites →https://doi.org/10.1145/321043.321046openalex-extracted
Integer Programming Formulation of Traveling Salesman Problems
inferredcites →https://doi.org/10.1287/ijoc.2017.0756openalex-extracted
The Vehicle Routing Problem with Release and Due Dates
inferredcites →https://doi.org/10.1287/opre.1040.0111openalex-extracted
An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation
inferredcites →https://doi.org/10.1287/opre.35.2.254openalex-extracted
Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
inferredcites →https://doi.org/10.1287/trsc.2020.1005openalex-extracted
Branch-and-Cut and Iterated Local Search for the Weighted k-Traveling Repairman Problem: An Application to the Maintenance of Speed Cameras
inferredcites →https://doi.org/10.48550/arxiv.1909.06226openalex-extracted
Branch-and-cut and iterated local search for the weighted $k$-traveling repairman problem: an application to the maintenance of speed cameras
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.