Thi Quynh Trang Vo

According to our database, Thi Quynh Trang Vo authored at least 7 papers between 2022 and 2024.

Collaborative distances:

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

2024

A branch-and-cut algorithm for the balanced traveling salesman problem.

Thi Quynh Trang Vo, Mourad Baïou, Viet Hung Nguyen

J. Comb. Optim., March, 2024

Generalized nash fairness solutions for bi-objective minimization problems.

Minh Hieu Nguyen, Mourad Baïou, Viet Hung Nguyen, Thi Quynh Trang Vo

Networks, January, 2024

Algorithms and Machine Learning for fair and classical combinatorial optimization. (Algorithmes et l'apprentissage automatique pour optimisation combinatoire équitable et classique).

Thi Quynh Trang Vo

PhD thesis, 2024

Proportional Fairness for Combinatorial Optimization.

Minh Hieu Nguyen, Mourad Baïou, Viet Hung Nguyen, Thi Quynh Trang Vo

Proceedings of the LATIN 2024: Theoretical Informatics, 2024

2023

Improving Subtour Elimination Constraint Generation in Branch-and-Cut Algorithms for the TSP with Machine Learning.

Thi Quynh Trang Vo, Mourad Baïou, Viet Hung Nguyen, Paul Weng

Proceedings of the Learning and Intelligent Optimization - 17th International Conference, 2023

2022

A comparative study of linearization methods for Ordered Weighted Average.

Thi Quynh Trang Vo, Mourad Baïou, Viet Hung Nguyen, Paul Weng

Proceedings of the 12th International Workshop on Resilient Networks Design and Modeling, 2022

Nash fairness solutions for balanced TSP.

Minh Hieu Nguyen, Viet Hung Nguyen, Thi Quynh Trang Vo, Mourad Baïou

Proceedings of the 10th International Network Optimization Conference, 2022