Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-07-11T18:35:21.050589Z
Paper Citation Record · LEDGER
An open, reproducible branch-and-cut for the capacitated profitable tour problem: a component study
As of 13 August 2026, this Paper Citation Record lists 29 of 29 outbound references and 0 inbound Pith citation observations for arXiv:2607.04497.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-12T06:34:41.77262+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links
A source-named dated measurement, never combined with another source.
Source: cited_works
Reference resolution
29 of 29 outbound references displayed
- verified exact16
- verified fuzzy0
- unresolved12
- parse uncertain0
- malformed identifier1
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation e5603ea7-1377-49c8-9b0d-773eecfd10fc · outbound
This paper cites an unresolved cited work.
An open, reproducible branch-and-cut for the capacitated profitable tour problem: a component study Unresolved cited work
Reference 1
- Resolution
- unresolved
- no resolver link, observed 2026-07-11T18:35:21.050589Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 1eedc248-bd8a-4214-8c6d-b8f22c335bb5 · outbound
This paper cites an unresolved cited work.
An open, reproducible branch-and-cut for the capacitated profitable tour problem: a component study Unresolved cited work
Reference 2
- Resolution
- verified exact
- doi, observed 2026-07-11T18:38:10.702939Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation 1aefa9fc-8f80-424f-a52b-7247e48ee184 · outbound
This paper cites Resource constrained shortest path problems in path planning for fleet management.Journal of Mathematical Modelling and Algorithms, 3(1):1–17, 2004.
An open, reproducible branch-and-cut for the capacitated profitable tour problem: a component study Resource constrained shortest path problems in path planning for fleet management.Journal of Mathematical Modelling and Algorithms, 3(1):1–17, 2004
Reference 3
- Resolution
- verified exact
- arxiv_id, observed 2026-07-11T18:38:10.728834Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation 54d6fbfb-ff73-47f9-b579-8be139bcef18 · outbound
This paper cites Bisectors of the HARPS Cross-Correlation-Function. The dependence on stellar atmospheric parameters.
An open, reproducible branch-and-cut for the capacitated profitable tour problem: a component study Bisectors of the HARPS Cross-Correlation-Function. The dependence on stellar atmospheric parameters
Reference 4
- Resolution
- unresolved
- no resolver link, observed 2026-07-11T18:35:21.050589Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation d8f7586e-8872-4558-8d24-b3b26e6ea93e · outbound
This paper cites The circuit polytope: facets.Mathematics of Operations Research, 22(1):110–145, 1997.
An open, reproducible branch-and-cut for the capacitated profitable tour problem: a component study The circuit polytope: facets.Mathematics of Operations Research, 22(1):110–145, 1997
Reference 5
- Resolution
- verified exact
- doi, observed 2026-07-11T18:38:10.739470Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation 2be00616-3cb5-40e5-af7f-3206915658e0 · outbound
This paper cites an unresolved cited work.
An open, reproducible branch-and-cut for the capacitated profitable tour problem: a component study Unresolved cited work
Reference 6
- Resolution
- unresolved
- no resolver link, observed 2026-07-11T18:35:21.050589Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation cc9f320e-f5fd-4f43-8887-bb69ea171391 · outbound
This paper cites Exact branch-price-and-cut algorithms for vehicle routing.Transportation Science, 53(4):946–985, 2019.
An open, reproducible branch-and-cut for the capacitated profitable tour problem: a component study Exact branch-price-and-cut algorithms for vehicle routing.Transportation Science, 53(4):946–985, 2019
Reference 7
- Resolution
- unresolved
- no resolver link, observed 2026-07-11T18:35:21.050589Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation bf58a5f7-db1d-4dc9-bd18-e8a71cf9b22f · outbound
This paper cites A computational study of solution approaches for the resource constrained elementary shortest path problem.Annals of Operations Research, 201(1):131–157, 2012.
An open, reproducible branch-and-cut for the capacitated profitable tour problem: a component study A computational study of solution approaches for the resource constrained elementary shortest path problem.Annals of Operations Research, 201(1):131–157, 2012
Reference 8
- Resolution
- verified exact
- doi, observed 2026-07-11T18:38:10.727044Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation 6387ae6f-575f-4210-b32a-0bbb50a46b32 · outbound
This paper cites an unresolved cited work.
An open, reproducible branch-and-cut for the capacitated profitable tour problem: a component study Unresolved cited work
Reference 9
- Resolution
- unresolved
- no resolver link, observed 2026-07-11T18:35:21.050589Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 265b057a-4aea-406b-923c-87ff499562a3 · outbound
This paper cites A note on the separation of subtour elimination constraints in elementary shortest path problems.
An open, reproducible branch-and-cut for the capacitated profitable tour problem: a component study A note on the separation of subtour elimination constraints in elementary shortest path problems
Reference 10
- Resolution
- verified exact
- doi, observed 2026-07-11T18:38:10.707092Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation 8878a284-a866-4a18-9700-46aeadd78a0e · outbound
This paper cites Solving elementary shortest-path problems as mixed-integer programs.OR Spectrum, 36(2):281–296, 2014.
An open, reproducible branch-and-cut for the capacitated profitable tour problem: a component study Solving elementary shortest-path problems as mixed-integer programs.OR Spectrum, 36(2):281–296, 2014
Reference 11
- Resolution
- verified exact
- doi, observed 2026-07-11T18:38:10.721580Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation 1f4a714b-d75e-4eb5-908c-415b10313e21 · outbound
This paper cites An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems.Networks, 44(3): 216–229, 2004.
An open, reproducible branch-and-cut for the capacitated profitable tour problem: a component study An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems.Networks, 44(3): 216–229, 2004
Reference 12
- Resolution
- verified exact
- doi, observed 2026-07-11T18:38:10.758201Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation a5e3a433-23f5-49d2-9d63-f70ee900a169 · outbound
This paper cites PhD thesis, Georgia Institute of Technology, Atlanta, GA, 2009.
An open, reproducible branch-and-cut for the capacitated profitable tour problem: a component study PhD thesis, Georgia Institute of Technology, Atlanta, GA, 2009
Reference 13
- Resolution
- unresolved
- no resolver link, observed 2026-07-11T18:35:21.050589Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 0ba69e88-4fba-4dca-9458-5eaf00661754 · outbound
This paper cites Very simple methods for all pairs network flow analysis.SIAM Journal on Computing, 19(1): 143–155, 1990.
An open, reproducible branch-and-cut for the capacitated profitable tour problem: a component study Very simple methods for all pairs network flow analysis.SIAM Journal on Computing, 19(1): 143–155, 1990
Reference 14
- Resolution
- verified exact
- doi, observed 2026-07-11T18:38:10.734832Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation 260dd0b8-ae8d-4d95-b23a-3e6b3f7cff60 · outbound
This paper cites an unresolved cited work.
An open, reproducible branch-and-cut for the capacitated profitable tour problem: a component study Unresolved cited work
Reference 15
- Resolution
- unresolved
- no resolver link, observed 2026-07-11T18:35:21.050589Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation c3281495-d28b-47a0-bfb3-7b99cf0440a4 · outbound
This paper cites Solving resource constrained shortest path problems with lp-based methods.
An open, reproducible branch-and-cut for the capacitated profitable tour problem: a component study Solving resource constrained shortest path problems with lp-based methods
Reference 16
- Resolution
- verified exact
- doi, observed 2026-07-11T18:38:10.763232Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation d564a9d1-42f6-4883-aa34-b7e2bad347f8 · outbound
This paper cites an unresolved cited work.
An open, reproducible branch-and-cut for the capacitated profitable tour problem: a component study Unresolved cited work
Reference 17
- Resolution
- unresolved
- no resolver link, observed 2026-07-11T18:35:21.050589Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation e0e62ba8-d2e7-4175-b067-3ddc8d53e05e · outbound
This paper cites A branch-and-cut algorithm for the elementary shortest path problem with a capacity constraint.
An open, reproducible branch-and-cut for the capacitated profitable tour problem: a component study A branch-and-cut algorithm for the elementary shortest path problem with a capacity constraint
Reference 18
- Resolution
- unresolved
- no resolver link, observed 2026-07-11T18:35:21.050589Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation d158c174-e3cf-47bd-b230-4378d8c3e395 · outbound
This paper cites Jepsen, Bjørn Petersen, Simon Spoorendonk, and David Pisinger.
An open, reproducible branch-and-cut for the capacitated profitable tour problem: a component study Jepsen, Bjørn Petersen, Simon Spoorendonk, and David Pisinger
Reference 19
- Resolution
- verified exact
- doi, observed 2026-07-11T18:38:10.731972Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation 98208703-5e00-4173-a610-2d55ecc6aafa · outbound
This paper cites A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints.European Journal of Operational Research, 289(3):879–896, 2021.
An open, reproducible branch-and-cut for the capacitated profitable tour problem: a component study A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints.European Journal of Operational Research, 289(3):879–896, 2021
Reference 20
- Resolution
- verified exact
- doi, observed 2026-07-11T18:38:10.752067Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation a2c4549a-8443-4ece-94ba-13ac64824bf7 · outbound
This paper cites Letchford and Juan-José Salazar-González.
An open, reproducible branch-and-cut for the capacitated profitable tour problem: a component study Letchford and Juan-José Salazar-González
Reference 21
- Resolution
- verified exact
- doi, observed 2026-07-11T18:38:10.743482Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation 3db9fff0-58fa-4c38-9ca5-8e9c948753c6 · outbound
This paper cites Medaglia.
An open, reproducible branch-and-cut for the capacitated profitable tour problem: a component study Medaglia
Reference 22
- Resolution
- unresolved
- no resolver link, observed 2026-07-11T18:35:21.050589Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 3f22e296-9eb7-4ffe-9eca-8d773ff7ba44 · outbound
This paper cites A generic exact solver for ve- hicle routing and related problems.Mathematical Programming, 183(1–2):483–523, 2020.
An open, reproducible branch-and-cut for the capacitated profitable tour problem: a component study A generic exact solver for ve- hicle routing and related problems.Mathematical Programming, 183(1–2):483–523, 2020
Reference 23
- Resolution
- malformed identifier
- no resolver link, observed 2026-07-11T18:35:21.050589Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation b90320fa-00c7-492a-90e7-dcdff5bba5b2 · outbound
This paper cites Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints.Discrete Optimization, 3(3):255–273, 2006.
An open, reproducible branch-and-cut for the capacitated profitable tour problem: a component study Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints.Discrete Optimization, 3(3):255–273, 2006
Reference 24
- Resolution
- verified exact
- doi, observed 2026-07-11T18:38:10.717152Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation 7e066320-aaaa-43a8-b683-cb13b6884ce9 · outbound
This paper cites A bucket graph-based labeling algorithm with application to vehicle routing.Transportation Science, 55(1):4–28, 2021.
An open, reproducible branch-and-cut for the capacitated profitable tour problem: a component study A bucket graph-based labeling algorithm with application to vehicle routing.Transportation Science, 55(1):4–28, 2021
Reference 25
- Resolution
- verified exact
- arxiv_id, observed 2026-07-11T18:38:10.739064Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation 0f0626db-b4b6-4f19-8a74-17b58e6b72d2 · outbound
This paper cites PathWyse: a flexible, open-source library for the resource constrained shortest path problem.Optimization Methods and Software, 39(2):298–320, 2024.
An open, reproducible branch-and-cut for the capacitated profitable tour problem: a component study PathWyse: a flexible, open-source library for the resource constrained shortest path problem.Optimization Methods and Software, 39(2):298–320, 2024
Reference 26
- Resolution
- unresolved
- no resolver link, observed 2026-07-11T18:35:21.050589Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation cdabb821-f484-4c40-b830-1f184baeeb76 · outbound
This paper cites $\texttt{bucket-graph-spprc}$: an extensible C++ library for the shortest path problem with resource constraints.
An open, reproducible branch-and-cut for the capacitated profitable tour problem: a component study $\texttt{bucket-graph-spprc}$: an extensible C++ library for the shortest path problem with resource constraints
Reference 27
- Resolution
- unresolved
- no resolver link, observed 2026-07-11T18:35:21.050589Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 7d4558da-c084-4ea2-9821-c5f4faf857f3 · outbound
This paper cites cptp: a C++23 branch-and-cut solver for the capacitated profitable tour problem, 2026.
An open, reproducible branch-and-cut for the capacitated profitable tour problem: a component study cptp: a C++23 branch-and-cut solver for the capacitated profitable tour problem, 2026
Reference 28
- Resolution
- verified exact
- doi, observed 2026-07-11T18:38:10.709933Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation a799be79-4230-4fab-9b07-1d5cd22e5808 · outbound
This paper cites Integer programming formulations for the elementary shortest path problem.European Journal of Operational Research, 252(1):122–130, 2016.
An open, reproducible branch-and-cut for the capacitated profitable tour problem: a component study Integer programming formulations for the elementary shortest path problem.European Journal of Operational Research, 252(1):122–130, 2016
Reference 29
- Resolution
- verified exact
- doi, observed 2026-07-11T18:38:10.780385Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Pith citing papers
No inbound Pith citation observations are available.