Nombre de documents

29

CV de Viet Hung Nguyen


Communication dans un congrès16 documents

  • Viet Hung Nguyen, Michel Minoux, Dang Phuong Nguyen. Improved compact formulations for metric and cut polyhedra. 7th International Network Optimization Conference, INOC 2015, May 2015, Warsaw, Poland. <hal-01214875>
  • Cao Vien Phung, Thi-Mai-Trang Nguyen, Viet Hung Nguyen. Dynamic Coding for TCP Transmission Reliability in Multi-hop Wireless Networks. IEEE International Conference on Advanced Technologies for Communications (ATC), Oct 2015, Ho Chi Minh ville, Vietnam. Proceedings of the IEEE International Conference on Advanced Technologies for Communications (ATC). <hal-01389553>
  • Viet Hung Nguyen, Lamia Aoudia, A. Ridha Mahjoub, M. Aider. On the star forest polytope. International Conference on Control, Decision and Information Technologies (CoDIT), 2014, Nov 2014, Metz, France. IEEE, pp.263-268, <10.1109/CoDIT.2014.6996904>. <hal-01213336>
  • Viet Hung Nguyen. Approximating the Minimum Tour Cover with a Compact Linear Program. The 2nd International Conference on Computer Science, Applied Mathematics and Applications (ICCSAMA 2014), May 2014, Budapest, Hungary. Spinger-Verlag, 282, pp.99-104, Advances in Intelligent Systems and Computing. <10.1007/978-3-319-06569-4_7>. <hal-01212750>
  • Viet Hung Nguyen. The maximum weight spanning star forest problem : polyhedral and algorithmic results on trees and cycles. ROADEF - 15ème congrès annuel de la Société française de recherche opérationnelle et d'aide à la décision, Feb 2014, Bordeaux, France. <hal-00946295>
  • Viet Hung Nguyen, Paul Weng. A primal-dual approach for optimizing Ordered Weighted Average in perfect matching problems. International Conference on Multicriteria Decision Making, Jun 2013, Malaga, Spain. International Conference on Multicriteria Decision Making, pp.88-88. <hal-01340638>
  • Viet Hung Nguyen, Paul Weng. Optimisation non linéaire dans les problèmes de couplage. 14ème Congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF 2013), Feb 2013, Troyes, France. <hal-01215988>
  • Pierre Bonami, Viet Hung Nguyen, Michel Klein, Michel Minoux. On the Solution of a Graph Partitioning Problem under Capacity Constraints. ISCO 2012, Apr 2012, Athens, Greece. Proceedings of ISCO 2012, 7422, pp.285-296, Lecture Notes in Computer Science. <10.1007/978-3-642-32147-4_26>. <hal-01272895>
  • Viet Hung Nguyen. A Primal-Dual Approximation Algorithm for the Asymmetric Prize Collecting TSP. Conference on Combinatorial Optimization and Applications, Dec 2010, Kailua-Kona, HI, United States. Springer-Verlag, Conference on Combinatorial Optimization and Applications, 6508, pp.260-269, Lecture Notes in Computer Science. <10.1007/978-3-642-17458-2_22>. <hal-01291482>
  • Viet Hung Nguyen. Approximation algorithm for the minimum directed tree cover. Conference on Combinatorial Optimization and Applications, Dec 2010, Kailua-Kona, HI, United States. Springer-Verlag, Conference on Combinatorial Optimization and Applications, 6509, pp.144-159, Lecture Notes in Computer Science. <10.1007/978-3-642-17461-2_12>. <hal-01291470>
  • Viet Hung Nguyen. A $2log_2(n)$ approximation algorithm for directed tour cover. Conference on Combinatorial Optimization and Applications, Jun 2009, Huangshan, China. Springer, Conference on Combinatorial Optimization and Applications, 5573, pp.208-218, Lecture Notes in Computer Science. <10.1007/978-3-642-02026-1_19>. <hal-01297379>
  • Viet Hung Nguyen, Arnaud Knippel. On Tree Star Network design. International Network Optimization Conference, Apr 2007, Spa, Belgium. International Network Optimization Conference, pp.1-6. <hal-01311556>
  • Viet Hung Nguyen. Sur le diametre des polytopes des cycles de longueur bornée. Journées Polyèdres et Optimisation Combinatoire, Dec 2006, Paris, France. Journées Polyèdres et Optimisation Combinatoire. <hal-01352597>
  • Viet Hung Nguyen, Michel Minoux. New formulation for the SONET/SDH network design problem. 7ème Congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF 2006), Feb 2006, Lille, France. 7ème Congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF 2006). <hal-01352598>
  • Safia Kedad-Sidhoum, Viet Hung Nguyen. Algorithme de Branch-and-cut pour le problème Anneau-Etoile. ROADEF 2005 - 6ème Congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, Feb 2005, Tours, France. ROADEF 2005 - 6ème Congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, pp.290-291. <hal-01420548>
  • Viet Hung Nguyen. Some properties of the cut polyhedron. Franco-Canadian Workshop on Combinatorial Algorithms, Aug 2005, Hamilton, ON, Canada. Franco-Canadian Workshop on Combinatorial Algorithms. <hal-01420567>

