| Speech corpora subset selection based on time-continuous utterances features |
27 |
| Operating room planning and surgical case scheduling: a review of literature |
13 |
| An upper bound on the double Roman domination number |
11 |
| The rank of a complex unit gain graph in terms of the rank of its underlying graph |
7 |
| Case Mix Index weighted multi-objective optimization of inpatient bed allocation in general hospital |
7 |
| Relation between the skew-rank of an oriented graph and the independence number of its underlying graph |
7 |
| Nordhaus-Gaddum bounds for total Roman domination |
7 |
| Approximation algorithms for precedence-constrained identical machine scheduling with rejection |
6 |
| Large-scale medical examination scheduling technology based on intelligent optimization |
6 |
| Robust multiobjective portfolio optimization: a set order relations approach |
6 |
| Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem |
6 |
| A note on a two-agent scheduling problem related to the total weighted late work |
6 |
| Amortized efficiency of constructing multiple independent spanning trees on bubble-sort networks |
5 |
| Distributed algorithms for barrier coverage via sensor rotation in wireless sensor networks |
5 |
| Closed-loop supply chain inventory management with recovery information of reusable containers |
4 |
| Approximation algorithms for distance constraint sweep coverage with base stations |
4 |
| Perfect graphs involving semitotal and semipaired domination |
4 |
| Two-stage no-wait hybrid flowshop scheduling with inter-stage flexibility |
4 |
| Restricted power domination and zero forcing problems |
4 |
| Model and algorithm of routes planning for emergency relief distribution in disaster management with disaster information update |
4 |
| Some extremal results on the colorful monochromatic vertex-connectivity of a graph |
3 |
| Minmax scheduling problems with common due-date and completion time penalty |
3 |
| Minimum rank and zero forcing number for butterfly networks |
3 |
| Competitive intensity and quality maximizing seedings in knock-out tournaments |
3 |
| Weak {2}-domination number of Cartesian products of cycles |
3 |
| The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven |
3 |
| A simpler PTAS for connected k-path vertex cover in homogeneous wireless sensor network |
3 |
| On computing a minimum secure dominating set in block graphs |
3 |
| Improved mixed-integer programming models for the multiprocessor scheduling problem with communication delays |
3 |
| Matching patients and healthcare service providers: a novel two-stage method based on knowledge rules and OWA-NSGA-II algorithm |
3 |
| Neighbor sum distinguishing list total coloring of subcubic graphs |
3 |
| Special cases of the quadratic shortest path problem |
3 |
| Neighbor sum distinguishing total coloring of graphs with bounded treewidth |
3 |
| A characterization of linearizable instances of the quadratic minimum spanning tree problem |
3 |
| Vertex arboricity of planar graphs without intersecting 5-cycles |
3 |
| Local search approximation algorithms for the k-means problem with penalties |
3 |
| Space-efficient algorithms for maximum cardinality search, its applications, and variants of BFS |
2 |
| GPU implementation of a cellular genetic algorithm for scheduling dependent tasks of physical system simulation programs |
2 |
| Improved PTAS for the constrained k-means problem |
2 |
| Improved bounds for the greedy strategy in optimization problems with curvature |
2 |
| Better approximability results for min-max tree/cycle/path cover problems |
2 |
| Algorithm complexity of neighborhood total domination and -graphs |
2 |
| Speed scaling on parallel processors with migration |
2 |
| The eigenvectors to the p-spectral radius of general hypergraphs |
2 |
| The Wiener index of SierpiAski-like graphs |
2 |
| An integrated method to solve the healthcare facility layout problem under area constraints |
2 |
| Study on specialist outpatient matching appointment and the balance matching model |
2 |
| A comparison of fixed and variable capacity-addition policies for outpatient capacity allocation |
2 |
| Real-time scheduling optimization considering the unexpected events in home health care |
2 |
| Chamfer distances on the isometric grid: a structural description of minimal distances based on linear programming approach |
2 |
