Call-Based Dynamic Programming for the Precedence Constrained Line Traveling Salesman

DOI10.1007/978-3-319-07046-9_1zbMath1417.90124OpenAlexW70822155MaRDI QIDQ5418724

Vincent Jost, Antoine Jeanjean, Thierry Benoist

Publication date: 27 May 2014

Published in: Integration of AI and OR Techniques in Constraint Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-07046-9_1

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (1)

Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization

This page was built for publication: Call-Based Dynamic Programming for the Precedence Constrained Line Traveling Salesman