Yongxi Cheng

Orcid: 0000-0003-0405-5263

According to our database1, Yongxi Cheng authored at least 41 papers between 2006 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
An extension of the Christofides heuristic for a single-depot multiple Hamiltonian path problem.
J. Comb. Optim., March, 2024

2023
A 3/2-approximation algorithm for the multiple Hamiltonian path problem with no prefixed endpoints.
Oper. Res. Lett., September, 2023

A Single Machine Group Scheduling Problem with Due Date Assignment and Position-Dependent Costs.
Asia Pac. J. Oper. Res., August, 2023

On optimal due date assignment without restriction and resource allocation in group technology scheduling.
J. Comb. Optim., March, 2023

2022
The work function algorithm for the paging problem.
Theor. Comput. Sci., 2022

An online trading problem with an increasing number of available products.
J. Comb. Optim., 2022

Single machine lot scheduling with non-uniform lot capacities and processing times.
J. Comb. Optim., 2022

An improved zig zag approach for competitive group testing.
Discret. Optim., 2022

2021
On optimal randomized group testing with one defective item and a constrained number of positive responses.
Discret. Optim., 2021

Group Scheduling and Due Date Assignment Without Restriction on a Single Machine.
Proceedings of the Advances in Production Management Systems. Artificial Intelligence for Sustainable and Resilient Production Systems, 2021

Optimal Due Date Assignment Without Restriction and Convex Resource Allocation in Group Technology Scheduling.
Proceedings of the Combinatorial Optimization and Applications, 2021

2020
A new upper bound on the work function algorithm for the k-server problem.
J. Comb. Optim., 2020

2019
A class of asymptotically optimal group screening strategies with limited item participation.
Discret. Appl. Math., 2019

A class of asymptotically optimal group testing strategies to identify good items.
Discret. Appl. Math., 2019

2018
A randomized competitive group testing procedure.
J. Comb. Optim., 2018

An improved online evacuation strategy from a convex region on grid networks.
J. Comb. Optim., 2018

2016
Online integrated production-distribution scheduling problems without preemption.
J. Comb. Optim., 2016

2015
A new randomized algorithm for group testing with unknown number of defective items.
J. Comb. Optim., 2015

A new strongly competitive group testing algorithm with small sequentiality.
Ann. Oper. Res., 2015

2014
An efficient FPRAS type group testing procedure to approximate the number of defectives.
J. Comb. Optim., 2014

A Zig-Zag Approach for Competitive Group Testing.
INFORMS J. Comput., 2014

2013
Competitive strategies for an online generalized assignment problem with a service consecution constraint.
Eur. J. Oper. Res., 2013

Online interval scheduling on a single machine with finite lookahead.
Comput. Oper. Res., 2013

2012
Solving haplotype inference problem with non-genotyped founders via integer linear programming.
J. Comb. Optim., 2012

A generalization of Boesch's theorem.
Discret. Math., 2012

2011
An efficient randomized group testing procedure to determine the number of defectives.
Oper. Res. Lett., 2011

2010
Surviving Rates of Graphs with Bounded Treewidth for the Firefighter Problem.
SIAM J. Discret. Math., 2010

Semi Voronoi Diagrams.
Proceedings of the Computational Geometry, Graphs and Applications, 2010

2009
On the upper bounds of the minimum number of rows of disjunct matrices.
Optim. Lett., 2009

On the Parameterized Complexity of Pooling Design.
J. Comput. Biol., 2009

Transforming an error-tolerant separable matrix to an error-tolerant disjunct matrix.
Discret. Appl. Math., 2009

2008
On approximate optimal dual power assignment for biconnectivity and edge-biconnectivity.
Theor. Comput. Sci., 2008

On the complexity of non-unique probe selection.
Theor. Comput. Sci., 2008

New Constructions of One- and Two-Stage Pooling Designs.
J. Comput. Biol., 2008

Searching monotone multi-dimensional arrays.
Discret. Math., 2008

A new class of antimagic Cartesian product graphs.
Discret. Math., 2008

2007
On searching a table consistent with division poset.
Theor. Comput. Sci., 2007

Lattice grids and prisms are antimagic.
Theor. Comput. Sci., 2007

Generating Combinations by Three Basic Operations.
J. Comput. Sci. Technol., 2007

Efficient Constructions of Disjunct Matrices with Applications to DNA Library Screening.
J. Comput. Biol., 2007

2006
Core role-based access control: efficient implementations by transformations.
Proceedings of the 2006 ACM SIGPLAN Workshop on Partial Evaluation and Semantics-based Program Manipulation, 2006


  Loading...