Article dans une revue13 documents

  • Viet Hung Nguyen, Michel Minoux. Improved linearized models for Graph Partitioning Problem under Capacity Constraints. Optimization, Methods and Software, Taylor and Francis, 2016, <10.1080/10556788.2016.1230209>. <hal-01369135>
  • Dang Phuong Nguyen, Michel Minoux, Viet Hung Nguyen, Thanh Hai Nguyen, Renaud Sirdey. Stochastic graph partitioning: quadratic versus SOCP formulations. Optimization Letters, Springer Verlag, 2016, 10 (7), pp.1505-1518. <10.1007/s11590-015-0953-9>. <hal-01362221>
  • Jean-François Maurras, Thanh Hai Nguyen, Viet Hung Nguyen. On the linear description of the Huffman trees polytope. Discrete Applied Mathematics, Elsevier, 2014, 164 (1), pp.225-236. <10.1016/j.dam.2012.05.004>. <hal-01170442>
  • Viet Hung Nguyen. A primal-dual approximation algorithm for the Asymmetric Prize-Collecting TSP. Journal of Combinatorial Optimization, Springer Verlag, 2013, 25 (2), pp.265-278. <10.1007/s10878-012-9501-z>. <hal-01170453>
  • Denis Cornaz, Viet Hung Nguyen. Kőnig’s edge-colouring theorem for all graphs. Operations Research Letters, Elsevier, 2013, 41 (6), pp.592-596. <10.1016/j.orl.2013.08.005>. <hal-01170508>
  • Viet Hung Nguyen, Thi Thu Thuy Nguyen. Approximating the asymmetric profitable tour. International Journal of Mathematics in Operational Research, Inderscience, 2012, 4 (3), pp.294-301. <10.1504/IJMOR.2012.046689>. <hal-01170458>
  • Viet Hung Nguyen. Approximating the minimum tour cover of a digraph. Algorithms, MDPI AG, 2011, 4 (2), pp.75-86. <10.3390/a4020075>. <hal-01170291>
  • Viet Hung Nguyen, Thi Thu Thuy Nguyen. Approximating the asymmetric profitable tour. Electronic Notes in Discrete Mathematics, Elsevier, 2010, 36, pp.907-914. <10.1016/j.endm.2010.05.115>. <hal-01170275>
  • Jean-François Maurras, Thanh Hai Nguyen, Viet Hung Nguyen. On the Convex Hull of Huffman Trees. Electronic Notes in Discrete Mathematics, Elsevier, 2010, 36, pp.1009-1016. <10.1016/j.endm.2010.05.128>. <hal-01170335>
  • Safia Kedad-Sidhoum, Viet Hung Nguyen. An Exact Algorithm for Solving the Ring Star Problem. Optimization, Taylor & Francis, 2010, 59 (1), pp.125-140. <10.1080/02331930903500332>. <hal-01170329>
  • Viet Hung Nguyen. Approximation algorithms for metric tree cover and generalized tree and tour covers. RAIRO - Operations Research, EDP Sciences, 2007, 41 (3), pp.305-315. <10.1051/ro:2007025>. <hal-01170206>
  • Viet Hung Nguyen, Jean-François Maurras. On the linear description of the 3-cycle polytope. European Journal of Operational Research., 2002, 137 (2), pp.310-325. <10.1016/S0377-2217(01)00212-0>. <hal-01149464>
  • Viet Hung Nguyen, Jean-François Maurras. On the linear description of the k-cycle polytope. International Transactions in Operational Research, Wiley, 2001, 8 (6), pp.673-692. <10.1111/1475-3995.t01-1-00331>. <hal-01149566>