Printed from https://ideas.repec.org/s/spr/jcomop13.html
Content
March 2003, Volume 7, Issue 1
- 5-22 Iterative Converging Algorithms for Computing Bounds on Durations of Activities in Pert and Pert-Like Models
by Eugene Shragowitz & Habib Youssef & Bing Lu - 23-44 Constructing Near Optimal Schedules for the Flow-Shop Lot Streaming Problem with Sublot-Attached Setups
by Adar A. Kalir & Subhash C. Sarin - 45-68 Fast On-Line/Off-Line Algorithms for Optimal Reinforcement of a Network and its Connections with Principal Partition
by Sachin B. Patkar & H. Narayanan - 69-78 The Enhanced Double Digest Problem for DNA Physical Mapping
by Ming-Yang Kao & Jared Samet & Wing-Kin Sung - 79-86 Any Maximal Planar Graph with Only One Separating Triangle is Hamiltonian
by Chiuyuan Chen - 87-103 Upper Bounds for the SPOT 5 Daily Photograph Scheduling Problem
by Michel Vasquez & Jin-Kao Hao
December 2002, Volume 6, Issue 4
- 359-381 Composition of Graphs and the Triangle-Free Subgraph Polytope
by F. Bendali & A.R. Mahjoub & J. Mailfert - 383-400 Center and Distinguisher for Strings with Unbounded Alphabet
by Xiaotie Deng & Guojun Li & Lusheng Wang - 401-423 Resolution Search and Dynamic Branch-and-Bound
by Saïd Hanafi & Fred Glover - 425-453 Traffic Partition in WDM/SONET Rings to Minimize SONET ADMs
by Gruia Călinescu & Peng-Jun Wan - 455-471 Performance Analysis and Improvement for Some Linear On-Line Bin-Packing Algorithms
by Xiaodong Gu & Guoliang Chen & Jun Gu & Liusheng Huang & Yunjae Jung
September 2002, Volume 6, Issue 3
- 235-236 Preface
by Panos M. Pardalos & Henry Wolkowicz - 237-270 Geometry of Semidefinite Max-Cut Relaxations via Matrix Ranks
by Miguel F. Anjos & Henry Wolkowicz - 271-286 A Novel Eigenvector Technique for Large Scale Combinatorial Problems in VLSI Layout
by Laleh Behjat & Dorothy Kucar & Anthony Vannelli - 287-297 A Heuristic for the Maximum Independent Set Problem Based on Optimization of a Quadratic Over a Sphere
by Stanislav Busygin & Sergiy Butenko & Panos M. Pardalos - 299-333 A Genetic Algorithm for the Weight Setting Problem in OSPF Routing
by M. Ericsson & M.G.C. Resende & P.M. Pardalos - 335-352 All-Different Polytopes
by Jon Lee
June 2002, Volume 6, Issue 2
- 119-132 A Parametric Approach for a Nonlinear Discrete Location Problem
by J. Sun & Y. Gu - 133-142 Simplicial Pivoting Algorithms for a Tractable Class of Integer Programs
by H. Van Maaren & C. Dang - 143-155 Approximating the Independence Number and the Chromatic Number in Expected Polynomial Time
by Michael Krivelevich & Van H. Vu - 157-182 Improved Approximation for Breakpoint Graph Decomposition and Sorting by Reversals
by Alberto Caprara & Romeo Rizzi - 183-197 The Structural Birnbaum Importance of Consecutive-k Systems
by Hsun-Wen Chang & R.J. Chen & F.K. Hwang - 199-206 Ordinal On-Line Scheduling for Maximizing the Minimum Machine Completion Time
by Yong He & Zhiyi Tan - 207-227 A General Model of Some Inverse Combinatorial Optimization Problems and Its Solution Method Under l ∞ Norm
by Jianzhong Zhang & Zhenhong Liu
March 2002, Volume 6, Issue 1
- 5-16 Attacking the Market Split Problem with Lattice Point Enumeration
by Alfred Wassermann - 17-33 On the Robust Single Machine Scheduling Problem
by Jian Yang & Gang Yu - 35-54 The Knapsack Sharing Problem: An Exact Algorithm
by Mhand Hifi & Slim Sadfi - 55-65 A Simulated Annealing Approach to Communication Network Design
by Marcus Randall & Graham McMahon & Stephen Sugden - 67-80 3-Partitioning Problems for Maximizing the Minimum Load
by Shi Ping Chen & Yong He & Guohui Lin - 81-98 A Tabu Search Heuristic for the Location of Multi-Type Protection Devices on Electrical Supply Tree Networks
by J.C. James & S. Salhi - 99-110 New Approximation Algorithms for Map Labeling with Sliding Labels
by Binhai Zhu & Z.P. Qin
December 2001, Volume 5, Issue 4
- 383-395 Robot Map Verification of a Graph World
by Xiaotie Deng & Evangelos Milios & Andranik Mirzaian - 397-410 Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts
by Liang Zhao & Hiroshi Nagamochi & Toshihide Ibaraki - 411-420 The Greedier the Better: An Efficient Algorithm for Approximating Maximum Independent Set
by H.Y. Lau & H.F. Ting - 421-443 Quadratic Assignment Problems and M/G/C/C/ State Dependent Network Flows
by J. Macgregor Smith & Wu-Ji Li - 445-464 Tight Performance Bounds of CP-Scheduling on Out-Trees
by Nodari Vakhania - 465-494 Approximate and Exact Algorithms for Constrained (Un) Weighted Two-dimensional Two-staged Cutting Stock Problems
by Mhand Hifi & Catherine Roucairol - 495-496 Multichannel Optical Networks: Theory and Practice
by Mauricio G. C. Resende - 497-498 “Mobile Networks and Computing,”
by Mauricio G. C. Resende
September 2001, Volume 5, Issue 3
- 275-286 Minimum Cost Edge Subset Covering Exactly k Vertices of a Graph
by Jáan Plesník - 287-297 On Approximating a Scheduling Problem
by Pierluigi Crescenzi & Xiaotie Deng & Christos H. Papadimitriou - 299-315 On Disjunctive Cuts for Combinatorial Optimization
by Adam N. Letchford - 317-326 A $${{10}}$$ -Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem
by Robert Carr & Toshihiro Fujito & Goran Konjevod & Ojas Parekh - 327-343 A Polynomial Time Approximation Scheme for the Problem of Interconnecting Highways
by Xiuzhen Cheng & Joon-Mo Kim & Bing Lu - 345-375 Combinatorial Optimization in Real-Time Scheduling: Theory and Algorithms
by Shyh-In Hwang & Sheng-Tzong Cheng
June 2001, Volume 5, Issue 2
- 151-166 Restarting after Branching in the SDP Approach to MAX-CUT and Similar Combinatorial Optimization Problems
by John E. Mitchell - 167-173 Simple Approximation Algorithms for MAXNAESP and Hypergraph 2-colorability
by Daya Ram Gaur & Ramesh Krishnamurti - 175-212 Augmenting a Submodular and Posi-modular Set Function by a Multigraph
by Hiroshi Nagamochi & Takashi Shiraki & Toshihide Ibaraki - 213-231 A New Approximation Algorithm for the Capacitated Vehicle Routing Problem on a Tree
by Tetsuo Asano & Naoki Katoh & Kazuhiro Kawashima - 233-247 Approximation Algorithms for Bounded Facility Location Problems
by Piotr Krysta & Roberto Solis-Oba - 249-266 Finding a Noncrossing Steiner Forest in Plane Graphs Under a 2-Face Condition
by Yoshiyuki Kusakari & Daisuke Masubuchi & Takao Nishizeki
March 2001, Volume 5, Issue 1
- 7-8 Optimization Problems in Medical Applications
by Jie Wang - 9-26 Quadratic Binary Programming and Dynamical System Approach to Determine the Predictability of Epileptic Seizures
by L.D. Iasemidis & P. Pardalos & J.C. Sackellares & D.-S. Shiau - 27-41 Skeletonization of Volumetric Vascular Images—Distance Information Utilized for Visualization
by Ingela Nyström & Örjan Smedby - 43-58 On the Addition and Comparison of Graphs Labeled with Stochastic Variables: Learnable Anatomical Catalogs
by Peter Hall - 59-79 Determining an Optimal Penetration Among Weighted Regions in Two and Three Dimensions
by Danny Z. Chen & Ovidiu Daescu & Xiaobo (Sharon) Hu & Xiaodong Wu & Jinhui Xu - 81-94 Medical Surveillance, Frequent Sets, and Closure Operations
by Alan P. Sprague & Stephen E. Brossette - 95-115 A Heuristic Algorithm for Multiple Sequence Alignment Based on Blocks
by Peng Zhao & Tao Jiang - 117-124 Efficient Algorithms for Local Alignment Search
by S. Rajasekaran & H. Nick & P.M. Pardalos & S. Sahni & G. Shaw - 125-132 Efficient Algorithms for Similarity Search
by S. Rajasekaran & Y. Hu & J. Luo & H. Nick & P.M. Pardalos & S. Sahni & G. Shaw - 133-142 Tagged Probe Interval Graphs
by Li Sheng & Chi Wang & Peisen Zhang
December 2000, Volume 4, Issue 4
- 395-414 Some Results on Node Lifting of TSP Inequalities
by Robert Carr - 415-436 Generalized Steiner Problems and Other Variants
by Moshe Dror & Mohamed Haouari - 437-447 On Some Polyhedra Covering Problems
by Cao An Wang & Bo-Ting Yang & Binhai Zhu - 449-486 Incrementing Bipartite Digraph Edge-Connectivity
by Harold N. Gabow & Tibor Jordán - 487-503 Medial Axis and Optimal Locations for Min-Max Sphere Packing
by Jie Wang
September 2000, Volume 4, Issue 3
- 291-305 Graph Algorithms with Small Communication Costs
by Jieliang Zhou & Patrick Dymond & Xiaotie Deng - 307-323 Multi-phase Algorithms for Throughput Maximization for Real-Time Scheduling
by Piotr Berman & Bhaskar Dasgupta - 325-355 A Probabilistic Feasibility and Value Analysis of the Generalized Assignment Problem
by H. Edwin Romeijn & Nanda Piersma - 357-363 Polynomial Time Approximation Scheme for the Rectilinear Steiner Arborescence Problem
by Bing Lu & Lu Ruan - 365-388 Facets of an Assignment Problem with 0–1 Side Constraint
by Abdo Y. Alfakih & Tongnyoul Yi & Katta G. Murty
June 2000, Volume 4, Issue 2
- 151-169 A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs
by Hiroshi Nagamochi & Shigeki Katayama & Toshihide Ibaraki - 171-186 Approximation Algorithms for the Multiple Knapsack Problem with Assignment Restrictions
by M. Dawande & J. Kalagnanam & P. Keskinocak & F.S. Salman & R. Ravi - 187-195 On the Complexity of the Steiner Problem
by M. Brazil & D.A. Thomas & J.F. Weng - 197-215 A Semidefinite Programming Approach to the Quadratic Knapsack Problem
by C. Helmberg & F. Rendl & R. Weismantel - 217-233 An Efficient Algorithm for Delay Buffer Minimization
by Guoliang Xue & Shangzhi Sun & David H.C. Du & Lojun Shi - 235-251 On Integrality, Stability and Composition of Dicycle Packings and Covers
by Zeev Nutov & Michal Penn - 253-269 Combining Linear and Non-Linear Objectives in Spanning Tree Problems
by Mauro Dell'Amico & Francesco Maffioli - 271-284 A 75° Angle Constraint for Plane Minimal T1 Trees
by T. Cole
March 2000, Volume 4, Issue 1
- 5-5 Editorial
by Ding-Zhu Du - 7-33 Facility Dispersion Problems Under Capacity and Cost Constraints
by Daniel J. Rosenkrantz & Giri K. Tayi & S.S. Ravi - 35-77 Optimal Augmentation of a 2-Vertex-Connected Multigraph to a k-Edge-Connected and 3-Vertex-Connected Multigraph
by Toshimasa Ishii & Hiroshi Nagamochi & Toshihide Ibaraki - 79-98 Efficient Heuristics for Orientation Metric and Euclidean Steiner Tree Problems
by Y.Y. Li & K.S. Leung & C.K. Wong - 99-107 On Shortest k-Edge-Connected Steiner Networks in Metric Spaces
by Xiufeng Du & Xiaodong Hu & Xiaohua Jia - 109-129 Sequence Independent Lifting in Mixed Integer Programming
by Zonghao Gu & George L. Nemhauser & Martin W.P. Savelsbergh - 131-144 Steiner k-Edge Connected Subgraph Polyhedra
by M. Didi Biha & A.R. Mahjoub
December 1999, Volume 3, Issue 4
- 347-361 Practical Human-Machine Identification over Insecure Channels
by Xiang-Yang Li & Shang-Hua Teng - 363-377 An Approximation Scheme for Bin Packing with Conflicts
by Klaus Jansen - 379-397 Hybrid Evolutionary Algorithms for Graph Coloring
by Philippe Galinier & Jin-Kao Hao - 399-416 Randomized Online Scheduling with Delivery Times
by Steve Seiden - 417-435 Transversal Graphs for Partially Ordered Sets: Sequencing, Merging and Scheduling Problems
by Martin Middendorf & Vadim G. Timkovsky - 437-452 Close Approximations of Minimum Rectangular Coverings
by Joachim Gudmundsson & Christos Levcopoulos - 453-463 Packing of Unequal Spheres and Automated Radiosurgical Treatment Planning
by Jie Wang - 465-474 Inverse Problems of Matroid Intersection
by Cai Mao-Cheng
July 1999, Volume 3, Issue 2
- 147-148 Foreword
by Ying Xu & Saturo Miyano & Tom Head - 149-182 On the Tightness of the Alternating-Cycle Lower Bound for Sorting by Reversals
by Alberto Caprara - 183-197 On the Complexity of Constructing Evolutionary Trees
by Leszek Gasieniec & Jesper Jansson & Andrzej Lingas & Anna Östlin - 199-211 Approximation and Exact Algorithms for Constructing Minimum Ultrametric Trees from Distance Matrices
by Bang Ye Wu & Kun-Mao Chao & Chuan Yi Tang - 213-225 Fitting Distances by Tree Metrics with Increment Error
by Bin Ma & Lusheng Wang & Louxin Zhang - 227-245 Aligning DNA Sequences to Minimize the Change in Protein
by Yufang Hua & Tao Jiang & Bin Wu - 247-275 An Approximation Algorithm for Alignment of Multiple Sequences using Motif Discovery
by Laxmi Parida & Aris Floratos & Isidore Rigoutsos - 277-299 Horn Clause Computation with DNA Molecules
by Satoshi Kobayashi - 301-320 Combinatorial Optimization in Rapidly Mutating Drug-Resistant Viruses
by Richard H. Lathrop & Michael J. Pazzani - 321-336 Approximation and Exact Algorithms for RNA Secondary Structure Prediction and Recognition of Stochastic Context-free Languages
by Tatsuya Akutsu
July 1999, Volume 3, Issue 1
- 5-15 Minimizing the Number of Late Jobs under the Group Technology Assumption
by Zhaohui Liu & Wenci Yu - 17-30 Reduction of the Three-Partition Problem
by Mauro Dell'Amico & Silvano Martello - 31-50 A Probabilistic Analysis of the Capacitated Facility Location Problem
by Nanda Piersma - 51-58 The Steiner Tree Problem in Kalmanson Matrices and in Circulant Matrices
by Bettina Klinz & Gerhard J. Woeginger - 59-71 A New Fully Polynomial Time Approximation Scheme for the Knapsack Problem
by Hans Kellerer & Ulrich Pferschy - 73-88 Analysis of the List Scheduling Algorithm for Precedence Constrained Parallel Tasks
by Keqin Li - 89-94 A Note on the Max-Min 0-1 Knapsack Problem
by Hiroshi Iida - 95-114 Analyses on the 2 and 3-Flip Neighborhoods for the MAX SAT
by M. Yagiura & T. Ibaraki - 115-126 Inverse Polymatroidal Flow Problem
by Mao-Cheng Cai & Xiaoguang Yang & Yanjun Li - 127-139 Solution Structure of Some Inverse Combinatorial Optimization Problems
by Jianzhong Zhang & Zhongfan Ma
December 1998, Volume 2, Issue 4
- 299-306 A Two-Phase Exact Algorithm for MAX-SAT and Weighted MAX-SAT Problems
by Brian Borchers & Judith Furman - 307-332 Structure Prediction and Computation of Sparse Matrix Products
by Edith Cohen - 333-350 The Travelling Salesman Problem on Permuted Monge Matrices
by Rainer E. Burkard & Vladimir G. Deineko & Gerhard J. Woeginger - 351-359 Simple and Efficient Graph Compression Schemes for Dense and Complement Graphs
by Ming-Yang Kao & Neill Occhiogrosso & Shang-Hua Teng - 361-369 Constant-Level Greedy Triangulations Approximate the MWT Well
by Oswin Aichholzer & Franz Aurenhammer & Günter Rote & Yin-Feng Xu - 371-384 Generalized Diameters and Rabin Numbers of Networks
by Sheng-Chyang Liaw & Gerard J. Chang - 385-397 Probabilistic Nonadaptive and Two-Stage Group Testing with Relatively Small Pools and DNA Library Screening
by Anthony J. Macula - 399-412 A Greedy Randomized Adaptive Search Procedure for the Feedback Vertex Set Problem
by Panos M. Pardalos & Tianbing Qian & Mauricio G.C. Resende - 413-427 Sortabilities of Partition Properties
by Gerard J. Chang & Fu-Loong Chen & Lingling Huang & Frank K. Hwang & Su-Tzu Nuan & Uriel G. Rothblum & I-Fan Sun & Jan-Wen Wang & Hong-Gwa Yeh - 429-441 Localizing Combinatorial Properties for Partitions on Block Graphs
by G. J. Chang & F. K. Hwang & Y. C. Yao
September 1998, Volume 2, Issue 3
- 199-217 Facility Location with Dynamic Distance Functions
by Randeep Bhatia & Sudipto Guha & Samir Khuller & Yoram J. Sussmann - 219-236 A Case Study of De-randomization Methods for Combinatorial Approximation Algorithms
by José D.P. Rolim & Luca Trevisan - 237-256 A Unifying Augmentation Algorithm for Two-Edge Connectivity and Biconnectivity
by Tsan-sheng Hsu & Ming-Yang Kao - 257-288 Approximation Algorithms for Certain Network Improvement Problems
by Sven O. Krumke & Madhav V. Marathe & Hartmut Noltemeier & R. Ravi & S. S. Ravi
June 1998, Volume 2, Issue 2
- 117-188 Proof of Toft's Conjecture: Every Graph Containing No Fully Odd K4 is 3-Colorable
by Wenan Zang
March 1998, Volume 2, Issue 1
- 7-7 Preface
by P.M. Pardalos & H. Wolkowicz - 9-28 A Combined D.C. Optimization—Ellipsoidal Branch-and-Bound Algorithm for Solving Nonconvex Quadratic Programming Problems
by Le Thi Hoai An & Pham Dinh Tao & Le Dung Muu - 29-50 Approximation Algorithms for Quadratic Programming
by Minyue Fu & Zhi-Quan Luo & Yinyu Ye - 51-69 Polynomial Primal-Dual Affine Scaling Algorithms in Semidefinite Programming
by E. de Klerk & C. Roos & T. Terlaky - 71-109 Semidefinite Programming Relaxations for the Quadratic Assignment Problem
by Qing Zhao & Stefan E. Karisch & Franz Rendl & Henry Wolkowicz
December 1998, Volume 1, Issue 4
- 329-353 Job Shop Scheduling With Deadlines
by Egon Balas & Giuseppe Lancia & Paolo Serafini & Alkiviadis Vazacopoulos - 355-365 On-Line Scheduling of Two-Machine Open Shops Where Jobs Arrive Over Time
by Bo Chen & Arjen P.A. Vestjens & Gerhard J. Woeginger - 367-376 Efficient Algorithms for a Scheduling Problem and its Applications to Illicit Drug Market Crackdowns
by Pu Cai & Jin-yi Cai & Ashish V. Naik - 377-392 On Multiprocessor System Scheduling
by Xiaotie Deng & Patrick Dymond - 393-411 Optimal On-Line Scheduling of Parallel Jobs with Dependencies
by Anja Feldmann & Ming-Yang Kao & Jiří Sgall & Shang-Hua Teng - 413-426 Improved Bounds on Relaxations of a Parallel Machine Scheduling Problem
by Cynthia A. Phillips & Andreas S. Schulz & David B. Shmoys & Cliff Stein & Joel Wein - 427-456 Optimal Randomized Scheduling by Replacement
by Isaac Saias - 457-481 Closed-Form Deterministic End-to-End Performance Bounds for the Generalized Processor Sharing Scheduling Discipline
by Zhi-Li Zhang & Zhen Liu & Don Towsley
October 1997, Volume 1, Issue 3
- 209-210 Editorial
by Gang Yu - 211-228 A Grasp for Aircraft Routing in Response to Groundings and Delays
by Michael F. Argüello & Jonathan F. Bard & Gang Yu - 229-250 Quelling Cabin Noise in Turboprop Aircraft via Active Control
by Rex K. Kincaid & Keith E. Laba & Sharon L. Padula - 251-275 Decision Support for Airline Schedule Planning
by Dennis F.X. Mathaisel - 277-304 Using Prices More Realistically as Decision Variables in Perishable-Asset Revenue Management Problems
by Lawrence R. Weatherford - 305-321 Optimization Model and Algorithm for Crew Management During Airline Irregular Operations
by Guo Wei & Gang Yu & Mark Song
June 1997, Volume 1, Issue 2
- 115-127 A New Subgraph of Minimum Weight Triangulations
by Cao An Wang & Francis Chin & Yin-Feng Xu - 129-149 Scheduling Problems in a Practical Allocation Model
by Lisa Hollermann & Tsan-sheng Hsu & Dian Rae Lopez & Keith Vertanen - 151-164 Local Optimality and Its Application on Independent Sets for k-claw Free Graphs
by Gang Yu & Olivier Goldschmidt - 165-178 On Integer Programming Approaches for Morphological Template Decomposition Problems in Computer Vision
by P. Sussner & P.M. Pardalos & G.X. Ritter - 179-186 Near-Optimal Conflict-Free Channel Set Assignments for an Optical Cluster-Based Hypercube Network
by Peng-Jun Wan - 187-202 Efficient Detection and Protection of Information in Cross Tabulated Tables II: Minimal Linear Invariants
by Ming-Yang Kao
March 1997, Volume 1, Issue 1
- 5-46 Deterministic Õ(nm) Time Edge-Splitting in Undirected Graphs
by Hiroshi Nagamochi & Toshihide Ibaraki - 47-65 New Approximation Algorithms for the Steiner Tree Problems
by Marek Karpinski & Alexander Zelikovsky - 67-78 Compression Theorems and Steiner Ratios on Spheres
by J. H. Rubinstein & J. F. Weng - 79-104 Moments of Inertia and Graph Separators
by Keith D. Gremban & Gary L. Miller & Shang-Hua Teng - 105-105 Book Review: Discrete Analysis and operation Research
by Ding-Zhu Du
Undated
- 1-2 Preface: Combinatorial optimization drives the future of Health Care
by Liwei Zhong & Guochun Tang - 1-7 Max–min dispersion on a line
by Tetsuya Araki & Shin-ichi Nakano - 1-9 Three-sided matching problem with mixed preferences
by Feng Zhang & Liwei Zhong - 1-10 Bottleneck subset-type restricted matching problems
by Oleg Duginov - 1-11 Research of SVM ensembles in medical examination scheduling
by Yi Du & Hua Yu & Zhijun Li - 1-11 A primal-dual algorithm for the minimum power partial cover problem
by Menghong Li & Yingli Ran & Zhao Zhang - 1-11 Algorithmic aspect on the minimum (weighted) doubly resolving set problem of graphs
by Changhong Lu & Qingjie Ye & Chengru Zhu - 1-11 Capacitated vehicle routing problem on line with unsplittable demands
by Yuanxiao Wu & Xiwen Lu - 1-11 On the Roman domination subdivision number of a graph
by J. Amjadi & R. Khoeilar & M. Chellali & Z. Shao - 1-11 An optimized approach of venous thrombus embolism risk assessment
by Ruiping Wang & Mei Wang & Jian Chang & Zai Luo & Feng Zhang & Chen Huang - 1-11 Fitting PB1-p62 filaments model structure into its electron microscopy based on an improved genetic algorithm
by Zhihong Zhao & Beibei Li & Jun Liu - 1-12 The bi-criteria seeding algorithms for two variants of k-means problem
by Min Li - 1-12 An approximation algorithm for the uniform capacitated k-means problem
by Lu Han & Dachuan Xu & Donglei Du & Dongmei Zhang - 1-12 Perceived service quality’s effect on patient loyalty through patient attitude within the context of traditional Chinese medicine
by Hongbo Li & Li Wang & Xuan Xia & Hongbo Liu - 1-12 Computation and algorithm for the minimum k-edge-connectivity of graphs
by Yuefang Sun & Chenchen Wu & Xiaoyan Zhang & Zhao Zhang - 1-12 A tight approximation algorithm for problem $$P2\rightarrow D|v=1,c=1|C_{\max }$$P2→D|v=1,c=1|Cmax
by Yinling Wang & Yan Lan & Xin Chen & Xin Han & Yong Piao - 1-12 The spectral radius and domination number in linear uniform hypergraphs
by Liying Kang & Wei Zhang & Erfang Shan - 1-12 An intelligent data-driven model for disease diagnosis based on machine learning theory
by He Huang & Wei Gao & Chunming Ye - 1-13 An approximation algorithm for stochastic multi-level facility location problem with soft capacities
by Chenchen Wu & Donglei Du & Yue Kang - 1-13 Approximation algorithms for the selling with preference
by Pan Li & Qiang Hua & Zhijun Hu & Hing-Fung Ting & Yong Zhang - 1-13 On the complexity of and algorithms for detecting k-length negative cost cycles
by Longkun Guo & Peng Li - 1-13 Combinatorial approximation algorithms for the submodular multicut problem in trees with submodular penalties
by Xiaofei Liu & Weidong Li - 1-13 An approximation algorithm for a supply-chain scheduling problem with an assignable common due window and holding time
by Long Zhang & Yuzhong Zhang & Qingguo Bai - 1-13 Online scheduling on a single machine with linear deteriorating processing times and delivery times
by Xing Chai & Wenhua Li & Hang Yuan & Libo Wang - 1-13 A three-stage supply chain scheduling problem based on the nursing assistants’ daily work in a hospital
by Jing Fan & Hui Shi - 1-14 Conflict-free connection of trees
by Hong Chang & Meng Ji & Xueliang Li & Jingshu Zhang - 1-15 Mixed connectivity properties of random graphs and some special graphs
by Ran Gu & Yongtang Shi & Neng Fan - 1-15 Approximation approach for robust vessel fleet deployment problem with ambiguous demands
by E. Zhang & Feng Chu & Shijin Wang & Ming Liu & Yang Sui - 1-16 Average eccentricity, minimum degree and maximum degree in graphs
by P. Dankelmann & F. J. Osaye - 1-16 General restricted inverse assignment problems under $$l_1$$l1 and $$l_\infty $$l∞ norms
by Qin Wang & Tianyu Yang & Longshu Wu - 1-16 From packing rules to cost-sharing mechanisms
by Chenhao Zhang & Guochuan Zhang - 1-16 A general framework for path convexities
by João Vinicius C. Thompson & Loana T. Nogueira & Fábio Protti & Raquel S. F. Bravo & Mitre C. Dourado & Uéverton S. Souza - 1-16 Research on model and algorithm of TCM constitution identification based on artificial intelligence
by Bin Li & Qianghua Wei & Xinye Zhou - 1-16 Improved algorithms for ranking and unranking (k, m)-ary trees in B-order
by Yu-Hsuan Chang & Ro-Yu Wu & Ruay-Shiung Chang & Jou-Ming Chang - 1-16 Randomized selection algorithm for online stochastic unrelated machines scheduling
by Xiaoyan Zhang & Ran Ma & Jian Sun & Zan-Bo Zhang - 1-16 Improved algorithms for single vehicle scheduling on tree/cycle networks
by Yuanxiao Wu & Xiwen Lu