default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYongxi Cheng
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j37]Jun Wu, Zhen Yang, Guiqing Zhang, Yongxi Cheng:
An extension of the Christofides heuristic for a single-depot multiple Hamiltonian path problem. J. Comb. Optim. 47(2): 7 (2024)- 2023
- [j36]Ying Chen, Yi Xu, Guiqing Zhang, Yongxi Cheng:
A Single Machine Group Scheduling Problem with Due Date Assignment and Position-Dependent Costs. Asia Pac. J. Oper. Res. 40(4): 2340007:1-2340007:20 (2023) - [j35]Ying Chen, Xiaole Ma, Guiqing Zhang, Yongxi Cheng:
On optimal due date assignment without restriction and resource allocation in group technology scheduling. J. Comb. Optim. 45(2): 64 (2023) - [j34]Jun Wu
, Yongxi Cheng, Zhen Yang, Feng Chu:
A 3/2-approximation algorithm for the multiple Hamiltonian path problem with no prefixed endpoints. Oper. Res. Lett. 51(5): 473-476 (2023) - 2022
- [j33]Jun Wu, Yongxi Cheng, Ding-Zhu Du:
An improved zig zag approach for competitive group testing. Discret. Optim. 43: 100687 (2022) - [j32]Ying Chen, Yongxi Cheng, Guiqing Zhang:
Single machine lot scheduling with non-uniform lot capacities and processing times. J. Comb. Optim. 43(5): 1359-1367 (2022) - [j31]Wenming Zhang, Ye Zhang, Yongxi Cheng, Shankui Zheng:
An online trading problem with an increasing number of available products. J. Comb. Optim. 44(1): 518-531 (2022) - [j30]Wenming Zhang, Huan Hu, Yongxi Cheng, Hongmei Li, Haizhen Wang:
The work function algorithm for the paging problem. Theor. Comput. Sci. 930: 100-105 (2022) - 2021
- [j29]Yongxi Cheng, Yunyue Yang, Ding-Zhu Du:
On optimal randomized group testing with one defective item and a constrained number of positive responses. Discret. Optim. 39: 100621 (2021) - 2020
- [j28]Wenming Zhang, Yongxi Cheng:
A new upper bound on the work function algorithm for the k-server problem. J. Comb. Optim. 39(2): 509-518 (2020) - 2019
- [j27]Yongxi Cheng, Yunyue Yang, Ding-Zhu Du:
A class of asymptotically optimal group testing strategies to identify good items. Discret. Appl. Math. 260: 109-116 (2019) - [j26]Yongxi Cheng, Yunyue Yang, Ding-Zhu Du:
A class of asymptotically optimal group screening strategies with limited item participation. Discret. Appl. Math. 270: 83-95 (2019) - 2018
- [j25]Guiqing Zhang, Yongxi Cheng, Yinfeng Xu:
A randomized competitive group testing procedure. J. Comb. Optim. 35(3): 667-683 (2018) - [j24]Guiqing Zhang, Yongxi Cheng, Lan Qin:
An improved online evacuation strategy from a convex region on grid networks. J. Comb. Optim. 36(1): 44-54 (2018) - 2016
- [j23]Xin Feng, Yongxi Cheng, Feifeng Zheng, Yin-Feng Xu:
Online integrated production-distribution scheduling problems without preemption. J. Comb. Optim. 31(4): 1569-1585 (2016) - 2015
- [j22]Yongxi Cheng, Ding-Zhu Du, Feifeng Zheng:
A new strongly competitive group testing algorithm with small sequentiality. Ann. Oper. Res. 229(1): 265-286 (2015) - [j21]Yongxi Cheng, Jue Guo, Feifeng Zheng:
A new randomized algorithm for group testing with unknown number of defective items. J. Comb. Optim. 30(1): 150-159 (2015) - 2014
- [j20]Yongxi Cheng, Ding-Zhu Du, Yinfeng Xu:
A Zig-Zag Approach for Competitive Group Testing. INFORMS J. Comput. 26(4): 677-689 (2014) - [j19]Yongxi Cheng, Yinfeng Xu:
An efficient FPRAS type group testing procedure to approximate the number of defectives. J. Comb. Optim. 27(2): 302-314 (2014) - 2013
- [j18]Feifeng Zheng, Yongxi Cheng, Ming Liu, Yinfeng Xu:
Online interval scheduling on a single machine with finite lookahead. Comput. Oper. Res. 40(1): 180-191 (2013) - [j17]Feifeng Zheng, Yongxi Cheng, Yinfeng Xu, Ming Liu:
Competitive strategies for an online generalized assignment problem with a service consecution constraint. Eur. J. Oper. Res. 229(1): 59-66 (2013) - 2012
- [j16]Maolin Hu, Yongxi Cheng, Weidong Xu:
A generalization of Boesch's theorem. Discret. Math. 312(6): 1171-1177 (2012) - [j15]Yongxi Cheng, Guohui Lin:
Solving haplotype inference problem with non-genotyped founders via integer linear programming. J. Comb. Optim. 23(1): 50-60 (2012) - 2011
- [j14]Yongxi Cheng:
An efficient randomized group testing procedure to determine the number of defectives. Oper. Res. Lett. 39(5): 352-354 (2011) - 2010
- [j13]Leizhen Cai, Yongxi Cheng, Elad Verbin, Yuan Zhou:
Surviving Rates of Graphs with Bounded Treewidth for the Firefighter Problem. SIAM J. Discret. Math. 24(4): 1322-1335 (2010) - 2009
- [j12]Hong-Bin Chen, Yongxi Cheng, Qian He, Chongchong Zhong:
Transforming an error-tolerant separable matrix to an error-tolerant disjunct matrix. Discret. Appl. Math. 157(2): 387-390 (2009) - [j11]Yongxi Cheng, Ding-Zhu Du, Ker-I Ko, Guohui Lin:
On the Parameterized Complexity of Pooling Design. J. Comput. Biol. 16(11): 1529-1537 (2009) - [j10]Yongxi Cheng, Ding-Zhu Du, Guohui Lin:
On the upper bounds of the minimum number of rows of disjunct matrices. Optim. Lett. 3(2): 297-302 (2009) - 2008
- [j9]Yongxi Cheng, Xiaoming Sun, Yiqun Lisa Yin:
Searching monotone multi-dimensional arrays. Discret. Math. 308(11): 2213-2221 (2008) - [j8]Yongxi Cheng:
A new class of antimagic Cartesian product graphs. Discret. Math. 308(24): 6441-6448 (2008) - [j7]Yongxi Cheng, Ding-Zhu Du:
New Constructions of One- and Two-Stage Pooling Designs. J. Comput. Biol. 15(2): 195-205 (2008) - [j6]Yongxi Cheng, Ker-I Ko, Weili Wu:
On the complexity of non-unique probe selection. Theor. Comput. Sci. 390(1): 120-125 (2008) - [j5]Chen Wang, Myung Ah Park, James Willson, Yongxi Cheng, Andras Farago, Weili Wu:
On approximate optimal dual power assignment for biconnectivity and edge-biconnectivity. Theor. Comput. Sci. 396(1-3): 180-190 (2008) - 2007
- [j4]Yongxi Cheng, Ding-Zhu Du:
Efficient Constructions of Disjunct Matrices with Applications to DNA Library Screening. J. Comput. Biol. 14(9): 1208-1216 (2007) - [j3]Yongxi Cheng:
Generating Combinations by Three Basic Operations. J. Comput. Sci. Technol. 22(6): 909-913 (2007) - [j2]Yongxi Cheng, Xi Chen, Yiqun Lisa Yin:
On searching a table consistent with division poset. Theor. Comput. Sci. 370(1-3): 240-253 (2007) - [j1]Yongxi Cheng:
Lattice grids and prisms are antimagic. Theor. Comput. Sci. 374(1-3): 66-73 (2007)
Conference and Workshop Papers
- 2021
- [c4]Ying Chen, Yongxi Cheng:
Optimal Due Date Assignment Without Restriction and Convex Resource Allocation in Group Technology Scheduling. COCOA 2021: 456-467 - [c3]Ying Chen, Yongxi Cheng:
Group Scheduling and Due Date Assignment Without Restriction on a Single Machine. APMS (3) 2021: 250-257 - 2010
- [c2]Yongxi Cheng, Bo Li, Yinfeng Xu:
Semi Voronoi Diagrams. CGGA 2010: 19-26 - 2006
- [c1]Yanhong A. Liu, Chen Wang, Michael Gorbovitski, Tom Rothamel, Yongxi Cheng, Yingchao Zhao, Jing Zhang:
Core role-based access control: efficient implementations by transformations. PEPM 2006: 112-120
Informal and Other Publications
- 2005
- [i2]Yongxi Cheng, Xiaoming Sun, Yiqun Lisa Yin:
Searching Monotone Multi-dimensional Arrays. CoRR abs/cs/0504026 (2005) - [i1]Yongxi Cheng, Xi Chen, Yiqun Lisa Yin:
On Searching a Table Consistent with Division Poset. CoRR abs/cs/0505075 (2005)
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-05 21:24 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:
