Paper Citation Record · LEDGER

On Solving the Knapsack Problem with Conflicts

As of 8 August 2026, this Paper Citation Record lists 16 of 16 outbound references and 0 inbound Pith citation observations for arXiv:2506.03330.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2506.03330 v1

Coverage vector

measured 16 of 16 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-07T11:10:18.334797Z

measured 16 of 16 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-07T06:34:17.273281+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

16 of 16 outbound references displayed

verified exact0
verified fuzzy9
unresolved6
parse uncertain0
malformed identifier1
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 65096775-e2f6-401a-9e3c-76e508c9d179 · outbound

This paper cites Martello and P.

On Solving the Knapsack Problem with Conflicts Martello and P

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:10:18.606363Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 43dffdd9-6cc7-4a16-b311-fc7be059f33c · outbound

This paper cites A new branch-and-price-and- cut algorithm for one-dimensional bin-packing problems,.

On Solving the Knapsack Problem with Conflicts A new branch-and-price-and- cut algorithm for one-dimensional bin-packing problems,

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:10:18.589246Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 3678c4fc-0ddd-4726-8bf2-b2bf0c92623f · outbound

This paper cites A branch-and-bound algorithm for the knapsack problem with conflict graph,.

On Solving the Knapsack Problem with Conflicts A branch-and-bound algorithm for the knapsack problem with conflict graph,

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-07T11:10:17.723516Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7af128db-0354-4687-b875-e6f083101716 · outbound

This paper cites Heuristic and exact algo- rithms for the disjunctively constrained knapsack problem,.

On Solving the Knapsack Problem with Conflicts Heuristic and exact algo- rithms for the disjunctively constrained knapsack problem,

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:10:18.564401Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 3d51e311-630a-4909-b5b4-337f6cbe30d5 · outbound

This paper cites Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem,.

On Solving the Knapsack Problem with Conflicts Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem,

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:10:18.548056Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation d7b20c50-5be0-44a9-b0f1-39ed60e21051 · outbound

This paper cites A reactive local search-based algorithm for the disjunctively constrained knapsack problem,.

On Solving the Knapsack Problem with Conflicts A reactive local search-based algorithm for the disjunctively constrained knapsack problem,

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:10:18.533586Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation a8062cdc-1593-4e54-b49e-31a8cc21cc2b · outbound

This paper cites Local branching- based algorithms for the disjunctively constrained knapsack problem,.

On Solving the Knapsack Problem with Conflicts Local branching- based algorithms for the disjunctively constrained knapsack problem,

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:10:18.518186Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 46e8feeb-00eb-4b13-b84b-5c891ce907a1 · outbound

This paper cites An algorithm for the disjunctively constrained knapsack problem,.

On Solving the Knapsack Problem with Conflicts An algorithm for the disjunctively constrained knapsack problem,

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:10:18.504380Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 39afa873-d0c2-4d83-9e36-6908fac911f2 · outbound

This paper cites An iterative rounding search-based algorithm for the dis- junctively constrained knapsack problem,.

On Solving the Knapsack Problem with Conflicts An iterative rounding search-based algorithm for the dis- junctively constrained knapsack problem,

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:10:18.489534Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation b60ac19d-0b51-4eb4-9805-6c2b6687170e · outbound

This paper cites A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts,.

On Solving the Knapsack Problem with Conflicts A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts,

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-07T11:10:18.102080Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c8c5e6a2-ccd0-476d-90d1-57182e946ef7 · outbound

This paper cites Google OR-Tools - CP-SAT,.

On Solving the Knapsack Problem with Conflicts Google OR-Tools - CP-SAT,

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-07T11:10:18.155383Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f2d44a72-8b27-4f00-987a-e3bae8477929 · outbound

This paper cites Solving the parallel drone schedul- ing traveling salesman problem via constraint programming,.

On Solving the Knapsack Problem with Conflicts Solving the parallel drone schedul- ing traveling salesman problem via constraint programming,

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-07T11:10:18.213670Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6734d488-9713-4709-a2bd-9823ad81efcc · outbound

This paper cites Parallel drone scheduling vehicle routing problems with collective drones,.

On Solving the Knapsack Problem with Conflicts Parallel drone scheduling vehicle routing problems with collective drones,

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-07T11:10:18.271325Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 30dfefc9-39d3-4f0f-849c-8163e9ac02ff · outbound

This paper cites Solving a home healthcare routing and scheduling problem with real-world features,.

On Solving the Knapsack Problem with Conflicts Solving a home healthcare routing and scheduling problem with real-world features,

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-07T11:10:18.296222Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8ecec115-e812-46e7-abfb-1d4e52a1c3c6 · outbound

This paper cites A hybrid grouping genetic algorithm for bin packing,.

On Solving the Knapsack Problem with Conflicts A hybrid grouping genetic algorithm for bin packing,

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:10:18.409365Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 02e152b9-3eba-4d84-ac05-be732b4088f9 · outbound

This paper cites IBM CPLEX Optimizer,.

On Solving the Knapsack Problem with Conflicts IBM CPLEX Optimizer,

Reference 16

Resolution: malformed identifier; raw_fallback, observed 2026-08-07T11:10:18.393835Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Pith citing papers

No inbound Pith citation observations are available.