The minimum spanning tree problem with conflict constraints and its variations R Zhang, SN Kabadi, AP Punnen Discrete Optimization 8 (2), 191-205, 2011 | 84 | 2011 |
The minimum cost perfect matching problem with conflict pair constraints T Öncan, R Zhang, AP Punnen Computers & Operations Research 40 (4), 920-930, 2013 | 55 | 2013 |
The quadratic minimum spanning tree problem and its variations A Ćustić, R Zhang, AP Punnen Discrete Optimization, 2017 | 16 | 2017 |
Quadratic bottleneck problems AP Punnen, R Zhang Naval Research Logistics (NRL) 58 (2), 153-164, 2011 | 13 | 2011 |
Efficiency and Equity in Healthcare: An Analysis of Resource Allocation Decisions in a Long-Term Home Care Setting R Zhang, MJ Fry, H Krishnan INFOR: Information Systems and Operational Research 53 (3), 97-112, 2015 | 11 | 2015 |
Bottleneck flows in unit capacity networks AP Punnen, R Zhang Information Processing Letters 109 (6), 334-338, 2009 | 10 | 2009 |
Analysis of an approximate greedy algorithm for the maximum edge clique partitioning problem AP Punnen, R Zhang Discrete Optimization 9 (3), 205-208, 2012 | 9 | 2012 |
Quadratic bottleneck knapsack problems R Zhang, AP Punnen Journal of Heuristics 19 (4), 573-589, 2013 | 6 | 2013 |
Quadratic Bottleneck Problems: Algorithms, complexity and related topics. R Zhang Science: Department of Mathematics, 2011 | 4 | 2011 |
Bottleneck flows in networks AP Punnen, R Zhang arXiv preprint arXiv:0712.3858, 2007 | 4 | 2007 |
Bottleneck flows in networks R Zhang ProQuest, 2008 | 2 | 2008 |