8 citations · 12 across the 2 of their papers we have counts for
2 papers
cs.AI2014★ 4 cited
Combining finite and continuous solvers
Jean-Guillaume Fages, Gilles Chabert, Charles Prud'homme
Combining efficiency with reliability within CP systems is one of the main concerns of CP developers. This paper presents a simple and efficient way to connect Choco and Ibex, two…
cs.DM2012★ 8 cited
Improving the Asymmetric TSP by Considering Graph Structure
Jean-Guillaume Fages, Xavier Lorca
Recent works on cost based relaxations have improved Constraint Programming (CP) models for the Traveling Salesman Problem (TSP). We provide a short survey over solving asymmetric…