Content
June 2000, Volume 4, Issue 2
- 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 - 1-17 Due date assignment and two-agent scheduling under multitasking environment
by Yongjian Yang & Guangqiang Yin & Chunyu Wang & Yunqiang Yin - 1-17 Analysis of consensus sorting via the cycle metric
by Ivan Avramovic & Dana S. Richards - 1-17 Related machine scheduling with machine speeds satisfying linear constraints
by Siyun Zhang & Kameng Nip & Zhenbo Wang - 1-17 An improved linear convergence of FISTA for the LASSO problem with application to CT image reconstruction
by Qian Li & Wei Zhang - 1-17 Parameterized algorithms and complexity for the traveling purchaser problem and its variants
by Mingyu Xiao & Jianan Zhang & Weibo Lin - 1-17 Complexity and characterization aspects of edge-related domination for graphs
by Zhuo Pan & Xianyue Li & Shou-Jun Xu - 1-18 A dynamic approach to detecting, eliminating and fixing memory leaks
by Bin Yu & Cong Tian & Nan Zhang & Zhenhua Duan & Hongwei Du - 1-18 Research on dispatch of drugs and consumables in SPD warehouse of large scale hospital under uncertain environment: take respiratory consumables as an example
by Huidan Lin & Qun Li & Xueguo Xu & Ying Zhang - 1-18 The principal eigenvector to $$\alpha $$α-spectral radius of hypergraphs
by Jing Wang & Liying Kang & Erfang Shan - 1-18 The seeding algorithm for spherical k-means clustering with penalties
by Sai Ji & Dachuan Xu & Longkun Guo & Min Li & Dongmei Zhang - 1-18 A novel kernel-free nonlinear SVM for semi-supervised classification in disease diagnosis
by Xin Yan & Hongmiao Zhu & Jian Luo - 1-18 Medical consumable usage control based on Canopy_K-means clustering and WARM
by Ying Yang & Huijing Wu & Caixia Yan - 1-18 Path optimization for joint distribution of medical consumables under hospital SPD supply chain mode
by Gengjun Gao & Yuxuan Che & Jian Shen - 1-18 Improved gray neural network model for healthcare waste recycling forecasting
by Hao Hao & Ji Zhang & Qian Zhang & Li Yao & Yichen Sun - 1-19 Exact algorithms for finding constrained minimum spanning trees
by Pei Yao & Longkun Guo - 1-19 Energy-efficient weak-barrier coverage with adaptive sensor rotation
by Catalina Aranzazu-Suescun & Mihaela Cardei - 1-19 Early warning of venous thromboembolism after surgery based on self-organizing competitive network
by Shi Yin & Jian Chang & Hailan Pan & Haizhou Mao & Mei Wang - 1-19 On the complexity and approximability of repair position selection problem
by Xianmin Liu & Yingshu Li & Jianzhong Li & Yuqiang Feng - 1-19 More on limited packings in graphs
by Xuqing Bai & Hong Chang & Xueliang Li - 1-19 The complexity of total edge domination and some related results on trees
by Zhuo Pan & Yu Yang & Xianyue Li & Shou-Jun Xu - 1-19 An improved algorithm for the $$(n, 3)$$ ( n , 3 ) -MaxSAT problem: asking branchings to satisfy the clauses
by Chao Xu & Wenjun Li & Jianxin Wang & Yongjie Yang - 1-19 The price of fairness for a two-agent scheduling game minimizing total completion time
by Yubai Zhang & Zhao Zhang & Zhaohui Liu - 1-19 The effects of price subsidy and fairness concern on pricing and benefits of take-away supply chain
by Hui Zhang & Kai Luo & Guanqun Ni - 1-19 On weak Pareto optimality of nonatomic routing networks
by Xujin Chen & Zhuo Diao & Xiaodong Hu - 1-19 Power domination on triangular grids with triangular and hexagonal shape
by Prosenjit Bose & Valentin Gledel & Claire Pennarun & Sander Verdonschot - 1-20 Maximum weight induced matching in some subclasses of bipartite graphs
by B. S. Panda & Arti Pandey & Juhi Chaudhary & Piyush Dane & Manav Kashyap - 1-20 Approximation algorithms for two variants of correlation clustering problem
by Sai Ji & Dachuan Xu & Min Li & Yishui Wang - 1-20 The new treatment mode research of hepatitis B based on ant colony algorithm
by Jing Yu & Lining Xing & Xu Tan - 1-20 Atomic congestion games with random players: network equilibrium and the price of anarchy
by Chenlan Wang & Xuan Vinh Doan & Bo Chen - 1-20 An approximation algorithm for the maximum spectral subgraph problem
by Cristina Bazgan & Paul Beaujean & Éric Gourdin - 1-20 A completely positive formulation of the graph isomorphism problem and its positive semidefinite relaxation
by Pawan Aurora & Shashank K. Mehta - 1-20 Online pickup and delivery problem with constrained capacity to minimize latency
by Haiyan Yu & Xianwei Luo & Tengyu Wu - 1-20 On the price of anarchy of two-stage machine scheduling games
by Deshi Ye & Lin Chen & Guochuan Zhang - 1-21 Reconfiguration of garbage collection system based on Voronoi graph theory: a simulation case of Beijing region
by Chun-lin Xin & Shuo Liang & Feng-wu Shen - 1-21 Isolation branching: a branch and bound algorithm for the k-terminal cut problem
by Mark Velednitsky & Dorit S. Hochbaum - 1-21 Computing an $$L_1$$L1 shortest path among splinegonal obstacles in the plane
by Tameem Choudhury & R. Inkulu - 1-21 An improved mechanism for selfish bin packing
by Xin Chen & Qingqin Nong & Qizhi Fang - 1-21 Approximation algorithms for the maximally balanced connected graph tripartition problem
by Guangting Chen & Yong Chen & Zhi-Zhong Chen & Guohui Lin & Tian Liu & An Zhang - 1-22 Medical rolling bearing fault prognostics based on improved extreme learning machine
by Cheng He & Changchun Liu & Tao Wu & Ying Xu & Yang Wu & Tong Chen - 1-22 Truthful mechanism design for bin packing with applications on cloud computing
by Deshi Ye & Feng Xie & Guochuan Zhang - 1-22 A balm: defend the clique-based attack from a fundamental aspect
by Meng Han & Dongjing Miao & Jinbao Wang & Liyuan Liu - 1-22 On the approximability of Time Disjoint Walks
by Alexandre Bayen & Jesse Goodman & Eugene Vinitsky - 1-22 Approximation algorithms for constructing required subgraphs using stock pieces of fixed length
by Junran Lichen & Jianping Li & Ko-Wei Lih & Xingxing Yu - 1-22 Batch scheduling of nonidentical job sizes with minsum criteria
by Rongqi Li & Zhiyi Tan & Qianyu Zhu - 1-22 Robustly assigning unstable items
by Ananya Christman & Christine Chung & Nicholas Jaczko & Scott Westvold & David S. Yuen - 1-22 Risk prediction of hypertension complications based on the intelligent algorithm optimized Bayesian network
by Gang Du & Xi Liang & Xiaoling Ouyang & Chunming Wang - 1-22 Single machine batch scheduling with two non-disjoint agents and splitable jobs
by Zhichao Geng & Jiayu Liu - 1-23 Outpatient appointment scheduling problem considering patient selection behavior: data modeling and simulation optimization
by Xuanzhu Fan & Jiafu Tang & Chongjun Yan & Hainan Guo & Zhongfa Cao - 1-23 Online economic ordering problem for deteriorating items with limited price information
by Wenqiang Dai & Meng Zheng & Xu Chen & Zhuolin Yang - 1-23 Integer linear programming formulations of the filter partitioning minimization problem
by Hazhar Rahmani & Jason M. O’Kane - 1-23 Big data driven urban railway planning: Shenzhen metro case study
by Wen Xu & Caiwei Yuan & Keke Peng & Hongwei Du - 1-23 Tropical paths in vertex-colored graphs
by Johanne Cohen & Giuseppe F. Italiano & Yannis Manoussakis & Nguyen Kim Thang & Hong Phong Pham - 1-23 A spectral partitioning algorithm for maximum directed cut problem
by Zhenning Zhang & Donglei Du & Chenchen Wu & Dachuan Xu & Dongmei Zhang - 1-23 Multiprocessor open shop problem: literature review and future directions
by Zeynep Adak & Mahmure Övül Arıoğlu Akan & Serol Bulkan - 1-24 Maximizing a monotone non-submodular function under a knapsack constraint
by Zhenning Zhang & Bin Liu & Yishui Wang & Dachuan Xu & Dongmei Zhang - 1-24 Online traveling salesman problem with time cost and non-zealous server
by Tengyu Wu & Lin He & Haiyan Yu - 1-24 Crossing minimization in perturbed drawings
by Radoslav Fulek & Csaba D. Tóth - 1-24 A rapid learning automata-based approach for generalized minimum spanning tree problem
by Masoumeh Zojaji & Mohammad Reza Mollakhalili Meybodi & Kamal Mirzaie - 1-24 Personalized manufacturing service composition recommendation: combining combinatorial optimization and collaborative filtering
by Shuangyao Zhao & Qiang Zhang & Zhanglin Peng & Xiaonong Lu - 1-24 A multi-period ambulance location and allocation problem in the disaster
by Jian Wang & Yin Wang & Mingzhu Yu - 1-25 A sparse optimization problem with hybrid $$L_2{\text {-}}L_p$$L2-Lp regularization for application of magnetic resonance brain images
by Xuerui Gao & Yanqin Bai & Qian Li - 1-25 Algorithms for the metric ring star problem with fixed edge-cost ratio
by Xujin Chen & Xiaodong Hu & Xiaohua Jia & Zhongzheng Tang & Chenhao Wang & Ying Zhang - 1-26 Emergency medical center location problem with people evacuation solved by extended TODIM and objective programming
by Ling Gai & Zhiyue Peng & Jiming Zhang & Jiafu Zhang - 1-26 Selfish colorful bin packing games
by Vittorio Bilò & Francesco Cellinese & Giovanna Melideo & Gianpiero Monaco - 1-26 Eco-friendly container transshipment route scheduling problem with repacking operations
by Ming Liu & Rongfan Liu & E Zhang & Chengbin Chu - 1-26 Fast computation of global solutions to the single-period unit commitment problem
by Cheng Lu & Zhibin Deng & Shu-Cherng Fang & Qingwei Jin & Wenxun Xing - 1-28 A multi-objective and multi-period optimization model for urban healthcare waste’s reverse logistics network design
by Zhiguo Wang & Lufei Huang & Cici Xiao He - 1-28 The band collocation problem
by Hakan Kutucu & Arif Gursoy & Mehmet Kurt & Urfat Nuriyev - 1-29 Weighted thresholding homotopy method for sparsity constrained optimization
by Wenxing Zhu & Huating Huang & Lanfan Jiang & Jianli Chen - 1-29 Computing equilibrium in network utility-sharing and discrete election games
by Rahul Swamy & Timothy Murray - 1-30 A class of exponential neighbourhoods for the quadratic travelling salesman problem
by Brad D. Woods & Abraham P. Punnen - 1-31 Joint optimal pricing and advertising policies in a fashion supply chain under the ODM strategy considering fashion level and goodwill
by Qi Chen & Qi Xu - 1-32 Tighter price of anarchy for selfish task allocation on selfish machines
by Xiayan Cheng & Rongheng Li & Yunxia Zhou - 1-33 Searching and inferring colorful topological motifs in vertex-colored graphs
by Diego P. Rubert & Eloi Araujo & Marco A. Stefanes & Jens Stoye & Fábio V. Martinez - 1-33 Coordination mechanisms for scheduling selfish jobs with favorite machines
by Cong Chen & Yinfeng Xu - 1-34 Bipartite communities via spectral partitioning
by Kelly B. Yancey & Matthew P. Yancey - 1-34 The one-cop-moves game on planar graphs
by Ziyuan Gao & Boting Yang - 1-35 On theoretical and empirical algorithmic analysis of the efficiency gap measure in partisan gerrymandering
by Tanima Chatterjee & Bhaskar DasGupta & Laura Palmieri & Zainab Al-Qurashi & Anastasios Sidiropoulos - 1-37 A multi-objective simulated annealing to solve an identical parallel machine scheduling problem with deterioration effect and resources consumption constraints
by Norelhouda Sekkal & Fayçal Belkaid - 1-39 Shortest paths among transient obstacles
by Anil Maheshwari & Arash Nouri & Jörg-Rüdiger Sack