Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-14T13:28:21.735432Z
Paper Citation Record · LEDGER
Algorithms the min-max regret 0-1 Integer Linear Programming Problem with Interval Data
As of 17 August 2026, this Paper Citation Record lists 5 of 5 outbound references and 0 inbound Pith citation observations for arXiv:1908.05082.
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-16T06:30:59.297886+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
5 of 5 outbound references displayed
- verified exact0
- verified fuzzy5
- unresolved0
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation bdb6945b-2350-45b5-8633-659255d88c2a · outbound
This paper cites Aissi, C.
Algorithms the min-max regret 0-1 Integer Linear Programming Problem with Interval Data Aissi, C
Reference 1
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T13:28:21.812563Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 4691d85f-b67a-4141-bb54-06e31dca7a2d · outbound
This paper cites A scenario based heuristic for the robust shortest path tree problem.
Algorithms the min-max regret 0-1 Integer Linear Programming Problem with Interval Data A scenario based heuristic for the robust shortest path tree problem
Reference 2
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T13:28:21.802227Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 6b0c2d86-ba3b-40c2-a361-22042b597d90 · outbound
This paper cites Senario-based heuristics with path-relinking for the robust set covering problem.
Algorithms the min-max regret 0-1 Integer Linear Programming Problem with Interval Data Senario-based heuristics with path-relinking for the robust set covering problem
Reference 3
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T13:28:21.790411Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 2936f32a-a3e0-4883-b663-04fb67114bf3 · outbound
This paper cites An approximation a lgorithm for interval data minmax regret combinatorial optimization problems.
Algorithms the min-max regret 0-1 Integer Linear Programming Problem with Interval Data An approximation a lgorithm for interval data minmax regret combinatorial optimization problems
Reference 4
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T13:28:21.778582Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation b9807ab4-1e17-429b-9c15-2f39fc266511 · outbound
This paper cites The robu st shortest path problem with interval data via benders decomposition.
Algorithms the min-max regret 0-1 Integer Linear Programming Problem with Interval Data The robu st shortest path problem with interval data via benders decomposition
Reference 5
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T13:28:21.767125Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Pith citing papers
No inbound Pith citation observations are available.