Associate Professor |
|
Université
Pierre & Marie CURIE (UPMC
)
|
|
||||
|
|
|
|
|||
|
||||||
Teaching
Research
My research interests are about Operations Research and Mathematical Programming with focus on: Combinatorial Optimization, Polyhedral Combinatorics, Mixed Integer Programming and Approximation Algorithms.
This year, I am a PC member of COCOON 2019, ICDCS 2019, WCGO 2019.
Publications
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.
V.H. Nguyen, J.F. Maurras On the linear description of the 3-cycle polytope, EJOR, Vol. 137, pp 310-325, 2002.
V.H. Nguyen Approximation algorithms for metric tree cover and generalized tour and tree covers RAIRO - Operations Research, 41 , pp 305-315, 2007.
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 : “Approximating the minimum tour cover of a digraph”, Algorithms, vol. 4 (2), pp. 75-86 (2011)
V. H. Nguyen, T. T. T. Nguyen (2012) "Approximating the asymmetric profitable tour". International Journal of Mathematics in Operational Research, Vol 4, N°3, pp. 294--301.
V. H. Nguyen (2013)"A primal-dual approximation algorithm for the Asymmetric Prize-Collecting TSP". Journal of Combinatorial Optimization, Vol 25, No. 2, pp. 265-278.
D. Cornaz, V. H. Nguyen (2013) "Konig's edge colouring theorem for all graphs.” Operations Research Letters, Vol 41, No 6, pp.592-596.
J.-F. Maurras, T. H. Nguyen and V. H. Nguyen (2014) "On the linear description of the Huffman trees polytope" Discrete Applied Mathematics, 164: 225-236 .
V.H. Nguyen (2015) “The maximum weight spanning star forest problem on cactus graphs”, Discrete Mathematics, Algorithms and Applications; Vol. 07, N°2.
D.P. Nguyen, M. Minoux, V.H. Nguyen, T. H. Nguyen and R. Sirdey (2016) "Stochastic graph partitioning: quadratic versus SOCP formulations", Optimization Letters, Vol 10, No 7, pp. 1505-1518.
D.P. Nguyen, M. Minoux, V.H. Nguyen, T. H. Nguyen and R. Sirdey (2017) "Improved compact formulations for a wide class of graph partitioning problem in sparse graphs”, Discrete Optimization, Vol. 25, pp. 175-188to appear, http://dx.doi.org/10.1016/j.disopt.2016.05.003
V.H. Nguyen, M. Minoux (2017) “Improved linearized models for Graph Partitioning Problem under Capacity Constraints”, Optimization, Methods and Software, Taylor and Francis, Vol. 32, pp.892-903, <10.1080/10556788.2016.1230209>. <hal-01369135>
V.H. Nguyen, M. Minoux, D.P. Nguyen (2017) “ Reduced-size formulations for metric and cut polyhedra in sparse graphs”, Networks, Vol. 69, pp. 142-150, http://dx.doi.org/10.1002/net.21723
M. Aider, L. Aoudia, M. Baïou, R. Mahjoub and V. H. Nguyen (2018) “On the star forest polytope for trees and cycles”, RAIRO-Operations Research, https://doi.org/10.1051/ro/2018076
J.F. Maurras, V.H. Nguyen A new procedure of facets compositions for the Symmetric Traveling Salesman Polytope, LNCS Springer-Verlag , 2570: 134-146, 2003.
V. H. Nguyen "A complete linear description for the k-path polyhdron". In 5th International Conference in Computer Science, pp. 249--255, Hermès, 2004.
V. H. Nguyen et A. Knippel "On Tree Star Network design". In Proceedings of International Network Optimization Conference INOC 2007, pp. 1—6, 2007.
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, Springer, 2009.
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 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, 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, Th. Nguyen : “Approximating the asymmetric profitable tour”, Proceedings of ISCO 2010 , Electronic Notes in Discrete Mathematics, vol. 36, pp. 907-914, 2010.
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 with a Compact Linear Program". In Advances in Intelligent Systems and Computing, Vol 282, pp. 99--104, Springer-Verlag, 2014.
C. V. Phung, V. H. Nguyen and T. M. T. Nguyen "BEND-aware routing optimization in wireless mesh networks" in 2015 International Conference on Advanced Technologies for Communications (ATC), Ho Chi Minh City, 2015 (link to the paper).
V.H. Nguyen, D.P. Nguyen and M. Minoux "Improved compact formulations for metric and cut polyhedra", in proceedings of INOC 2015, Electronic Notes in Discrete Mathematics, Vol. 52, page 125-132, 2016 (link to the paper).
V.H. Nguyen, P. Weng "An Efficient Primal-Dual Algorithm for Fair Combinatorial Optimization Problems", in proceedings of COCOA 2017, LNCS 10627, page 324-339, 2017.
|