Viet Hung Nguyen

Available identifiers

zbMath Open nguyen.viet-hungWikidataQ83253608 ScholiaQ83253608MaRDI QIDQ325410

List of research outcomes

Publication	Date of Publication	Type
A branch-and-cut algorithm for the balanced traveling salesman problem	2024-03-04	Paper
Generalized nash fairness solutions for bi‐objective minimization problems	2024-01-18	Paper
Nash balanced assignment problem	2023-08-03	Paper
Linear size MIP formulation of max-cut: new properties, links with cycle inequalities and computational results	2021-07-08	Paper
On the star forest polytope for trees and cycles	2020-02-07	Paper
Approximating the minimum tour cover of a digraph	2019-03-26	Paper
Reduced‐size formulations for metric and cut polyhedra in sparse graphs	2018-06-13	Paper
Improved compact formulations for a wide class of graph partitioning problems in sparse graphs	2018-05-24	Paper
An efficient primal-dual algorithm for fair combinatorial optimization problems	2018-02-26	Paper
Improved linearized models for graph partitioning problem under capacity constraints	2017-11-24	Paper
Stochastic graph partitioning: quadratic versus SOCP formulations	2016-10-27	Paper
Improved compact formulations for metric and cut polyhedra	2016-10-18	Paper
https://portal.mardi4nfdi.de/entity/Q2816128	2016-07-01	Paper
Approximating the Minimum Tour Cover with a Compact Linear Program	2015-10-14	Paper
On the linear description of the Huffman trees polytope	2015-09-22	Paper
The maximum weight spanning star forest problem on cactus graphs	2015-07-01	Paper
Kőnig's edge-colouring theorem for all graphs	2014-05-15	Paper
https://portal.mardi4nfdi.de/entity/Q2861509	2013-11-08	Paper
https://portal.mardi4nfdi.de/entity/Q2861523	2013-11-08	Paper
A primal-dual approximation algorithm for the asymmetric prize-collecting TSP	2013-03-25	Paper
On the exit distribution of partially reflected Brownian motion in planar domains	2013-02-15	Paper
Approximating the asymmetric profitable tour	2012-11-16	Paper
On the Solution of a Graph Partitioning Problem under Capacity Constraints	2012-11-02	Paper
Approximation algorithms for metric tree cover and generalized tour and tree covers	2011-06-01	Paper
Approximation Algorithm for the Minimum Directed Tree Cover	2011-01-10	Paper
A Primal-Dual Approximation Algorithm for the Asymmetric Prize-Collecting TSP	2011-01-08	Paper
An exact algorithm for solving the ring star problem	2010-04-21	Paper
A 2log2(n)-Approximation Algorithm for Directed Tour Cover	2009-07-07	Paper
https://portal.mardi4nfdi.de/entity/Q4414643	2003-07-25	Paper
On the Linear Description of the k-cycle Polytope	2002-09-11	Paper
On the linear description of the 3-cycle polytope	2002-06-16	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Viet Hung Nguyen