San Tu Pham

According to our database, San Tu Pham authored at least 8 papers between 2016 and 2025.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2025

Deep reinforcement learning for the real-time inventory rack storage assignment and replenishment problem.

Sander Teck, Tu-San Pham, Louis-Martin Rousseau, Pieter Vansteenwegen

Eur. J. Oper. Res., 2025

2023

A Prediction-Based Approach for Online Dynamic Appointment Scheduling: A Case Study in Radiotherapy Treatment.

Tu-San Pham, Antoine Legrain, Patrick De Causmaecker, Louis-Martin Rousseau

INFORMS J. Comput., 2023

2021

A prediction-based approach for online dynamic radiotherapy scheduling.

Tu-San Pham, Antoine Legrain, Patrick De Causmaecker, Louis-Martin Rousseau

CoRR, 2021

2020

The intermittent travelling salesman problem.

Tu-San Pham, Pieter Leyman, Patrick De Causmaecker

Int. Trans. Oper. Res., 2020

2019

Declarative Local Search for Predicate Logic.

Tu-San Pham, Jo Devriendt, Patrick De Causmaecker

Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2019

2018

Solving the Steiner Tree Problem in graphs with Variable Neighborhood Descent.

Matthieu De Laere, San Tu Pham, Patrick De Causmaecker

CoRR, 2018

2017

The Intermittent Traveling Salesman Problem with Different Temperature Profiles: Greedy or not?

Pieter Leyman, San Tu Pham, Patrick De Causmaecker

CoRR, 2017

2016

A MIP Backend for the IDP System.

San Tu Pham, Jo Devriendt, Maurice Bruynooghe, Patrick De Causmaecker

CoRR, 2016