| Publication | Date of Publication | Type |
|---|
| An improved approximation algorithm for the minimum \(k\)-star partition problem | 2026-01-28 | Paper |
1D3V electrostatic implicit particle simulation method in spherical axisymmetric geometry
Computer Physics Communications | 2026-01-28 | Paper |
Improved approximation algorithms for the \(k\)-path partition problem
Journal of Global Optimization | 2024-11-12 | Paper |
| Exact and approximation algorithms for the multi-depot data mule scheduling with handling time and time span constraints | 2024-09-16 | Paper |
Recent progress on the study of multi-vehicle coordination in cooperative attack and defense: an overview
Asian Journal of Control | 2024-07-25 | Paper |
Approximation algorithms for the min-max mixed rural postmen cover problem and its variants
Algorithmica | 2024-04-02 | Paper |
A Mass-Preserving Characteristic Finite Difference Method For Miscible Displacement Problem
Advances in Applied Mathematics and Mechanics | 2024-01-23 | Paper |
A local search algorithm for the \(k\)-path partition problem
Optimization Letters | 2024-01-22 | Paper |
Heuristics for Finding Sparse Solutions of Linear Inequalities
Asia-Pacific Journal of Operational Research | 2023-10-19 | Paper |
New LP relaxations for minimum cycle/path/tree cover problems
Algorithmic Aspects in Information and Management | 2023-10-16 | Paper |
Approximation algorithms for the min-max mixed rural postmen cover problem and its variants
Lecture Notes in Computer Science | 2023-08-10 | Paper |
Approximation algorithms for multi-vehicle stacker crane problems
Journal of the Operations Research Society of China | 2023-03-07 | Paper |
Approximation algorithms for some min-max and minimum stacker crane cover problems
Journal of Combinatorial Optimization | 2022-11-29 | Paper |
The price of fairness for a two-agent scheduling game minimizing total completion time
Journal of Combinatorial Optimization | 2022-10-04 | Paper |
Approximation and polynomial algorithms for the data mule scheduling with handling time and time span constraints
Information Processing Letters | 2022-09-02 | Paper |
Approximation algorithms for some minimum postmen cover problems
Discrete Applied Mathematics | 2022-08-04 | Paper |
Distance constrained vehicle routing problem to minimize the total cost: algorithms and complexity
Journal of Combinatorial Optimization | 2022-07-18 | Paper |
Approximation algorithms for some min-max and minimum stacker crane cover problems
Combinatorial Optimization and Applications | 2022-06-29 | Paper |
Approximation algorithms for the \(k\)-depots Hamiltonian path problem
Optimization Letters | 2022-04-22 | Paper |
A simple and efficient parallel immersed boundary-lattice Boltzmann method for fully resolved simulations of incompressible settling suspensions
Computers and Fluids | 2022-04-22 | Paper |
An asymptotically tight online algorithm for \(m\)-steiner traveling salesman problem
Information Processing Letters | 2021-12-14 | Paper |
Approximation algorithms for some min-max postmen cover problems
Annals of Operations Research | 2021-11-08 | Paper |
A particle Fokker-Planck algorithm with multiscale temporal discretization for rarefied and continuum gas flows
Communications in Computational Physics | 2021-10-26 | Paper |
A unified stochastic particle Bhatnagar-Gross-Krook method for multiscale gas flows
Journal of Computational Physics | 2021-01-27 | Paper |
A boundary thickening-based direct forcing immersed boundary method for fully resolved simulation of particle-laden flows
Journal of Computational Physics | 2021-01-26 | Paper |
New approximation algorithms for the minimum cycle cover problem
Frontiers in Algorithmics | 2020-07-07 | Paper |
Approximation algorithms for some minimum postmen cover problems
Combinatorial Optimization and Applications | 2020-05-13 | Paper |
| Distance constrained vehicle routing problem to minimize the total cost | 2020-02-24 | Paper |
New LP relaxations for minimum cycle/path/tree cover problems
Theoretical Computer Science | 2019-12-27 | Paper |
Approximating the multiple-depot multiple-terminal Hamiltonian path problem
Discrete Optimization | 2019-11-28 | Paper |
Online fractional hierarchical scheduling on uniformly related machines
Computers & Operations Research | 2019-11-11 | Paper |
New approximation algorithms for the minimum cycle cover problem
Theoretical Computer Science | 2019-10-07 | Paper |
Better approximability results for min-max tree/cycle/path cover problems
Journal of Combinatorial Optimization | 2019-06-06 | Paper |
A mass-conservative characteristic splitting mixed element method for saltwater intrusion problem
The Journal of Nonlinear Sciences and Applications | 2019-05-09 | Paper |
Vehicle routing problems with regular objective functions on a path
Naval Research Logistics | 2019-05-02 | Paper |
Parallel split least-squares mixed finite element method for parabolic problem
Numerical Methods for Partial Differential Equations | 2019-02-15 | Paper |
Shapley value for parallel machine sequencing situation without initial order
Mathematical Problems in Engineering | 2018-08-27 | Paper |
The influence of sub-grid scale motions on particle collision in homogeneous isotropic turbulence
Acta Mechanica Sinica | 2018-07-26 | Paper |
Eulerian and Lagrangian stagnation plane behavior of moderate Reynolds number round opposed-jets flow
Computers and Fluids | 2018-06-26 | Paper |
| Better inapproximability bounds and approximation algorithms for MIN-MAX tree/cycle/path cover problems | 2017-10-23 | Paper |
An optimal online algorithm for fractional scheduling on uniform machines with three hierarchies
Journal of Systems Science and Complexity | 2017-08-25 | Paper |
A note on approximation algorithms of the clustered traveling salesman problem
Information Processing Letters | 2017-08-16 | Paper |
An optimal online algorithm for scheduling on two parallel machines with GoS eligibility constraints
Journal of the Operations Research Society of China | 2017-08-10 | Paper |
Improved approximation algorithms for some min-max and minimum cycle cover problems
Theoretical Computer Science | 2016-11-24 | Paper |
A theoretical development for the total tardiness problem and its application in branch and bound algorithms
Computers & Operations Research | 2016-11-11 | Paper |
Semi-online scheduling with bounded job sizes on two uniform machines
Theoretical Computer Science | 2016-11-04 | Paper |
Optimal deterministic algorithms for some variants of online quota traveling salesman problem
European Journal of Operational Research | 2016-06-23 | Paper |
Online hierarchical scheduling on two uniform machines with bounded job sizes
Asia-Pacific Journal of Operational Research | 2015-12-11 | Paper |
Improved approximation algorithms for min-max and minimum vehicle routing problems
Lecture Notes in Computer Science | 2015-10-29 | Paper |
Online scheduling with equal processing times and machine eligibility constraints
Theoretical Computer Science | 2015-02-24 | Paper |
| An improved algorithm for scheduling two identical machines with batch delivery consideration | 2014-02-28 | Paper |
Semi-online scheduling problems on two uniform machines under a grade of service provision
Theoretical Computer Science | 2013-12-19 | Paper |
Heuristics for parallel machine scheduling with batch delivery consideration
Journal of Industrial and Management Optimization | 2013-11-14 | Paper |
Existence of solutions for the critical elliptic system with inverse square potentials
Acta Mathematicae Applicatae Sinica. English Series | 2013-07-03 | Paper |
Single machine scheduling with batch delivery to multiple customers in a star-shaped network
Asia-Pacific Journal of Operational Research | 2013-05-10 | Paper |
An improved approximation algorithm for the clustered traveling salesman problem
Information Processing Letters | 2012-10-23 | Paper |
Accountable authority key policy attribute-based encryption
Science China Information Sciences | 2012-08-17 | Paper |
Approximation algorithms for single vehicle scheduling problems with release and service times on a tree or cycle
Theoretical Computer Science | 2012-06-25 | Paper |
Routing open shop and flow shop scheduling problems
European Journal of Operational Research | 2012-05-14 | Paper |
Semi-online scheduling with known partial information about job sizes on two identical machines
Theoretical Computer Science | 2011-07-14 | Paper |
Single-vehicle scheduling problems with release and service times on a line
Networks | 2011-03-16 | Paper |
Semi-online scheduling with known maximum job size on two uniform machines
Journal of Combinatorial Optimization | 2010-12-21 | Paper |
| Two-machine mixed shop problem with setup, processing and removal time separated | 2010-11-05 | Paper |
Online scheduling with reassignment on two uniform machines
Theoretical Computer Science | 2010-07-07 | Paper |
\(\frac{3}{2}\)-approximation for two-machine no-wait flowshop scheduling with availability constraints
Information Processing Letters | 2009-07-09 | Paper |
NHPP models with Markov switching for software reliability
Computational Statistics and Data Analysis | 2009-06-16 | Paper |
Vehicle routing problems on a line-shaped network with release time constraints
Operations Research Letters | 2009-05-07 | Paper |
Controlling chaotic robots with kinematical redundancy
Chaos: An Interdisciplinary Journal of Nonlinear Science | 2008-10-14 | Paper |
Minimizing total completion time subject to job release dates and preemption penalties
Journal of Scheduling | 2007-12-20 | Paper |
THERMAL LATTICE BOLTZMANN MODEL WITH VISCOUS HEAT DISSIPATION IN THE INCOMPRESSIBLE LIMIT
International Journal of Modern Physics C | 2007-03-21 | Paper |
NHPP models for categorized software defects
Applied Stochastic Models in Business and Industry | 2006-12-08 | Paper |
| scientific article; zbMATH DE number 5059362 (Why is no real title available?) | 2006-10-04 | Paper |
LATTICE BOLTZMANN METHOD IN SIMULATION OF THERMAL MICRO-FLOW WITH TEMPERATURE JUMP
International Journal of Modern Physics C | 2006-08-24 | Paper |
Approximation schemes for minimizing total (weighted) completion time with release dates on a batch machine
Theoretical Computer Science | 2005-12-29 | Paper |
Approximability of two-machine no-wait flowshop scheduling with availability constraints.
Operations Research Letters | 2003-11-17 | Paper |
On scheduling an unbounded batch machine
Operations Research Letters | 2003-05-04 | Paper |
Scheduling groups of unit length jobs on two identical parallel machines.
Information Processing Letters | 2002-07-25 | Paper |
Scheduling with job release dates, delivery times and preemption penalties
Information Processing Letters | 2002-07-14 | Paper |
A note on the complexity of family scheduling to minimize the number of late jobs
Journal of Scheduling | 2001-10-14 | Paper |
Scheduling one batch processor subject to job release dates
Discrete Applied Mathematics | 2001-10-04 | Paper |
Minimizing the number of late jobs under the group technology assumption
Journal of Combinatorial Optimization | 1999-09-22 | Paper |
