2 papers
cs.AI2026
Domain-Independent Dynamic Programming
Ryo Kuroiwa, J. Christopher Beck
For combinatorial optimization problems, model-based paradigms such as mixed-integer programming (MIP) and constraint programming (CP) aim to decouple modeling and solving a proble…
cs.AI2025
Reinforcement Learning-based Heuristics to Guide Domain-Independent Dynamic Programming
Minori Narita, Ryo Kuroiwa, J. Christopher Beck
Domain-Independent Dynamic Programming (DIDP) is a state-space search paradigm based on dynamic programming for combinatorial optimization. In its current implementation, DIDP guid…