1 citations · 1 across the 3 of their papers we have counts for
3 papers
Solving the Steiner Tree Problem in graphs with Variable Neighborhood Descent
Matthieu De Laere, San Tu Pham, Patrick De Causmaecker
The Steiner Tree Problem (STP) in graphs is an important problem with various applications in many areas such as design of integrated circuits, evolution theory, networking, etc. I…
The Intermittent Traveling Salesman Problem with Different Temperature Profiles: Greedy or not?
Pieter Leyman, San Tu Pham, Patrick De Causmaecker
In this research, we discuss the intermittent traveling salesman problem (ITSP), which extends the traditional traveling salesman problem (TSP) by imposing temperature restrictions…
A MIP Backend for the IDP System
San Pham, Jo Devriendt, Maurice Bruynooghe +1
The IDP knowledge base system currently uses MiniSAT(ID) as its backend Constraint Programming (CP) solver. A few similar systems have used a Mixed Integer Programming (MIP) solver…