NGUYEN Viet Hung

Associate Professor [HDR]
Team : DECISION
Departure date : 08/31/2019
https://lip6.fr/Hung.Nguyen

Departure date : 08/31/2019

3 PhD graduated 2010 - 2022

2001-2024 Publications

All Journal articles Communications Thesis

2024
- H. Ha, V. Nguyen, A. Ta : “Solving Edge-Weighted Maximum Clique Problem with DCA Warm-Start Quantum Approximate Optimization Algorithm”, Metaheuristics International Conference (MIC 2024), vol. 14753, Lecture Notes in Computer Science, Lorient, France, pp. 246-261, (Springer Nature Switzerland) (2024)
- H. Ha, V. Nguyen, A. Ta : “Solving Quadratic Knapsack Problem with Biased Quantum State Optimization Algorithm”, Metaheuristics International Conference (MIC 2024), vol. 14753, Lecture Notes in Computer Science, Lorient, France, pp. 268-280, (Springer Nature Switzerland) (2024)
2021
- D. Wu, V. Nguyen, M. Minoux, 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), Hanoi, Viet Nam, pp. 1-6, (IEEE) (2021)
- D. Wu, V. Nguyen, M. Minoux, H. Tran : “Optimal deterministic and robust selection of electricity contracts”, Journal of Global Optimization, (Springer Verlag) (2021)
2020
- V. Nguyen, M. Minoux : “Linear size MIP formulation of Max-Cut: new properties, links with cycle inequalities and computational results”, Optimization Letters, (Springer Verlag) (2020)
2019
- M. Aïder, L. Aoudia, M. Baïou, A. Ridha Mahjoub, V. Nguyen : “On the star forest polytope for trees and cycles”, RAIRO - Operations Research, vol. 53 (5), pp. 1763-1773, (EDP Sciences) (2019)
2017
- V. Nguyen, P. Weng : “An Efficient Primal-Dual Algorithm for Fair Combinatorial Optimization Problems”, The 11^th Annual International Conference on Combinatorial Optimization and Applications (COCOA'17), Shanghai, China (2017)
- D. Nguyen, M. Minoux, V. Nguyen, Th. Nguyen, R. Sirdey : “Improved compact formulations for a wide class of graph partitioning problems in sparse graphs”, Discrete Optimization, vol. 25, pp. 175-188, (Elsevier) (2017)
- V. Nguyen, M. Minoux, D. Nguyen : “Reduced-size formulations for metric and cut polyhedra in sparse graphs”, Networks, vol. 69 (1), pp. 142-150, (Wiley) (2017)
- V. Nguyen, M. Minoux : “Improved linearized models for Graph Partitioning Problem under Capacity Constraints”, Optimization Methods and Software, vol. 32 (4), pp. 892-903, (Taylor & Francis) (2017)
2016
- V. Nguyen : “Contributions à des formulations naturelles et étendues en Optimisation Combinatoire - Applications à la conception des algorithmes exacts et approchés”, habilitation, phd defence 12/07/2016 (2016)
- D. Nguyen, M. Minoux, V. Nguyen, Th. Nguyen, R. Sirdey : “Stochastic graph partitioning: quadratic versus SOCP formulations”, Optimization Letters, vol. 10 (7), pp. 1505–1518, (Springer Verlag) (2016)
- V. Nguyen, M. Minoux, D. Nguyen : “Improved compact formulations for metric and cut polyhedra”, Electronic Notes in Discrete Mathematics, vol. 52, pp. 125-132, (Elsevier) (2016)
2015
- C. Phung, Th.‑M.‑T. Nguyen, V. Nguyen : “Dynamic Coding for TCP Transmission Reliability in Multi-hop Wireless Networks”, IEEE International Conference on Advanced Technologies for Communications (ATC), Proceedings of the IEEE International Conference on Advanced Technologies for Communications (ATC), Ho Chi Minh ville, Viet Nam (2015)
- V. Nguyen : “The maximum weight spanning star forest problem on cactus graphs”, Discrete Mathematics, Algorithms and Applications, vol. 07 (02), pp. 1550018, (World Scientific Publishing) (2015)
- V. Nguyen, M. Minoux, D. Nguyen : “Improved compact formulations for metric and cut polyhedra”, 7^th International Network Optimization Conference, INOC 2015, Warsaw, Poland (2015)
2014
- V. Nguyen, L. Aoudia, A. Ridha Mahjoub, M. Aider : “On the star forest polytope”, International Conference on Control, Decision and Information Technologies (CoDIT), 2014, Metz, France, pp. 263-268, (IEEE) (2014)
- V. Nguyen : “Approximating the Minimum Tour Cover with a Compact Linear Program”, Proceedings of the 2^nd International Conference on Computer Science, Applied Mathematics and Applications (ICCSAMA 2014), vol. 282, Advances in Intelligent Systems and Computing, Budapest, Hungary, pp. 99-104, (Spinger-Verlag) (2014)
- V. Nguyen : “The maximum weight spanning star forest problem : polyhedral and algorithmic results on trees and cycles”, ROADEF - 15^e congrès annuel de la Société française de recherche opérationnelle et d'aide à la décision, Bordeaux, France (2014)
- J.‑F. Maurras, Th. Nguyen, V. Nguyen : “On the linear description of the Huffman trees polytope”, Discrete Applied Mathematics, vol. 164 (1), pp. 225-236, (Elsevier) (2014)
2013
- D. Cornaz, V. Nguyen : “Kőnig’s edge-colouring theorem for all graphs”, Operations Research Letters, vol. 41 (6), pp. 592-596, (Elsevier) (2013)
- V. Nguyen, P. Weng : “A primal-dual approach for optimizing Ordered Weighted Average in perfect matching problems”, International Conference on Multicriteria Decision Making, Malaga, Spain, pp. 88-88 (2013)
- V. Nguyen, P. Weng : “Optimisation non linéaire dans les problèmes de couplage”, 14^e Congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF 2013), Troyes, France (2013)
- V. Nguyen : “A primal-dual approximation algorithm for the Asymmetric Prize-Collecting TSP”, Journal of Combinatorial Optimization, vol. 25 (2), pp. 265-278, (Springer Verlag) (2013)
2012
- P. Bonami, V. Nguyen, M. Klein, M. Minoux : “On the Solution of a Graph Partitioning Problem under Capacity Constraints”, Proceedings of ISCO 2012, vol. 7422, Lecture Notes in Computer Science, Athens, Greece, pp. 285-296 (2012)
- V. Nguyen, Th. Nguyen : “Approximating the asymmetric profitable tour”, International Journal of Mathematics in Operational Research, vol. 4 (3), pp. 294-301, (Inderscience) (2012)
2011
- V. Nguyen : “Approximating the minimum tour cover of a digraph”, Algorithms, vol. 4 (2), pp. 75-86, (MDPI) (2011)
2010
- V. Nguyen : “A Primal-Dual Approximation Algorithm for the Asymmetric Prize Collecting TSP”, Conference on Combinatorial Optimization and Applications, vol. 6508, Lecture Notes in Computer Science, Kailua-Kona, HI, United States, pp. 260-269, (Springer-Verlag) (2010)
- V. Nguyen : “Approximation algorithm for the minimum directed tree cover”, Conference on Combinatorial Optimization and Applications, vol. 6509, Lecture Notes in Computer Science, Kailua-Kona, HI, United States, pp. 144-159, (Springer-Verlag) (2010)
- V. Nguyen, Th. Nguyen : “Approximating the asymmetric profitable tour”, Electronic Notes in Discrete Mathematics, vol. 36, pp. 907-914, (Elsevier) (2010)
- J.‑F. Maurras, Th. Nguyen, V. Nguyen : “On the Convex Hull of Huffman Trees”, Electronic Notes in Discrete Mathematics, vol. 36, pp. 1009-1016, (Elsevier) (2010)
- S. Kedad‑Sidhoum, V. Nguyen : “An Exact Algorithm for Solving the Ring Star Problem”, Optimization, vol. 59 (1), pp. 125-140, (Taylor & Francis) (2010)
2009
- V. Nguyen : “A $2log_2(n)$ approximation algorithm for directed tour cover”, Conference on Combinatorial Optimization and Applications, vol. 5573, Lecture Notes in Computer Science, Huangshan, China, pp. 208-218, (Springer) (2009)
2007
- V. Nguyen : “Approximation algorithms for metric tree cover and generalized tree and tour covers”, RAIRO - Operations Research, vol. 41 (3), pp. 305-315, (EDP Sciences) (2007)
- V. Nguyen, A. Knippel : “On Tree Star Network design”, International Network Optimization Conference, Spa, Belgium, pp. 1-6 (2007)
2006
- V. Nguyen : “Sur le diametre des polytopes des cycles de longueur bornée”, Journées Polyèdres et Optimisation Combinatoire, Paris, France (2006)
- V. Nguyen, M. Minoux : “New formulation for the SONET/SDH network design problem”, 7^e Congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF 2006), Lille, France (2006)
2005
- V. Nguyen : “Some properties of the cut polyhedron”, Franco-Canadian Workshop on Combinatorial Algorithms, Hamilton, ON, Canada (2005)
- S. Kedad‑Sidhoum, V. Nguyen : “Algorithme de Branch-and-cut pour le problème Anneau-Etoile”, ROADEF 2005 - 6^e Congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, Tours, France, pp. 290-291 (2005)
2004
- V. Nguyen : “A complete description for the k-cycle polyhedron”, MCO 2004 - International Conference in Modelling, Computation and Optimization in Information Systems and Management Sciences, Metz, France, pp. 249-256 (2004)
- V. Nguyen : “A complete linear description for the k-path polyhdron”, 5^th International Conference in Computer Science, Metz, France, pp. 249-255, (Hermès) (2004)
2003
- V. Nguyen : “Une description linéaire complète du polyèdre des chemins de longueur bornée”, Journées Polyèdre et Optimisation Combinatoire, Clermont-Ferrand, France (2003)
- V. Nguyen : “Description linéaire du polyèdre des coupes”, 5^e Congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF 2003), Avignon, France (2003)
- V. Nguyen : “Facettes du dominant des coupes”, 5^e Congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF 2003), Avignon, France (2003)
- J.‑F. Maurras, V. Nguyen : “A procedure of facet composition for the symmetric Traveling Salesman Polytope”, 5^th Aussois Workshop on Combinatorial Optimization, vol. 2570, Lecture Notes in Computer Science, Aussois, France, pp. 134-146, (Springer) (2003)
2002
- V. Nguyen, J.‑F. Maurras : “On the linear description of the 3-cycle polytope”, European Journal of Operational Research, vol. 137 (2), pp. 310-325, (Elsevier) (2002)
2001
- V. Nguyen, J.‑F. Maurras : “On the linear description of the k-cycle polytope”, International Transactions in Operational Research, vol. 8 (6), pp. 673-692, (Wiley) (2001)