default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGuangting Chen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j24]Jie Wang, Guangting Chen, Xinle Xuan, An Zhang, Yong Chen, Yuehuan Wang, Hecheng Zhang:
Scheduling double-track gantry cranes to minimize the overall loading/ unloading time. Asia Pac. J. Oper. Res. 40(5): 2340021:1-2340021:26 (2023)- [j23]An Zhang
, Tan Zhen, Yong Chen, Guangting Chen:
An improved algorithm for parallel machine scheduling under additional resource constraints. Optim. Lett. 17(3): 753-769 (2023) - [j22]An Zhang, Liang Zhang, Yong Chen, Guangting Chen, Xing Wang:
Complexity and approximation algorithms for two parallel dedicated machine scheduling with conflict constraints. Theor. Comput. Sci. 941: 167-179 (2023) - 2022
- [j21]Yong Chen, Yinhui Cai, Longcheng Liu, Guangting Chen, Randy Goebel, Guohui Lin, Bing Su, An Zhang:
Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph. J. Comb. Optim. 43(3): 571-588 (2022) - [j20]Guangting Chen, Yong Chen, Zhi-Zhong Chen, Guohui Lin, Tian Liu, An Zhang:
Approximation algorithms for the maximally balanced connected graph tripartition problem. J. Comb. Optim. 44(3): 1753-1773 (2022) - 2021
- [j19]Yong Chen, An Zhang, Zhiyi Tan, Ying Xue, Guangting Chen:
A (32+ε)-approximation algorithm for scheduling on two parallel machines with job delivery coordination. J. Oper. Res. Soc. 72(9): 1929-1942 (2021) - [j18]Xing Wang, Guangting Chen, Yong Chen, Guohui Lin, Yonghao Wang, An Zhang:
Improved hardness and approximation results for single allocation hub location problems. Theor. Comput. Sci. 864: 10-19 (2021) - [j17]Xiaojuan Jiang, An Zhang, Yong Chen, Guangting Chen, Kangbok Lee:
An improved algorithm for a two-stage production scheduling problem with an outsourcing option. Theor. Comput. Sci. 876: 59-69 (2021) - [c10]An Zhang, Liang Zhang, Yong Chen, Guangting Chen, Xing Wang:
Approximation Algorithms for Two Parallel Dedicated Machine Scheduling with Conflict Constraints. COCOA 2021: 111-124 - 2020
- [c9]Xing Wang, Guangting Chen, Yong Chen, Guohui Lin, Yonghao Wang, An Zhang:
Improved Hardness and Approximation Results for Single Allocation Hub Location. AAIM 2020: 85-96
2010 – 2019
- 2019
- [j16]Hailiang Zhang, Guangting Chen, Guanglong Yu:
On the largest matching roots of graphs with a given number of pendent vertices. Discret. Appl. Math. 255: 339-344 (2019) - 2018
- [j15]An Zhang, Yong Chen, Lin Chen, Guangting Chen:
On the NP-hardness of scheduling with time restrictions. Discret. Optim. 28: 54-62 (2018) - [c8]Yinhui Cai, Guangting Chen, Yong Chen, Randy Goebel, Guohui Lin, Longcheng Liu, An Zhang:
Approximation Algorithms for Two-Machine Flow-Shop Scheduling with a Conflict Graph. COCOON 2018: 205-217 - [i2]Yinhui Cai, Guangting Chen, Yong Chen, Randy Goebel, Guohui Lin, Longcheng Liu, An Zhang:
Approximation algorithms for two-machine flow-shop scheduling with a conflict graph. CoRR abs/1803.02862 (2018) - 2017
- [j14]An Zhang, Wenshuai Zhang, Yong Chen, Guangting Chen, Xufeng Chen:
Approximate the scheduling of quay cranes with non-crossing constraints. Eur. J. Oper. Res. 258(3): 820-828 (2017) - [j13]An Zhang, Feilang Ye, Yong Chen, Guangting Chen:
Better permutations for the single-processor scheduling with time restrictions. Optim. Lett. 11(4): 715-724 (2017) - [c7]Guangting Chen, Lei Zhang, An Zhang, Yong Chen:
Combinatorial Approximation Algorithms for Spectrum Assignment Problem in Chain and Ring Networks. COCOA (1) 2017: 125-132 - [i1]An Zhang, Yong Chen, Lin Chen, Guangting Chen:
On the NP-hardness of scheduling with time restrictions. CoRR abs/1703.00575 (2017) - 2016
- [j12]An Zhang, Hongjun Wang, Yong Chen, Guangting Chen:
Scheduling jobs with equal processing times and a single server on parallel identical machines. Discret. Appl. Math. 213: 196-206 (2016) - 2015
- [j11]Yu Zhou, Wei Ding, Guangming Wang, Guangting Chen:
An Edge-Turbulence Algorithm for the 2-MRS Problem on Trees with Unreliable Edges. Asia Pac. J. Oper. Res. 32(1): 1540010:1-1540010:17 (2015) - 2013
- [j10]Yong Chen, An Zhang, Guangting Chen, Jianming Dong:
Approximation algorithms for parallel open shop scheduling. Inf. Process. Lett. 113(7): 220-224 (2013) - [j9]Wei Ding, Yu Zhou, Guangting Chen, Hongfa Wang, Guangming Wang:
On the 2-MRS Problem in a Tree with Unreliable Edges. J. Appl. Math. 2013: 743908:1-743908:11 (2013) - [j8]Guangting Chen, Guohui Lin, Zhiyi Tan:
Preface. J. Comb. Optim. 26(3): 415 (2013) - [j7]Guangting Chen, Suhui Cui:
Relay node placement in two-tiered wireless sensor networks with base stations. J. Comb. Optim. 26(3): 499-508 (2013) - 2012
- [j6]Hezhi Luo, Huixian Wu, Guangting Chen:
On the convergence of augmented Lagrangian methods for nonlinear semidefinite programming. J. Glob. Optim. 54(3): 599-618 (2012)
2000 – 2009
- 2008
- [c6]Guangting Chen, Sunqin Huang, Jianfang Yang:
Delay Constrained Proxy Location Problems on Tree Graphs. International Conference on Internet Computing 2008: 72-76 - 2006
- [j5]Guangting Chen, Gu Zhang, Rainer E. Burkard:
The web proxy location problem in general tree of rings networks. J. Comb. Optim. 12(4): 327-336 (2006) - [j4]Wei Li, Ping-Qi Pan, Guangting Chen:
Combined projected gradient algorithm for linear programming. Optim. Methods Softw. 21(4): 541-550 (2006) - 2004
- [c5]Guangting Chen, Gu Zhang, Wei Ding:
The Web Proxy Location Problem in the Tree Networks. CCCT (1) 2004: 343-348 - 2003
- [j3]Guangting Chen, Rainer E. Burkard:
Constrained Steiner trees in Halin graphs. RAIRO Oper. Res. 37(3): 179-194 (2003) - [j2]Guangting Chen, Guoliang Xue:
A PTAS for weight constrained Steiner trees in series-parallel graphs. Theor. Comput. Sci. 304(1-3): 237-247 (2003) - 2001
- [c4]Guangting Chen, Guoliang Xue:
An FPTAS for Weight-Constrained Steiner Trees in Series-Parallel Graphs. COCOON 2001: 519-528 - [c3]Guoliang Xue, Guo-jun Li, Guangting Chen, Xuedao Chu:
Source-waiting QoS routing in networks with advanced resource reservations. ICC 2001: 619-624 - [c2]Guangting Chen, Guoliang Xue:
K-pair delay constrained minimum cost routing in undirected networks. SODA 2001: 230-231 - 2000
- [j1]Guangting Chen, Guochuan Zhang:
A constrained minimum spanning tree problem. Comput. Oper. Res. 27(9): 867-875 (2000) - [c1]Guangting Chen, Guo-jun Li, Guoliang Xue:
Optimal placement of wavelength converters in WDM optical networks with a general tree of rings topology. ICCCN 2000: 606-611
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-06 21:07 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
