Code, benchmarks, experiment data, and additional results for the ICAPS 2026 paper "Operator-Counting Heuristics for Domain-Independent Dynamic Programming"

Key Points

• The aim is to present supplementary data demonstrating the efficacy of operator-counting heuristics in dynamic programming.
• Provided supplementary PDF with detailed results and technical definitions
• Included source code for implementation
• Supplied benchmarks for four problem classes: BPP, m-PDTSP, TSP, Talent Scheduling
• Shared experiment run logs and scripts for reproducibility
• Detailed results are included in the supplementary PDF file
• Benchmarks for diverse problems demonstrate the effectiveness of heuristics
• Source code allows for replication of results and further experimentation

Abstract