From the 1 of 5 linked papers with an AI index.
5 papers
Column Generation with Domain-Independent Dynamic Programming
Ryo Kuroiwa, Edward Lam
The paper proposes using domain‑independent dynamic programming as a generic pricing solver within column generation and branch‑and‑price frameworks, showing improved performance a…
Domain-Independent Dynamic Programming with Constraint Propagation
Imko Marijnissen, J. Christopher Beck, Emir DemiroviÄ +1
There are two prevalent model-based paradigms for combinatorial problems: 1) state-based representations, such as heuristic search, dynamic programming (DP), and decision diagrams,…
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…
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…
Optimization Models for the Quadratic Traveling Salesperson Problem
Yuxiao Chen, Nivetha Sathish, Anubhav Singh +2
The quadratic traveling salesperson problem (QTSP) is a generalization of the traveling salesperson problem, in which all triples of consecutive customers in a tour determine the t…