On the public citation graph
An exact algorithm for the capacitated shortest spanning arborescence
0 signed · 46 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/net.3230030204openalex-snapshot
The Capacitated Minimum Spanning Tree
inferredcites →https://doi.org/10.1002/net.3230040403openalex-snapshot
Computing capacitated minimal spanning trees efficiently
inferredcites →https://doi.org/10.1002/net.3230080306openalex-snapshot
The complexity of the capacitated tree problem
inferredcites →https://doi.org/10.1002/net.3230160104openalex-snapshot
An exact algorithm for the asymmetrical capacitated vehicle routing problem
inferredcites →https://doi.org/10.1002/net.3230190505openalex-snapshot
A branch and bound algorithm for the multiple depot vehicle scheduling problem
inferredcites →https://doi.org/10.1002/net.3230230603openalex-snapshot
A branch and bound algorithm for the capacitated minimum spanning tree problem
inferredcites →https://doi.org/10.1007/bf01584070openalex-snapshot
The traveling-salesman problem and minimum spanning trees: Part II
inferredcites →https://doi.org/10.1007/bf01585701openalex-snapshot
An additive bounding procedure for the asymmetric travelling salesman problem
inferredcites →https://doi.org/10.1007/bf01589105openalex-snapshot
New lower bounds for the Symmetric Travelling Salesman Problem
inferredcites →https://doi.org/10.1016/0167-6377(88)90025-9openalex-snapshot
A new dominance procedure for combinatorial optimization problems
inferredcites →https://doi.org/10.1016/0196-6774(84)90042-7openalex-snapshot
Efficient algorithms for a family of matroid intersection problems
inferredcites →https://doi.org/10.1016/0377-2217(89)90483-9openalex-snapshot
Vehicle routing: Methods and studies
inferredcites →https://doi.org/10.1016/0377-2217(91)90159-sopenalex-snapshot
Knapsack problems, algorithms and computer implementations
inferredcites →https://doi.org/10.1016/0377-2217(96)00223-8openalex-snapshot
A heuristic algorithm for the Asymmetric Capacitated Vehicle Routing Problem
inferredcites →https://doi.org/10.1109/tcom.1974.1092122openalex-snapshot
Topological Design of Multipoint Teleprocessing Networks
inferredcites →https://doi.org/10.1145/322358.322367openalex-snapshot
Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
inferredcites →https://doi.org/10.1287/ijoc.5.4.426openalex-snapshot
An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs
inferredcites →https://doi.org/10.1287/opre.18.6.1138openalex-snapshot
The Traveling-Salesman Problem and Minimum Spanning Trees
inferredcites →https://doi.org/10.1287/opre.19.2.278openalex-snapshot
Pathology of Traveling-Salesman Subtour-Elimination Algorithms
inferredcites →https://doi.org/10.1287/opre.37.2.319openalex-snapshot
An Additive Bounding Procedure for Combinatorial Optimization Problems
inferredcites →https://doi.org/10.1287/opre.42.4.626openalex-snapshot
Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
inferredcites →https://doi.org/10.1287/opre.42.5.846openalex-snapshot
A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs
inferredcites →https://doi.org/10.2307/2583458openalex-snapshot
Knapsack Problems: Algorithms and Computer Implementations
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1097-0037(200001)35:1<1::aid-net1>3.0.co;2-lopenalex-snapshot
A hierarchy of hop-indexed models for the Capacitated Minimum Spanning Tree Problem
inferred← citeshttps://doi.org/10.1002/net.20061openalex-snapshot
Exact solution of the centralized network design problem on directed graphs
inferred← citeshttps://doi.org/10.1002/net.21733openalex-snapshot
On an effective approach for the coach trip with shuttle service problem of the VeRoLog solver challenge 2015
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_49openalex-snapshot
Capacitated Minimum Spanning Trees
inferred← citeshttps://doi.org/10.1007/0-387-25486-2_3openalex-snapshot
Vehicle Routing Problem with Time Windows
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_62openalex-snapshot
Capacitated Minimum Spanning Trees
inferred← citeshttps://doi.org/10.1007/978-1-4615-5755-5_1openalex-snapshot
Exact Solution of the Vehicle Routing Problem
inferred← citeshttps://doi.org/10.1007/s10107-006-0043-yopenalex-snapshot
Robust branch-cut-and-price for the Capacitated Minimum Spanning Tree problem over a large extended formulation
inferred← citeshttps://doi.org/10.1016/j.cor.2006.11.006openalex-snapshot
Formulations and exact algorithms for the vehicle routing problem with time windows
inferred← citeshttps://doi.org/10.1016/j.cor.2023.106248openalex-snapshot
A branch-and-bound algorithm for the Precedence-Constrained Minimum-Cost Arborescence problem
inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00351-1openalex-snapshot
Models, relaxations and exact approaches for the capacitated vehicle routing problem
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80105-7openalex-snapshot
Chapter 1 Vehicle routing
inferred← citeshttps://doi.org/10.1016/s0927-0507(06)14006-2openalex-snapshot
Chapter 6 Vehicle Routing
inferred← citeshttps://doi.org/10.1023/a:1018911003529openalex-snapshot
The Capacitated Minimal Spanning Tree Problem: An experiment with a hop‐indexedmodel
inferred← citeshttps://doi.org/10.1057/palgrave.jors.2601246openalex-snapshot
A simple enhancement of the Esau–Williams heuristic for the capacitated minimum spanning tree problem
inferred← citeshttps://doi.org/10.1057/s41274-016-0146-7openalex-snapshot
A greedy heuristic for the capacitated minimum spanning tree problem
inferred← citeshttps://doi.org/10.1109/bigdata.2014.7004430openalex-snapshot
Metaheuristics in big data: An approach to railway engineering
inferred← citeshttps://doi.org/10.1287/opre.51.2.228.12786openalex-snapshot
An Oil Pipeline Design Problem
inferred← citeshttps://doi.org/10.1287/trsc.31.4.372openalex-snapshot
An Exact Algorithm for the Vehicle Routing Problem with Backhauls
inferred← citeshttps://doi.org/10.5821/dissertation-2117-95116openalex-snapshot
The capacitated minimum spanning tree 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.