The following pages link to Viet Hung Nguyen (Q325410):
Displaying 32 items.
- Improved compact formulations for metric and cut polyhedra (Q325413) (← links)
- Stochastic graph partitioning: quadratic versus SOCP formulations (Q331990) (← links)
- On the linear description of the Huffman trees polytope (Q496665) (← links)
- On the linear description of the 3-cycle polytope (Q1600839) (← links)
- An efficient primal-dual algorithm for fair combinatorial optimization problems (Q1699796) (← links)
- Approximating the minimum tour cover of a digraph (Q1736480) (← links)
- Improved compact formulations for a wide class of graph partitioning problems in sparse graphs (Q1751240) (← links)
- Approximating the asymmetric profitable tour (Q1758879) (← links)
- On the exit distribution of partially reflected Brownian motion in planar domains (Q1935448) (← links)
- A primal-dual approximation algorithm for the asymmetric prize-collecting TSP (Q1944387) (← links)
- Linear size MIP formulation of max-cut: new properties, links with cycle inequalities and computational results (Q2039061) (← links)
- Kőnig's edge-colouring theorem for all graphs (Q2450735) (← links)
- (Q2816128) (← links)
- (Q2861509) (← links)
- (Q2861523) (← links)
- Approximation algorithms for metric tree cover and generalized tour and tree covers (Q3004205) (← links)
- A Primal-Dual Approximation Algorithm for the Asymmetric Prize-Collecting TSP (Q3066163) (← links)
- Approximation Algorithm for the Minimum Directed Tree Cover (Q3066452) (← links)
- On the Linear Description of the k-cycle Polytope (Q3146124) (← links)
- On the Solution of a Graph Partitioning Problem under Capacity Constraints (Q3167633) (← links)
- Approximating the Minimum Tour Cover with a Compact Linear Program (Q3192959) (← links)
- An exact algorithm for solving the ring star problem (Q3553757) (← links)
- A 2log2(n)-Approximation Algorithm for Directed Tour Cover (Q3637067) (← links)
- (Q4414643) (← links)
- Reduced‐size formulations for metric and cut polyhedra in sparse graphs (Q4565778) (← links)
- Improved linearized models for graph partitioning problem under capacity constraints (Q4594838) (← links)
- On the star forest polytope for trees and cycles (Q5214329) (← links)
- The maximum weight spanning star forest problem on cactus graphs (Q5261052) (← links)
- A branch-and-cut algorithm for the balanced traveling salesman problem (Q6123381) (← links)
- Generalized nash fairness solutions for bi‐objective minimization problems (Q6180043) (← links)
- Proportional fairness for combinatorial optimization (Q6547965) (← links)
- Experimental data for "Localization of lattice dynamics in low-angle twisted bilayer graphene" (Q6716057) (← links)
