Reference health
Models, relaxations and exact approaches for the capacitated vehicle routing problem
00351-1/badge.svg){kind=icon}
36/36 checkable references clean · checked 2026-07-24
Every reference with a DOI in the deposited reference list resolved to a known work in Crossref or DataCite at the dated check, and none carried a retraction, withdrawal, or removal notice.
12 without a DOI — not checked. A reference deposited without a DOI is never matched by title or guessed at; it stays outside the checked set, and this line discloses that.
The 36 checked references that resolve
resolves10.1002/net.3230190702
A set‐partitioning‐based exact algorithm for the vehicle routing problem
resolves10.1287/opre.45.2.295
On the Effectiveness of Set Covering Formulations for the Vehicle Routing Problem with Time Windows
resolves10.1287/mnsc.26.7.736
Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem
resolves10.1007/BF01589353
Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
resolves10.1016/0167-6377(91)90083-2
Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints
resolves10.1007/BF01585701
An additive bounding procedure for the asymmetric travelling salesman problem
resolves10.1287/opre.42.5.846
A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs
resolves10.1287/opre.42.4.775
A Polynomial Algorithm for the Degree-Constrained Minimum K-Tree Problem
resolves10.1016/0196-6774(84)90042-7
Efficient algorithms for a family of matroid intersection problems
resolves10.1007/BF02098280
A new exact algorithm for the vehicle routing problem based onq-paths andk-shortest paths relaxations
resolves10.1016/0377-2217(92)90192-C
The vehicle routing problem: An overview of exact and approximate algorithms
resolves10.1002/net.3230160104
An exact algorithm for the asymmetrical capacitated vehicle routing problem
resolves10.1002/net.3230110209
Combinatorial optimization and vehicle fleet planning: Perspectives and prospects
resolves10.1287/ijoc.7.3.298
A Staged Primal-Dual Algorithm for Perfect b-Matching with Edge Capacities
resolves10.1287/ijoc.6.1.68
A Staged Primal-Dual Algorithm for Finding a Minimum Cost Perfect Two-Matching in an Undirected Graph
resolves10.1016/0377-2217(96)00223-8
A heuristic algorithm for the Asymmetric Capacitated Vehicle Routing Problem
The 12 references without a DOI — listed, not checked
no DOI — not checkedVehicle routing
no DOI — not checkedVehicle routing: practical and algorithmic aspects
no DOI — not checkedThe vehicle routing problem
no DOI — not checkedJ.J. Dongarra, Performance of various computers using standard linear equations software, Technical Report CS-89-85, University of Tennessee, Knoxville, 1996.
no DOI — not checked10.1016/S0166-218X(01)00351-1_BIB24
no DOI — not checkedThe impact of metaheuristics on solving the vehicle routing problem: algorithms, problem sets, and computational results
no DOI — not checkedVehicle routing
no DOI — not checkedExact algorithms for the vehicle routing problem
no DOI — not checked10.1016/S0166-218X(01)00351-1_BIB38
no DOI — not checkedExact solution of the vehicle routing problem
no DOI — not checkedP. Toth, D. Vigo, The granular tabu search (and its application to the vehicle routing problem). Technical Report OR/98/9, D.E.I.S. - Università di Bologna, 1998.
no DOI — not checkedD. Vigo, VRPLIB: a vehicle routing problem library, Technical Report OR/99/9, D.E.I.S., Universitá di Bologna, 1999.
What this badge says. CiteStamped means the CHECKABLE references of this
work were clean at the dated check: each resolved to a known work in a public registry, and none
carried a retraction notice at that time. It says nothing about the quality, findings,
or importance of the work itself, and nothing about references deposited without a DOI.
checked 2026-07-24 — re-checked daily as this page is visited; titles and statuses come from Crossref and DataCite and are not part of the signed record
Embed this badge
Both snippets point at the live badge image and link back to this page. The badge re-renders from the daily check, so an embed never goes stale by more than a day of visits.
<a href="https://citestamp.com/citestamped/10.1016/s0166-218x(01)00351-1"><img src="https://citestamp.com/citestamped/10.1016/s0166-218x(01)00351-1/badge.svg" alt="CiteStamped reference-health badge" width="460" height="64"></a>
[00351-1/badge.svg)](https://citestamp.com/citestamped/10.1016/s0166-218x(01)00351-1)