Constrained Shortest Path Instance Dataset for Algorithm Evaluation

Konstantin Sidorov from Delft University of Technology created this dataset for the experimental evaluation in the paper "Paths, Proofs, and Perfection: Developing a Human-Interpretable Proof System for Constrained Shortest Paths" submitted to AAAI-24. The dataset likely contains instances of constrained shortest path problems. Its size, specific format, and number of rows are not detailed in the available metadata.

Use Cases

• Benchmarking constrained shortest path algorithms based on the problem instances described.
• Developing human-interpretable proof systems for optimization problems based on the dataset's structure.
• Evaluating algorithm performance on graph-based optimization tasks as referenced in the associated paper.

Strengths

• Dataset is associated with a peer-reviewed paper submitted to AAAI-24, suggesting academic rigor.
• The dataset is explicitly designed for experimental evaluation, indicating a clear purpose for benchmarking.

Limitations

• Row count is unknown, which may limit suitability assessment.
• Column-level documentation is absent; field semantics must be inferred after download.
• Last update date is unknown; freshness unverified.

Provenance

Source

Konstantin Sidorov, Delft University of Technology

Collection Method

Created for experimental evaluation in a specific research paper.