Viet Hung Nguyen

Research

Research keywords

Combinatorial Optimization, Integer Programming, Polyhedral Combinatorics, Graph Algorithms, Network Optimization (transportation, telecommunications), approximation algorithms and heuristics, Stochastic Combinatorial Optimization, Fair Optimization, Multiobjective Optimization, Machine Learning for Combinatorial Optimization, Reinforcement Learning, Statistical Regression, Quantum Optimization, etc.

Publications

• P. N. Ha Huy, V. H. Nguyen, A. S. Ta, Difference of Convex Algorithm for Warm-Start Quantum Approximate Optimization Algorithm . Adv Quantum Technol. 2025, 8, 2400253.
• T.Q.T. Vo, M. Baiou , V.H. Nguyen, P. Weng Learning to Cut Generation in Branch-and-Cut Algorithms for Combinatorial Optimization . ACM Trans. Evol. Learn. Optim. 5(3 ): 20: 1- 20: 27 (2025)
• M.H. Nguyen, M. Baiou , V.H. Nguyen. Generalized Nash Fairness Solutions for Bi-Objective Discrete Optimization : Theory and Algorithms . Discrete Applied Mathematics 365: 71-90 (2025)
• T.L. Nguyen, V.H. Nguyen. Polynomial time algorithm for a Bi-objective Spanning Star Forest Problem on Trees, COCOA 2025
• T.L. Nguyen, V.H. Nguyen. M.H. Nguyen, T.V.T. Vu. On the star forest polytope for 4-cactus graphs, MCO 2025
• T.Q.T. Vo, M. Baiou , V.H. Nguyen. A branch -and- cut algorithm for the balanced traveling salesman problem . Journal of Combinatorial Optimization 47, 4 (2024).
• M.H. Nguyen, M. Baiou , V.H. Nguyen, T.Q.T. Vo. Generalized Nash Fairness solutions for Bi-Objective Minimization Problems . Networks 83 , 83–99 (2024)
• T.L. Nguyen, V.H. Nguyen, M.H. Nguyen, T.V.T. Vu. On the Kalai- Smorodinsky Solutions for Bi-objective Spanning Tree Problem . AAIM (2) 2024: 86-98
• H.P.N. Ha, V. H. Nguyen, A. S. Ta. Solving Edge- Weighted Maximum Clique Problem with DCA Warm-Start Quantum Approximate Optimization Algorithm . MIC (1) 2024: 246-261
• H.P.N Ha, V. H. Nguyen, A.S. Ta. Solving Quadratic Knapsack Problem with Biased Quantum State Optimization Algorithm . MIC (1) 2024: 268-280
• H.P.N Ha, V.H. Nguyen, A.S Ta. Solving Maximum Cut Problem with Multi-objective Enhance Quantum Approximate Optimization Algorithm . ICCSA (Workshops 11) 2024: 244-252
• M. H. Nguyen, M. Baiou , V. H. Nguyen and T. Q. T. Vo. Proportional Fairness for Combinatorial Optimization . LATIN 2024
• H.H.P. Nguyen, A. S. Ta, Viet Hung Nguyen. Improve the Quantum Approximate Optimization Algorithm with Genetic Algorithm . SoICT 2023: 655-662
• C. T. Nguyen, J-P. Gayon, V. H. Nguyen, A. Quilliot , A.S. Ta. Pickup and Delivery Problem with Cooperative Robots. SoICT 2023: 695-700
• T.Q.T Vo, M. Baiou , V.H. Nguyen, P. Weng. Improving Subtour Elimination Constraint Generation in Branch-and-Cut Algorithms for the TSP with Machine Learning in proceedings of Learning and Intelligent Optimization Conference (LION17), LNCS 14286, pp 537–551, 2023.
• D. Wu, V.H. Nguyen, M. Minoux , H. Tran . Optimal deterministic and robust selection of electricity contracts . J Glob Optim 82 : 993–1013 (2022)
• T.Q.T. Vo, M. Baïou , V. H. Nguyen, P. Weng. A comparative study of linearization methods for Ordered Weighted Average . RNDM 2022: 1-7
• M. H.Nguyen , M. Baiou , V. H. Nguyen. Nash balanced assignment problem . 7th International Symposium on Combinatorial Optimization (ISCO), May 2022
• M.H. Nguyen, Mourad Baiou, V.H. Nguyen and T.Q.T. Vo, Nash fairness solution for balanced TSP, International Network Optimization Conference , June 2022 (INOC2022)
• V.H. Nguyen, M. Minoux : "Linear size MIP formulation of Max- Cut: new properties , links with cycle inequalities and computational results ", Optim. Lett. 15(4 ): 1041-1060 (2021)
• D. Wu, V. H. Nguyen, M. Minoux and H. Tran , "An integer programming model for minimizing energy cost in water distribution system using trigger levels with additional time slots," 2021 RIVF International Conference on Computing and Communication Technologies (RIVF), 2021, pp. 1-6, doi: 10.1109/RIVF51545.2021.9642073. Best paper award .
• M. Aider, L. Aoudia , M. Baïou , R. Mahjoub and V.H. Nguyen : "On the star forest polytope for trees and cycles", RAIRO - Operations Research , (2019).
• V.H. Nguyen, M. Minoux and D.P. Nguyen : " Reduced -Size Formulations for Metric and Cut Polyhedra in Sparse Graphs", Networks, vol. 169, pp. 142-150 (2017).
• V.H. Nguyen, M. Minoux : " Improved linearized models for Graph Partitioning Problem under Capacity Constraints ", Optimization Methods and Software, vol. 32, pp.892-903 (2017).
• D.P. Nguyen, M. Minoux , V.H. Nguyen, T.H. Nguyen and R. Sirdey : " Improved compact formulations for graph partitioning in sparse graphs", Discrete Optimization , vol. 25, pp. 175-188 (2017).
• V.H. Nguyen, P. Weng : "An Efficient Primal-Dual Algorithm for Fair Combinatorial Optimization Problems ", to appear in COCOA 2017 proceedings . Lecture Notes in Computer Science, Springer-Verlag .
• D.P. Nguyen, M. Minoux , V.H. Nguyen, T.H. Nguyen and R. Sirdey : " Stochastic Graph Partitioning : Quadratic versus SOCP formulations", Optimization Letters, vol. 10(7), pp. 1505-1518 (2016).
• V.H. Nguyen, M. Minoux , D.P. Nguyen : “ Improved compact formulations for metric and cut polyhedra ”, Electronic Notes in Discrete Mathematics , Vol. 52, pp. 125-132 (2016).
• V.H. Nguyen : "The maximum weight spanning star forest problem on cactus graphs", Discrete Mathematics , Algorithms and Applications, vol. 7 (2), pp. 1550018 (2015)
• C.V. Phung, V.H. Nguyen and T.M.T. Nguyen : "BEND- aware routing optimization in wireless mesh networks, " ) , International Conference on Advanced Technologies for Communications (ATC), Ho Chi Minh City, 2015, pp. 302-307 (2015).
• J.-F. Maurras, T. H. Nguyen and V. H. Nguyen : "On the linear description of the Huffman trees polytope" Discrete Applied Mathematics , Vol. 164: 225-236 (2014).
• V. H. Nguyen : " Approximating the Minimum Tour Cover with a Compact Linear Program". In Advances in Intelligent Systems and Computing , Vol 282, pp. 99–104, Springer-Verlag , (2014). doi: 10.1109/CoDIT.2014.6996904
• L. Aoudia , V. H. Nguyen, A. R. Mahjoub and M. Aider : "On the star forest polytope," Control, Decision and Information Technologies (CoDIT), 2014 International Conference on, Metz, 2014, pp. 263-268.
• D. Cornaz , V. H. Nguyen : " Konig's edge colouring theorem for all graphs.” Operations Research Letters, Vol 41, No 6, pp.592-596 (2013).
• V. H. Nguyen : "A primal-dual approximation algorithm for the Asymmetric Prize-Collecting TSP", J. Comb. Optim. Vol. 25(2), pp. 265-278 (2013).
• V. H. Nguyen and T. T. T. Nguyen : " Approximating the asymmetric profitable tour". International Journal of Mathematics in Operational Research , Vol 4(3), pp. 294—301, (2012).
• P. Bonami, V. H. Nguyen, M. Klein and M. Minoux : "On the Solution of a Graph Partitioning Problem under Capacity Constraints ". In International Symposium on Combinatorial Optimization , Lecture Notes in Computer Science, Vol 7422, pp. 285-296 Springer-Verlag , (2012).
• V.H. Nguyen : " Approximating the minimum tour cover of a digraph ", Algorithms , vol. 4 (2), pp. 75-86, (2011).
• S. Kedad Sidhoum, V.H. Nguyen : "An Exact Algorithm for Solving the Ring Star Problem ", Optimization , vol. 59 1, pp. 125-140, (2010).
• V.H. Nguyen, Th. Nguyen : “ Approximating the asymmetric profitable tour”, Proceedings of ISCO 2010 , Electronic Notes in Discrete Mathematics , vol. 36, pp. 907-914, (2010).
• V.H. Nguyen, T.H. Nguyen, J. F. Maurras : “On the Convex Hull of Huffman Trees”, Proceedings of ISCO 2010, Electronic Notes in Discrete Mathematics , vol. 36, pp. 1009-1016, (2010).
• V. H. Nguyen : "A Primal-Dual Approximation Algorithm for the Asymmetric Prize Collecting TSP". In International Conference on Combinatorial Optimization and Applications, Lecture Notes in Computer Science, Vol 6508, pp. 260–269, Springer-Verlag , (2010).
• V. H. Nguyen : "Approximation algorithm for the minimum directed tree cover". In International Conference on Combinatorial Optimization and Applications, Lecture Notes in Computer Science, Vol 6509, pp. 144–159, Springer-Verlag , (2010).
• V. H. Nguyen : "A 2log(n) approximation algorithm for directed tour cover". In International Conference on Combinatorial Optimization and Applications, Lecture Notes in Computer Science, Vol 5573, pp. 208–218, (2009).
• V.H. Nguyen : "Approximation algorithms for metric tree cover and generalized tour and tree covers " RAIRO - Operations Research , vol. 41 , pp 305-315, (2007).
• V. H. Nguyen, A. Knippel : "On Tree Star Network design". In International Network Optimization Conference , pp. 1—6, (2007).
• V. H. Nguyen : "A complete linear description for the k- path polyhedron ". In 5th International Conference in Computer Science, pp. 249–255, Hermès, (2004).
• J.F. Maurras, V.H. Nguyen : “A new procedure of facets compositions for the Symmetric Traveling Salesman Polytope”, LNCS Springer-Verlag , Vol. 2570, pp. 134-146, (2003).
• V.H. Nguyen, J.F. Maurras : "On the linear description of the 3-cycle polytope", EJOR, Vol. 137, pp 310-325, (2002).
• J.F. Maurras, V.H. Nguyen : "On the linear description of the k-cycle polytope", International Transactions on Operational Research , Vol. 8 (6), pp 673-692, (2001).