Xiangyong Li

According to our database1, Xiangyong Li authored at least 27 papers between 2005 and 2021.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
Order fulfilment problem with time windows and synchronisation arising in the online retailing.
Int. J. Prod. Res., 2021

A stochastic hierarchical approach for the master surgical scheduling problem.
Comput. Ind. Eng., 2021

2020
A Branch-And-Benders-Cut approach for the fault tolerant regenerator location problem.
Comput. Oper. Res., 2020

A new branch-and-cut approach for the generalized regenerator location problem.
Ann. Oper. Res., 2020

2019
Integrated order allocation and order routing problem for e-order fulfillment.
IISE Trans., 2019

Using Machine Learning Algorithms to Predict Hepatitis B Surface Antigen Seroclearance.
Comput. Math. Methods Medicine, 2019

2018
Tabu search and iterated local search for the cyclic bottleneck assignment problem.
Comput. Oper. Res., 2018

An Iterated Tabu Search Metaheuristic for the Regenerator Location Problem.
Appl. Soft Comput., 2018

2017
Regenerator location problem: Polyhedral study and effective branch-and-cut algorithms.
Eur. J. Oper. Res., 2017

Matheuristics for the single-path design-balanced service network design problem.
Comput. Oper. Res., 2017

An iterated metaheuristic for the directed network design problem with relays.
Comput. Ind. Eng., 2017

2014
Low False-Positives in an mLumin-Based Bimolecular Fluorescence Complementation System with a Bicistronic Expression Vector.
Sensors, 2014

2012
Dynamics of Ras Complexes Observed in Living Cells.
Sensors, 2012

A Branch-and-Cut Approach for the Minimum-Energy Broadcasting Problem in Wireless Networks.
INFORMS J. Comput., 2012

A multistart adaptive memory-based tabu search algorithm for the heterogeneous fixed fleet open vehicle routing problem.
Expert Syst. Appl., 2012

2011
Flow shop scheduling to minimize the total completion time with a permanently present operator: Models and ant colony optimization metaheuristic.
Comput. Oper. Res., 2011

2010
An ant colony optimization metaheuristic for single-path multicommodity network flow problems.
J. Oper. Res. Soc., 2010

A branch-and-cut algorithm for the strong minimum energy topology in wireless sensor networks.
Eur. J. Oper. Res., 2010

An ant colony optimization metaheuristic for machine-part cell formation problems.
Comput. Oper. Res., 2010

2009
An ant colony optimization metaheuristic hybridized with tabu search for open vehicle routing problems.
J. Oper. Res. Soc., 2009

Optimization of operation and changeover time for production planning and scheduling in a flexible manufacturing system.
Comput. Ind. Eng., 2009

A Branch-and-Cut Algorithm for the Minimum Energy Symmetric Connectivity Problem in Wireless Networks.
Proceedings of the Combinatorial Optimization and Applications, 2009

2008
Ant Colony Optimization Metaheuristic for the Traffic Grooming in WDM Networks.
Proceedings of the Combinatorial Optimization and Applications, 2008

2006
A Hybrid Discrete Particle Swarm Optimization for the Traveling Salesman Problem.
Proceedings of the Simulated Evolution and Learning, 6th International Conference, 2006

A Hierarchical Particle Swarm Optimization for Solving Bilevel Programming Problems.
Proceedings of the Artificial Intelligence and Soft Computing, 2006

An Ant Colony System for the Open Vehicle Routing Problem.
Proceedings of the Ant Colony Optimization and Swarm Intelligence, 2006

2005
A Novel Particle Swarm Optimization for Constrained Optimization Problems.
Proceedings of the AI 2005: Advances in Artificial Intelligence, 2005


  Loading...