Printed from https://ideas.repec.org/s/spr/jcomop3.html
Content
November 2022, Volume 44, Issue 4
- 2946-2962 Bicriteria streaming algorithms to balance gain and cost with cardinality constraint
by Yijing Wang & Dachuan Xu & Donglei Du & Yanjun Jiang - 2963-2980 On zero-error codes produced by greedy algorithms
by Marcin Jurkiewicz - 2981-2995 Topology preservation on the BCC grid
by Péter Kardos - 2996-3022 TLHSA and SACA: two heuristic algorithms for two variant VRP models
by Xuhong Cai & Li Jiang & Songhu Guo & Hejiao Huang & Hongwei Du - 3023-3037 Unfolding H-convex Manhattan Towers
by Lydie Richaume & Eric Andres & Gaëlle Largeteau-Skapin & Rita Zrour - 3038-3055 Strong Euler well-composedness
by Nicolas Boutry & Rocio Gonzalez-Diaz & Maria-Jose Jimenez & Eduardo Paluzo-Hildago - 3056-3082 Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane
by Sanjana Agrawal & R. Inkulu - 3083-3105 A study of feature representation via neural network feature extraction and weighted distance for clustering
by Lily Schleider & Eduardo L. Pasiliao & Zhecheng Qiang & Qipeng P. Zheng - 3106-3135 Computing a maximum clique in geometric superclasses of disk graphs
by Nicolas Grelier - 3136-3152 The optimization of self-interference in wideband full-duplex phased array with joint transmit and receive beamforming
by Xiaoxin Wang & Zhipeng Jiang & Wenguo Yang & Suixiang Gao - 3153-3164 Triangle packing and covering in dense random graphs
by Zhongzheng Tang & Zhuo Diao
October 2022, Volume 44, Issue 3
- 1377-1386 Error-correcting codes based on partial linear maps of finite-dimensional vector spaces
by Junli Liu & Wei Jiang & Xuedong Zhang - 1387-1432 A sustainable supply chain network considering lot sizing with quantity discounts under disruption risks: centralized and decentralized models
by Parisa Rafigh & Ali Akbar Akbari & Hadi Mohammadi Bidhandi & Ali Husseinzadeh Kashan - 1433-1458 On metric dimension of plane graphs with $$\frac{m}{2}$$ m 2 number of 10 sided faces
by Sunny Kumar Sharma & Vijay Kumar Bhat - 1459-1494 An approximation algorithm for a general class of multi-parametric optimization problems
by Stephan Helfrich & Arne Herzel & Stefan Ruzika & Clemens Thielen - 1495-1510 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 - 1511-1536 Fast computation of global solutions to the single-period unit commitment problem
by Cheng Lu & Zhibin Deng & Shu-Cherng Fang & Qingwei Jin & Wenxun Xing - 1537-1555 Energy-efficient weak-barrier coverage with adaptive sensor rotation
by Catalina Aranzazu-Suescun & Mihaela Cardei - 1556-1577 Robustly assigning unstable items
by Ananya Christman & Christine Chung & Nicholas Jaczko & Scott Westvold & David S. Yuen - 1578-1593 From packing rules to cost-sharing mechanisms
by Chenhao Zhang & Guochuan Zhang - 1594-1614 Computing an $$L_1$$ L 1 shortest path among splinegonal obstacles in the plane
by Tameem Choudhury & R. Inkulu - 1615-1636 On the approximability of Time Disjoint Walks
by Alexandre Bayen & Jesse Goodman & Eugene Vinitsky - 1637-1658 A balm: defend the clique-based attack from a fundamental aspect
by Meng Han & Dongjing Miao & Jinbao Wang & Liyuan Liu - 1659-1679 Isolation branching: a branch and bound algorithm for the k-terminal cut problem
by Mark Velednitsky & Dorit S. Hochbaum - 1680-1692 An approximation algorithm for stochastic multi-level facility location problem with soft capacities
by Chenchen Wu & Donglei Du & Yue Kang - 1693-1704 The bi-criteria seeding algorithms for two variants of k-means problem
by Min Li - 1705-1723 On weak Pareto optimality of nonatomic routing networks
by Xujin Chen & Zhuo Diao & Xiaodong Hu - 1724-1740 Related machine scheduling with machine speeds satisfying linear constraints
by Siyun Zhang & Kameng Nip & Zhenbo Wang - 1741-1752 Computation and algorithm for the minimum k-edge-connectivity of graphs
by Yuefang Sun & Chenchen Wu & Xiaoyan Zhang & Zhao Zhang - 1753-1773 Approximation algorithms for the maximally balanced connected graph tripartition problem
by Guangting Chen & Yong Chen & Zhi-Zhong Chen & Guohui Lin & Tian Liu & An Zhang - 1774-1795 Approximation algorithms for constructing required subgraphs using stock pieces of fixed length
by Junran Lichen & Jianping Li & Ko-Wei Lih & Xingxing Yu - 1796-1811 Randomized selection algorithm for online stochastic unrelated machines scheduling
by Xiaoyan Zhang & Ran Ma & Jian Sun & Zan-Bo Zhang - 1812-1823 An approximation algorithm for the uniform capacitated k-means problem
by Lu Han & Dachuan Xu & Donglei Du & Dongmei Zhang - 1824-1830 Max–min dispersion on a line
by Tetsuya Araki & Shin-ichi Nakano - 1831-1847 Analysis of consensus sorting via the cycle metric
by Ivan Avramovic & Dana S. Richards - 1848-1879 Tighter price of anarchy for selfish task allocation on selfish machines
by Xiayan Cheng & Rongheng Li & Yunxia Zhou - 1880-1899 An approximation algorithm for the maximum spectral subgraph problem
by Cristina Bazgan & Paul Beaujean & Éric Gourdin - 1900-1912 Online scheduling on a single machine with linear deteriorating processing times and delivery times
by Xing Chai & Wenhua Li & Hang Yuan & Libo Wang - 1913-1923 A primal-dual algorithm for the minimum power partial cover problem
by Menghong Li & Yingli Ran & Zhao Zhang - 1924-1952 Weighted thresholding homotopy method for sparsity constrained optimization
by Wenxing Zhu & Huating Huang & Lanfan Jiang & Jianli Chen - 1953-1963 Capacitated vehicle routing problem on line with unsplittable demands
by Yuanxiao Wu & Xiwen Lu - 1964-1976 Combinatorial approximation algorithms for the submodular multicut problem in trees with submodular penalties
by Xiaofei Liu & Weidong Li - 1977-1994 The seeding algorithm for spherical k-means clustering with penalties
by Sai Ji & Dachuan Xu & Longkun Guo & Min Li & Dongmei Zhang - 1995-2028 Bipartite communities via spectral partitioning
by Kelly B. Yancey & Matthew P. Yancey - 2029-2039 Algorithmic aspect on the minimum (weighted) doubly resolving set problem of graphs
by Changhong Lu & Qingjie Ye & Chengru Zhu - 2040-2055 General restricted inverse assignment problems under $$l_1$$ l 1 and $$l_\infty $$ l ∞ norms
by Qin Wang & Tianyu Yang & Longshu Wu - 2056-2084 Computing equilibrium in network utility-sharing and discrete election games
by Rahul Swamy & Timothy Murray - 2085-2103 Exact algorithms for finding constrained minimum spanning trees
by Pei Yao & Longkun Guo - 2104-2122 The price of fairness for a two-agent scheduling game minimizing total completion time
by Yubai Zhang & Zhao Zhang & Zhaohui Liu - 2123-2142 Atomic congestion games with random players: network equilibrium and the price of anarchy
by Chenlan Wang & Xuan Vinh Doan & Bo Chen - 2143-2166 Online traveling salesman problem with time cost and non-zealous server
by Tengyu Wu & Lin He & Haiyan Yu
September 2022, Volume 44, Issue 2
- 905-920 A sifting-edges algorithm for accelerating the computation of absolute 1-center in graphs
by Wei Ding & Ke Qiu & Yu Zhou & Zhou Ye - 921-933 Paired domination versus domination and packing number in graphs
by Magda Dettlaff & Didem Gözüpek & Joanna Raczek - 934-946 Leafy spanning k-forests
by Cristina G. Fernandes & Carla N. Lintzmayer & Mário César San Felice - 947-969 Particle swarm optimization based-algorithms to solve the two-machine cross-docking flow shop problem: just in time scheduling
by Imen Hamdi & Imen Boujneh - 970-978 A note on the minimum power partial cover problem on the plane
by Han Dai & Bin Deng & Weidong Li & Xiaofei Liu - 979-1010 Algorithms for covering multiple submodular constraints and applications
by Chandra Chekuri & Tanmay Inamdar & Kent Quanrud & Kasturi Varadarajan & Zhao Zhang - 1011-1038 A vector evaluated evolutionary algorithm with exploitation reinforcement for the dynamic pollution routing problem
by Nasreddine Ouertani & Hajer Ben-Romdhane & Saoussen Krichen & Issam Nouaouri - 1039-1059 Online routing and searching on graphs with blocked edges
by Davood Shiri & Hakan Tozan - 1060-1076 Competitive analysis of online machine rental and online parallel machine scheduling problems with workload fence
by Feifeng Zheng & Yuhong Chen & Ming Liu & Yinfeng Xu - 1077-1098 Estimation of distribution algorithms using Gaussian Bayesian networks to solve industrial optimization problems constrained by environment variables
by Vicente P. Soloviev & Pedro Larrañaga & Concha Bielza - 1099-1103 Comment on “Approximation algorithms for quadratic programming”
by Tongli Zhang & Yong Xia - 1104-1133 An efficient approach for searching optimal multi-keywords coverage routes
by Rong Yang & Baoning Niu & Pengfei Jin - 1134-1160 The min-p robust optimization approach for facility location problem under uncertainty
by Zhizhu Lai & Qun Yue & Zheng Wang & Dongmei Ge & Yulong Chen & Zhihong Zhou - 1161-1198 Sharp upper bound of injective coloring of planar graphs with girth at least 5
by Qiming Fang & Li Zhang - 1199-1220 The upper bounds on the Steiner k-Wiener index in terms of minimum and maximum degrees
by Wanping Zhang & Jixiang Meng & Baoyindureng Wu - 1221-1247 Steiner tree in k-star caterpillar convex bipartite graphs: a dichotomy
by D. H. Aneesh & A. Mohanapriya & P. Renjith & N. Sadagopan - 1248-1264 Lease or financial lease? Deterministic strategies for on-line financial lease problem with the second-hand transaction
by Yong Zhang & Jiahao Li & Xingyu Yang & Xiaohui Wang - 1265-1283 Computing the sequence of k-cardinality assignments
by Amnon Rosenmann - 1284-1322 Job-shop scheduling-joint consideration of production, transport, and storage/retrieval systems
by Dalila B. M. M. Fontes & S. Mahdi Homayouni & Mauricio G. C. Resende - 1323-1329 The fractional matching preclusion number of complete n-balanced k-partite graphs
by Yu Luan & Mei Lu & Yi Zhang - 1330-1355 Minimizing total weighted late work on a single-machine with non-availability intervals
by Shi-Sheng Li & Ren-Xia Chen - 1356-1375 2-Distance list $$(\Delta +2)$$ ( Δ + 2 ) -coloring of planar graphs with girth at least 10
by Hoang La & Mickael Montassier
August 2022, Volume 44, Issue 1
- 1-20 A general greedy approximation algorithm for finding minimum positive influence dominating sets in social networks
by Weidong Chen & Hao Zhong & Lidong Wu & Ding-Zhu Du - 21-50 Modeling and optimizing an agro-supply chain considering different quality grades and storage systems for fresh products: a Benders decomposition solution approach
by Fatemeh Keshavarz-Ghorbani & Seyed Hamid Reza Pasandideh - 51-73 Network construction/restoration problems: cycles and complexity
by Tianyu Wang & Igor Averbakh - 74-93 The sum of root-leaf distance interdiction problem by upgrading edges/nodes on trees
by Qiao Zhang & Xiucui Guan & Junhua Jia & Xinqiang Qian - 94-118 Greedy algorithms for the profit-aware social team formation problem
by Shengxin Liu & Chung Keung Poon - 119-135 On total and edge coloring some Kneser graphs
by C. M. H. de Figueiredo & C. S. R. Patrão & D. Sasaki & M. Valencia-Pabon - 136-153 Monochromatic disconnection: Erdős-Gallai-type problems and product graphs
by Ping Li & Xueliang Li - 154-171 Maximum properly colored trees in edge-colored graphs
by Jie Hu & Hao Li & Shun-ichi Maezawa - 172-206 A speciation-based bilevel niching method for multimodal truss design problems
by Md. Jakirul Islam & Xiaodong Li & Kalyanmoy Deb - 207-222 Parallel-machine scheduling of jobs with mixed job-, machine- and position-dependent processing times
by Bartłomiej Przybylski - 223-241 A variable neighborhood search algorithm for human resource selection and optimization problem in the home appliance manufacturing industry
by Xing Ji & Baoyu Liao & Shanlin Yang - 242-268 A novel approach to subgraph selection with multiple weights on arcs
by Mohammad Ali Raayatpanah & Salman Khodayifar & Thomas Weise & Panos Pardalos - 269-286 A linear-time algorithm for weighted paired-domination on block graphs
by Ching-Chi Lin & Cheng-Yu Hsieh & Ta-Yu Mu - 287-302 Sufficient conditions for the optimality of the greedy algorithm in greedoids
by Dávid Szeszlér - 303-330 Results on vertex-edge and independent vertex-edge domination
by Subhabrata Paul & Keshav Ranjan - 331-342 The effect of vertex and edge deletion on the edge metric dimension of graphs
by Meiqin Wei & Jun Yue & Lily Chen - 343-353 Approximation algorithm for the parallel-machine scheduling problem with release dates and submodular rejection penalties
by Hongye Zheng & Suogang Gao & Wen Liu & Weili Wu & Ding-Zhu Du & Bo Hou - 354-378 Joint chance-constrained staffing optimization in multi-skill call centers
by Tien Thanh Dam & Thuy Anh Ta & Tien Mai - 379-413 Improved formulations and branch-and-cut algorithms for the angular constrained minimum spanning tree problem
by Alexandre Salles Cunha - 414-434 Competitive algorithm for scheduling of sharing machines with rental discount
by Yinfeng Xu & Rongteng Zhi & Feifeng Zheng & Ming Liu - 435-445 The signed edge-domatic number of nearly cubic graphs
by Jia-Xiong Dan & Zhi-Bo Zhu & Xin-Kui Yang & Ru-Yi Li & Wei-Jie Zhao & Xiang-Jun Li - 446-479 Single-machine multitasking scheduling with job efficiency promotion
by Min Ji & Yingchun Zhang & Yuan Zhang & T. C. E. Cheng & Yiwei Jiang - 480-497 Single machine scheduling with non-availability interval and optional job rejection
by Baruch Mor & Dana Shapira - 498-517 Strengthening a linear reformulation of the 0-1 cubic knapsack problem via variable reordering
by Richard J. Forrester & Lucas A. Waddell - 518-531 An online trading problem with an increasing number of available products
by Wenming Zhang & Ye Zhang & Yongxi Cheng & Shankui Zheng - 532-556 Allocation and optimization of shared self-service check-in system based on integer programming model
by Ying Liu & Xiuqing Yang & Yong Xiang & Yi Chen & Gang Mao & Xinzhi Zhou - 557-582 Pattern-based ILP models for the one-dimensional cutting stock problem with setup cost
by Mateus Martin & Horacio Hideki Yanasse & Luiz Leduíno Salles-Neto - 583-602 A solution approach for cardinality minimization problem based on fractional programming
by S. M. Mirhadi & S. A. MirHassani - 603-616 Further results on the total monochromatic connectivity of graphs
by Yanhong Gao & Ping Li & Xueliang Li - 617-634 Hierarchy cost of hierarchical clusterings
by Felix Bock - 635-669 Election control through social influence with voters’ uncertainty
by Mohammad Abouei Mehrizi & Federico Corò & Emilio Cruciani & Gianlorenzo D’Angelo - 670-689 Competitive analysis for two-option online leasing problem under sharing economy
by Yong Zhang & Jingting Wu & Wenxiong Lin & Muyu Hou - 690-722 A tardiness-augmented approximation scheme for rejection-allowed multiprocessor rescheduling
by Wenchang Luo & Rylan Chin & Alexander Cai & Guohui Lin & Bing Su & An Zhang - 723-751 Maximizing k-submodular functions under budget constraint: applications and streaming algorithms
by Canh V. Pham & Quang C. Vu & Dung K. T. Ha & Tai T. Nguyen & Nguyen D. Le - 752-769 A heuristic approximation algorithm of minimum dominating set based on rough set theory
by Lihe Guan & Hong Wang - 770-793 OnML: an ontology-based approach for interpretable machine learning
by Pelin Ayranci & Phung Lai & Nhathai Phan & Han Hu & Alexander Kolinowski & David Newman & Deijing Dou - 794-849 An efficient spread-based evolutionary algorithm for solving dynamic multi-objective optimization problems
by Alireza Falahiazar & Arash Sharifi & Vahid Seydi - 850-876 Multi-objective multi-verse optimiser for integrated two-sided assembly sequence planning and line balancing
by Mohd Fadzil Faisae Ab Rashid & Nik Mohd Zuki Nik Mohamed & Ahmad Nasser Mohd Rose - 877-893 Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing
by Mingyang Gong & Randy Goebel & Guohui Lin & Eiji Miyano - 894-904 Finding a minimal spanning hypertree of a weighted hypergraph
by G. H. Shirdel & B. Vaez-Zadeh
July 2022, Volume 43, Issue 5
- 909-932 A multi-period ambulance location and allocation problem in the disaster
by Jian Wang & Yin Wang & Mingzhu Yu - 933-952 Approximation algorithms for two variants of correlation clustering problem
by Sai Ji & Dachuan Xu & Min Li & Yishui Wang - 953-973 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 - 974-993 Online pickup and delivery problem with constrained capacity to minimize latency
by Haiyan Yu & Xianwei Luo & Tengyu Wu - 994-1009 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 - 1010-1035 Eco-friendly container transshipment route scheduling problem with repacking operations
by Ming Liu & Rongfan Liu & E Zhang & Chengbin Chu - 1036-1074 Shortest paths among transient obstacles
by Anil Maheshwari & Arash Nouri & Jörg-Rüdiger Sack - 1075-1105 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 - 1106-1124 The effects of price subsidy and fairness concern on pricing and benefits of take-away supply chain
by Hui Zhang & Kai Luo & Guanqun Ni - 1125-1148 Maximizing a monotone non-submodular function under a knapsack constraint
by Zhenning Zhang & Bin Liu & Yishui Wang & Dachuan Xu & Dongmei Zhang - 1149-1172 Online machine minimization with lookahead
by Cong Chen & Huili Zhang & Yinfeng Xu - 1173-1202 Multimode time-cost-robustness trade-off project scheduling problem under uncertainty
by Xue Li & Zhengwen He & Nengmin Wang & Mario Vanhoucke - 1203-1239 Super-stability in the student-project allocation problem with ties
by Sofiat Olaosebikan & David Manlove - 1240-1263 Online scheduling of car-sharing request pairs between two locations
by Kelin Luo & Yinfeng Xu & Haodong Liu - 1264-1279 Incremental optimization of independent sets under the reconfiguration framework
by Takehiro Ito & Haruka Mizuta & Naomi Nishimura & Akira Suzuki - 1280-1297 Online leasing problem with price fluctuations and the second-hand transaction
by Xin Feng & Chengbin Chu - 1298-1327 A bi-objective decision model and method for the integrated optimization of bus line planning and lane reservation
by Peng Wu & Ling Xu & Ada Che & Feng Chu - 1328-1358 An approximation algorithm for a general class of parametric optimization problems
by Cristina Bazgan & Arne Herzel & Stefan Ruzika & Clemens Thielen & Daniel Vanderpooten - 1359-1367 Single machine lot scheduling with non-uniform lot capacities and processing times
by Ying Chen & Yongxi Cheng & Guiqing Zhang - 1368-1390 Weighted amplifiers and inapproximability results for Travelling Salesman problem
by Miroslav Chlebík & Janka Chlebíková - 1391-1404 A traffic congestion analysis by user equilibrium and system optimum with incomplete information
by Qiang Zhang & Shi Qiang Liu & Mahmoud Masoud - 1405-1422 Distance constrained vehicle routing problem to minimize the total cost: algorithms and complexity
by Wei Yu & Zhaohui Liu & Xiaoguang Bao - 1423-1446 Novel distribution-free model and method for stochastic disassembly line balancing with limited distributional information
by Peng Hu & Feng Chu & Yunfei Fang & Peng Wu - 1447-1469 Optimal pricing of crowdsourcing logistics services with social delivery capacity
by Wenjie Wang & Lei Xie - 1470-1492 On the relationship between energy complexity and other boolean function measures
by Xiaoming Sun & Yuan Sun & Kewen Wu & Zhiyu Xia - 1493-1506 Optimal conditions for connectedness of discretized sets
by Boris Brimkov & Valentin E. Brimkov - 1507-1508 Preface
by Bo Chen & Dachuan Xu & Guochuan Zhang - 1509-1533 Optimal Steiner trees under node and edge privacy conflicts
by Alessandro Hill & Roberto Baldacci & Stefan Voß - 1534-1544 Smaller universal targets for homomorphisms of edge-colored graphs
by Grzegorz Guśpiel - 1545-1570 A simple method for proving lower bounds in the zero-visibility cops and robber game
by Yuan Xue & Boting Yang & Sandra Zilles - 1571-1601 Heuristics for cross-docking scheduling of truck arrivals, truck departures and shop-floor operations
by Feifeng Zheng & Yaxin Pang & Yinfeng Xu - 1602-1627 Exact algorithms for scheduling programs with shared tasks
by Imed Kacem & Giorgio Lucarelli & Théo Nazé - 1628-1644 Strategyproof mechanisms for 2-facility location games with minimax envy
by Xin Chen & Qizhi Fang & Wenjing Liu & Yuan Ding & Qingqin Nong - 1645-1654 Non-resumable scheduling on a single bounded parallel-batch machine with periodic maintenance
by Jing Fan & Hui Shi - 1655-1670 Fast algorithms for maximizing monotone nonsubmodular functions
by Bin Liu & Miaomiao Hu - 1671-1690 Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint
by Min Cui & Dachuan Xu & Longkun Guo & Dan Wu
May 2022, Volume 43, Issue 4
- 699-709 Population monotonicity in matching games
by Han Xiao & Qizhi Fang - 710-726 Adjacent vertex distinguishing edge coloring of IC-planar graphs
by Zhuoya Liu & Changqing Xu - 727-784 Metaheuristic algorithms for the bandwidth reduction of large-scale matrices
by S. L. Gonzaga de Oliveira & C. Carvalho - 785-817 An ant colony optimization approach for the proportionate multiprocessor open shop
by Zeynep Adak & Mahmure Övül Arıoğlu & Serol Bulkan - 818-849 Allocation rules for cooperative games with restricted communication and a priori unions based on the Myerson value and the average tree solution
by Sylvain Béal & Eric Rémila & Philippe Solal - 850-869 Spanning tree of a multiple graph
by Alexander V. Smirnov - 870-908 Equilibrium customer and socially optimal balking strategies in a constant retrial queue with multiple vacations and N-policy
by Zhen Wang & Liwei Liu & Yiqiang Q. Zhao
April 2022, Volume 43, Issue 3
- 497-527 Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty
by Marc Goerigk & Adam Kasperski & Paweł Zieliński - 528-542 Linear-size universal discretization of geometric center-based problems in fixed dimensions
by Vladimir Shenmaier - 543-570 The maximum average connectivity among all orientations of a graph
by Rocío M. Casablanca & Peter Dankelmann & Wayne Goddard & Lucas Mol & Ortrud Oellermann - 571-588 Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph
by Yong Chen & Yinhui Cai & Longcheng Liu & Guangting Chen & Randy Goebel & Guohui Lin & Bing Su & An Zhang - 589-612 Advancing local search approximations for multiobjective combinatorial optimization problems
by Lakmali Weerasena - 613-629 Lower bounds for batched bin packing
by János Balogh & József Békési & György Dósa & Leah Epstein & Asaf Levin - 630-645 Rescheduling problems with allowing for the unexpected new jobs arrival
by Xingong Zhang & Win-Chin Lin & Chin-Chia Wu - 646-671 A value for cooperative games with coalition and probabilistic graph structures
by Jilei Shi & Lei Cai & Erfang Shan & Wenrong Lyu - 672-696 Adaptive online portfolio strategy based on exponential gradient updates
by Yong Zhang & Hong Lin & Lina Zheng & Xingyu Yang - 697-697 Correction To: Solving $$(k-1)$$ ( k - 1 ) -stable instances of k-terminal cut with isolating cuts
by Mark Velednitsky
March 2022, Volume 43, Issue 2
- 297-311 Solving $$(k-1)$$ ( k - 1 ) -stable instances of k-terminal cut with isolating cuts
by Mark Velednitsky - 312-349 Optimized threshold-based convolutional neural network for plant leaf classification: a challenge towards untrained data
by Bhanuprakash Dudi & V. Rajesh - 350-362 A PTAS for non-resumable open shop scheduling with an availability constraint
by Yuan Yuan & Yan Lan & Ning Ding & Xin Han - 363-383 On the complexity of minimum q-domination partization problems
by Sayani Das & Sounaka Mishra - 384-401 Decomposability of a class of k-cutwidth critical graphs
by Zhen-Kun Zhang & Zhong Zhao & Liu-Yong Pang - 402-431 Computing directed Steiner path covers
by Frank Gurski & Dominique Komander & Carolin Rehs & Jochen Rethmann & Egon Wanke - 432-443 Approximation algorithms for simple assembly line balancing problems
by Santiago Valdés Ravelo - 444-459 Discouraging pool block withholding attacks in Bitcoin
by Zhihuai Chen & Bo Li & Xiaohan Shan & Xiaoming Sun & Jialin Zhang - 460-496 Determining the edge metric dimension of the generalized Petersen graph P(n, 3)
by David G. L. Wang & Monica M. Y. Wang & Shiqiang Zhang
January 2022, Volume 43, Issue 1
- 1-27 Structure and pancyclicity of maximal planar graphs with diameter two
by Shu-Yu Cui & Yiqiao Wang & Danjun Huang & Hongwei Du & Weifan Wang - 28-41 Independent domination in subcubic graphs
by A. Akbari & S. Akbari & A. Doosthosseini & Z. Hadizadeh & Michael A. Henning & A. Naraghi - 42-64 A simple two-agent system for multi-objective flexible job-shop scheduling
by Yingli Li & Jiahai Wang & Zhengwei Liu - 65-78 k-Wiener index of a k-plex
by Zhongyuan Che - 79-97 Minmax common flow-allowance problems with convex resource allocation and position-dependent workloads
by Baruch Mor - 98-115 A new allocation rule for the housing market problem with ties
by Xinsheng Xiong & Xianjia Wang & Kun He - 116-139 Single-machine scheduling problems with general truncated sum-of-actual-processing-time-based learning effect
by Zhongyi Jiang & Fangfang Chen & Xiandong Zhang - 140-167 Distributionally robust maximum probability shortest path problem
by Rashed Khanjani-Shiraz & Ali Babapour-Azar & Zohreh Hosseini-Noudeh & Panos M. Pardalos - 168-199 A two-machine no-wait flow shop problem with two competing agents
by Abdennour Azerine & Mourad Boudhar & Djamal Rebaine - 200-225 Some graph optimization problems with weights satisfying linear constraints
by Kameng Nip & Tianning Shi & Zhenbo Wang - 226-234 The Steiner cycle and path cover problem on interval graphs
by Ante Ćustić & Stefan Lendl - 235-252 Angular bisector insertion algorithm for solving small-scale symmetric and asymmetric traveling salesman problem
by Jian Lin & Xiangfei Zeng & Jianxun Liu & Keqin Li - 253-264 A note on maximum fractional matchings of graphs
by Tianlong Ma & Eddie Cheng & Yaping Mao & Xu Wang - 265-296 A modified DEA cross efficiency method with negative data and its application in supplier selection
by Mehdi Soltanifar & Hamid Sharafi
November 2021, Volume 42, Issue 4
- 675-676 Preface: Combinatorial optimization drives the future of Health Care
by Liwei Zhong & Guochun Tang - 677-699 Outpatient appointment scheduling problem considering patient selection behavior: data modeling and simulation optimization
by Xuanzhu Fan & Jiafu Tang & Chongjun Yan & Hainan Guo & Zhongfa Cao - 700-721 Medical rolling bearing fault prognostics based on improved extreme learning machine
by Cheng He & Changchun Liu & Tao Wu & Ying Xu & Yang Wu & Tong Chen - 722-739 Medical consumable usage control based on Canopy_K-means clustering and WARM
by Ying Yang & Huijing Wu & Caixia Yan - 740-759 The new treatment mode research of hepatitis B based on ant colony algorithm
by Jing Yu & Lining Xing & Xu Tan - 760-784 A sparse optimization problem with hybrid $$L_2{\text {-}}L_p$$ L 2 - L p regularization for application of magnetic resonance brain images
by Xuerui Gao & Yanqin Bai & Qian Li - 785-812 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 - 813-830 Improved gray neural network model for healthcare waste recycling forecasting
by Hao Hao & Ji Zhang & Qian Zhang & Li Yao & Yichen Sun - 831-847 An improved linear convergence of FISTA for the LASSO problem with application to CT image reconstruction
by Qian Li & Wei Zhang