Optimal placement of wavelength converters in WDM optical networks with a general tree of rings topology. - Guangting Chen; Guo-jun Li; Guoliang Xue (ICCCN, 2000)

A constrained minimum spanning tree problem. - Guangting Chen; Guochuan Zhang (Comput. Oper. Res., 2000)

An FPTAS for Weight-Constrained Steiner Trees in Series-Parallel Graphs. - Guangting Chen; Guoliang Xue (COCOON, 2001)

Source-waiting QoS routing in networks with advanced resource reservations. - Guoliang Xue; Guo-jun Li; Guangting Chen; Xuedao Chu (ICC, 2001)

K-pair delay constrained minimum cost routing in undirected networks. - Guangting Chen; Guoliang Xue (SODA, 2001)

Constrained Steiner trees in Halin graphs. - Guangting Chen; Rainer E. Burkard (RAIRO Oper. Res., 2003)

A PTAS for weight constrained Steiner trees in series-parallel graphs. - Guangting Chen; Guoliang Xue (Theor. Comput. Sci., 2003)

The Web Proxy Location Problem in the Tree Networks. - Guangting Chen; Gu Zhang; Wei Ding 006 (CCCT (1), 2004)

The web proxy location problem in general tree of rings networks. - Guangting Chen; Gu Zhang; Rainer E. Burkard (J. Comb. Optim., 2006)

Combined projected gradient algorithm for linear programming. - Wei Li 158; Ping-Qi Pan; Guangting Chen (Optim. Methods Softw., 2006)

Delay Constrained Proxy Location Problems on Tree Graphs. - Guangting Chen; Sunqin Huang; Jianfang Yang (International Conference on Internet Computing, 2008)

On the convergence of augmented Lagrangian methods for nonlinear semidefinite programming. - Hezhi Luo; Huixian Wu; Guangting Chen (J. Glob. Optim., 2012)

Approximation algorithms for parallel open shop scheduling. - Yong Chen 002; An Zhang 001; Guangting Chen; Jianming Dong (Inf. Process. Lett., 2013)

On the 2-MRS Problem in a Tree with Unreliable Edges. - Wei Ding 006; Yu Zhou; Guangting Chen; Hongfa Wang; Guangming Wang (J. Appl. Math., 2013)

Relay node placement in two-tiered wireless sensor networks with base stations. - Guangting Chen; Suhui Cui (J. Comb. Optim., 2013)

Preface. - Guangting Chen; Guohui Lin; Zhiyi Tan 001 (J. Comb. Optim., 2013)

An Edge-Turbulence Algorithm for the 2-MRS Problem on Trees with Unreliable Edges. - Yu Zhou; Wei Ding 006; Guangming Wang; Guangting Chen (Asia Pac. J. Oper. Res., 2015)

Scheduling jobs with equal processing times and a single server on parallel identical machines. - An Zhang 001; Hongjun Wang; Yong Chen 002; Guangting Chen (Discret. Appl. Math., 2016)

Combinatorial Approximation Algorithms for Spectrum Assignment Problem in Chain and Ring Networks. - Guangting Chen; Lei Zhang; An Zhang 001; Yong Chen 002 (COCOA (1), 2017)

Approximate the scheduling of quay cranes with non-crossing constraints. - An Zhang 001; Wenshuai Zhang; Yong Chen 002; Guangting Chen; Xufeng Chen (Eur. J. Oper. Res., 2017)

Better permutations for the single-processor scheduling with time restrictions. - An Zhang 001; Feilang Ye; Yong Chen 002; Guangting Chen (Optim. Lett., 2017)

Approximation Algorithms for Two-Machine Flow-Shop Scheduling with a Conflict Graph. - Yinhui Cai; Guangting Chen; Yong Chen 002; Randy Goebel; Guohui Lin; Longcheng Liu; An Zhang 001 (COCOON, 2018)

On the NP-hardness of scheduling with time restrictions. - An Zhang 001; Yong Chen 002; Lin Chen 009; Guangting Chen (Discret. Optim., 2018)

