Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-07T11:09:14.463863Z
Paper Citation Record · LEDGER
As of 8 August 2026, this Paper Citation Record lists 24 of 24 outbound references and 0 inbound Pith citation observations for arXiv:2506.04274.
A citation records a reference. It does not transfer a finding from one paper to another.
Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-07T11:09:14.463863Z
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-07T06:34:17.273281+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
24 of 24 outbound references displayed
External citation measurements
No source-named external measurement is stored.
Observation 842d15b3-01c5-4d6d-8696-452b905c463e · outbound
On Solving the Assignment Problem with Conflicts Unresolved cited work
Reference 1
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 47e5134d-9a70-4624-9cf8-215bb30445bd · outbound
On Solving the Assignment Problem with Conflicts The Hungarian method for the assignment problem,
Reference 2
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 baf2e676-c0fd-4edc-b32c-9ccb7a104c1a · outbound
On Solving the Assignment Problem with Conflicts Assignment problem with conflicts,
Reference 3
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 9595d933-de61-4548-879f-23a620f2f132 · outbound
On Solving the Assignment Problem with Conflicts A branch-and-bound algorithm for the knapsack problem with conflict graph,
Reference 4
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 5fa7c0d2-40ce-44e9-8622-ca78e09c1df6 · outbound
On Solving the Assignment Problem with Conflicts A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts,
Reference 5
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 d06729a0-8648-4721-95f1-5d9cee59877d · outbound
On Solving the Assignment Problem with Conflicts The minimum spanning tree prob- lem with conflict constraints and its variations,
Reference 6
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 b4f932c9-31ab-4e33-ab2d-15eef29f592c · outbound
On Solving the Assignment Problem with Conflicts A branch and cut algorithm for minimum spanning trees under conflict constraints,
Reference 7
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 3daf60af-86d6-4c07-9a7d-bbb67fb97c15 · outbound
On Solving the Assignment Problem with Conflicts A multi-ethnic genetic approach for the minimum conflict weighted spanning tree problem,
Reference 8
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 07b42ac6-68b4-45d8-adb5-b09c44688826 · outbound
On Solving the Assignment Problem with Conflicts Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach,
Reference 9
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 79f5a856-48d3-4b0b-9b1d-81d046c4aef2 · outbound
On Solving the Assignment Problem with Conflicts A lagrangian approach for the minimum spanning tree problem with conflicting edge pairs,
Reference 10
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 1b6f73ad-4c2b-4085-afae-190f5b76466f · outbound
On Solving the Assignment Problem with Conflicts Shortest paths with exclusive-disjunction arc pairs conflicts,
Reference 11
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 3341ea00-b171-4869-b633-ae1b4303bfc8 · outbound
On Solving the Assignment Problem with Conflicts Set covering problem with conflict constraints,
Reference 12
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 7c8ab1dd-f760-4106-be25-088372df429c · outbound
On Solving the Assignment Problem with Conflicts Solving the set covering problem with conflicts on sets: A new parallel GRASP,
Reference 13
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 4ac1e495-d302-4ba0-bf15-b5c95ca21504 · outbound
On Solving the Assignment Problem with Conflicts Exact solution algorithms for the maximum flow problem with additional conflict constraints,
Reference 14
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 77dfa4af-7a47-46bc-9201-252bb87546be · outbound
On Solving the Assignment Problem with Conflicts Hy- bridizing carousel greedy and kernel search: A new approach for the maximum flow problem with conflict constraints,
Reference 15
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 69a5ea47-d456-4520-9b57-9c65f5352b99 · outbound
On Solving the Assignment Problem with Conflicts Paths, trees and matchings under disjunctive constraints,
Reference 16
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 6161d0db-87c9-403f-ac1e-96828e10d0c8 · outbound
On Solving the Assignment Problem with Conflicts The minimum cost perfect matching problem with conflict pair constraints,
Reference 17
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 e07605bb-c136-4b68-9120-d341f6c5ec99 · outbound
On Solving the Assignment Problem with Conflicts Iterated exact and heuristic algorithms for the minimum cost bipartite perfect matching problem with conflict constraints,
Reference 18
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 39bea83e-838f-4c22-91aa-ec48b7aa0ff2 · outbound
On Solving the Assignment Problem with Conflicts A branch-and-bound algorithm for the minimum cost bipartite perfect matching problem with conflict pair constraints,
Reference 19
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 8d9e7721-4fb9-421d-97d3-537780d48f7d · outbound
On Solving the Assignment Problem with Conflicts Google OR-Tools - CP-SAT,
Reference 20
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 ff99ed2d-b3c4-4501-b2ba-664646e3ed99 · outbound
On Solving the Assignment Problem with Conflicts Solving the parallel drone schedul- ing traveling salesman problem via constraint programming,
Reference 21
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 fb0e4ce9-80a2-4837-9493-31e831215764 · outbound
On Solving the Assignment Problem with Conflicts Parallel drone scheduling vehicle routing problems with collective drones,
Reference 22
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 5d024882-cd59-4062-b060-d350d79d547f · outbound
On Solving the Assignment Problem with Conflicts Solving a home healthcare routing and scheduling problem with real-world features,
Reference 23
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 8ab48115-b848-4e0b-9e80-3288d311c779 · outbound
On Solving the Assignment Problem with Conflicts IBM CPLEX Optimizer,
Reference 24
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.
No inbound Pith citation observations are available.