On the Performance of Heuristic H MCOP for Multi-Constrained Optimal-Path QoS Routing. - Gang Feng 003 (AINA (2), 2004)

Nonlinear Lagrange relaxation based QoS routing revisited. - Gang Feng 003 (CCNC, 2005)

The revisit of nonlinear Lagrange relaxation based QoS routing. - Gang Feng 003 (ICC, 2005)

Computing delay constrained paths from one source to single/all destinations. - Gang Feng 003 (ICCCN, 2005)

Tightest constraint first: An efficient delay sensitive multicast routing algorithm. - Gang Feng 003 (Int. J. Commun. Syst., 2005)

A multi-constrained multicast QoS routing algorithm. - Gang Feng 003 (Comput. Commun., 2006)

The revisit of QoS routing based on non-linear Lagrange relaxation. - Gang Feng 003 (Int. J. Commun. Syst., 2007)

Delay constrained multicast routing: What can we learn from an exact approach? - Gang Feng 003 (GLOBECOM, 2012)

GRASP-BSMA: A fast algorithm for delay constrained multicast routing. - Gang Feng 003 (ICC, 2012)

A Fast Hybrid ε-Approximation Algorithm for Computing Constrained Shortest Paths. - Gang Feng 003; Turgay Korkmaz (IEEE Commun. Lett., 2013)

A fast Lagrangian relaxation algorithm for finding multi-constrained multiple shortest paths. - Gang Feng 003 (GLOBECOM, 2014)

Finding k shortest simple paths in directed graphs: A node classification algorithm. - Gang Feng 003 (Networks, 2014)

Improving Space Efficiency With Path Length Prediction for Finding k Shortest Simple Paths. - Gang Feng 003 (IEEE Trans. Computers, 2014)

Finding Multi-Constrained Multiple Shortest Paths. - Gang Feng 003; Turgay Korkmaz (IEEE Trans. Computers, 2015)