On the largest matching roots of graphs with a given number of pendent vertices. - Hailiang Zhang; Guangting Chen; Guanglong Yu (Discret. Appl. Math., 2019)

Improved Hardness and Approximation Results for Single Allocation Hub Location. - Xing Wang; Guangting Chen; Yong Chen 002; Guohui Lin; Yonghao Wang; An Zhang 001 (AAIM, 2020)

Approximation Algorithms for Two Parallel Dedicated Machine Scheduling with Conflict Constraints. - An Zhang 001; Liang Zhang; Yong Chen 002; Guangting Chen; Xing Wang (COCOA, 2021)

A (32+ε)-approximation algorithm for scheduling on two parallel machines with job delivery coordination. - Yong Chen 002; An Zhang 001; Zhiyi Tan 001; Ying Xue; Guangting Chen (J. Oper. Res. Soc., 2021)

An improved algorithm for a two-stage production scheduling problem with an outsourcing option. - Xiaojuan Jiang; An Zhang 001; Yong Chen 002; Guangting Chen; Kangbok Lee (Theor. Comput. Sci., 2021)

Improved hardness and approximation results for single allocation hub location problems. - Xing Wang; Guangting Chen; Yong Chen 002; Guohui Lin; Yonghao Wang; An Zhang 001 (Theor. Comput. Sci., 2021)

Approximation algorithms for the maximally balanced connected graph tripartition problem. - Guangting Chen; Yong Chen 002; Zhi-Zhong Chen; Guohui Lin; Tian Liu 001; An Zhang 001 (J. Comb. Optim., 2022)

Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph. - Yong Chen 002; Yinhui Cai; Longcheng Liu; Guangting Chen; Randy Goebel; Guohui Lin; Bing Su 002; An Zhang 001 (J. Comb. Optim., 2022)

Complexity and approximation algorithms for two parallel dedicated machine scheduling with conflict constraints. - An Zhang 001; Liang Zhang; Yong Chen 002; Guangting Chen; Xing Wang (Theor. Comput. Sci., 2023)

An improved algorithm for parallel machine scheduling under additional resource constraints. - An Zhang 001; Tan Zhen; Yong Chen 002; Guangting Chen (Optim. Lett., 2023)

Scheduling double-track gantry cranes to minimize the overall loading/ unloading time. - Jie Wang; Guangting Chen; Xinle Xuan; An Zhang 001; Yong Chen 002; Yuehuan Wang; Hecheng Zhang (Asia Pac. J. Oper. Res., 2023)

Competitive Algorithms for Online Traveling Salesman Problem on a Semi-line. - Qian Liu; An Zhang 001; Kai Wang; Yong Chen 002; Guangting Chen (COCOA (1), 2024)

On the Inapproximability of Two-machine Open Shop Scheduling with Exact Delays. - Shunzhang Lu; An Zhang 001; Mengyuan Hu; Yong Chen 002; Guangting Chen (COCOA (1), 2024)

Covering Vertices by 4+-Paths: A Simpler Local Search Coupled with a More Delicate Amortization. - Mingyang Gong; Guangting Chen; Guohui Lin; Eiji Miyano; Abbinash Ranjitkar (IWOCA, 2025)

On the pure fixed charge transportation problem. - Pengfei Zhu; Guangting Chen; Yong Chen 002; An Zhang 001 (Discret. Optim., 2025)

Path cover using only short paths. - Mingyang Gong; Guangting Chen; Zhi-Zhong Chen; Guohui Lin; Riki Uchida (Theor. Comput. Sci., 2025)

Better approximating SONET k-edge partition for small capacity k. - Junhui Ye; Huihuang Jiang; Guangting Chen; Yong Chen 002; Guohui Lin; An Zhang 001 (J. Comb. Optim., 2025)

Improved approximation algorithms for multiprocessor indivisible coflow scheduling. - Mingyang Gong; Guangting Chen; Guohui Lin; Bing Su 002 (J. Comb. Optim., 2025)