Content
January 2023, Volume 45, Issue 1
- 1-16 Approximation algorithms for the capacitated correlation clustering problem with penalties
by Sai Ji & Gaidi Li & Dongmei Zhang & Xianzhao Zhang - 1-16 RETRACTED ARTICLE: On $${A_{\alpha }}$$ A α -spectrum of a unicyclic graph
by Huan He & Miaolin Ye & Huan Xu & Guidong Yu - 1-16 Greedy guarantees for minimum submodular cost submodular/non-submodular cover problem
by Majun Shi & Zishen Yang & Wei Wang - 1-16 Polynomial time algorithm for k-vertex-edge dominating problem in interval graphs
by Peng Li & Aifa Wang - 1-16 Transitivity on subclasses of bipartite graphs
by Subhabrata Paul & Kamal Santra - 1-17 An optimal streaming algorithm for non-submodular functions maximization on the integer lattice
by Bin Liu & Zihan Chen & Huijuan Wang & Weili Wu - 1-17 Computing densest k-subgraph with structural parameters
by Tesshu Hanaka - 1-17 RETRACTED ARTICLE: Expression recognition algorithm based on MDS-HOG feature optimization and differential weights
by Kelei Sun & Mengqi He & Daoyi Zhang & Huaping Zhou - 1-17 Saturation numbers for disjoint stars
by Zequn Lv & Zhen He & Mei Lu - 1-18 RETRACTED ARTICLE: Sound absorption performance of EPDM-based textile composites investigated through the transfer matrix model
by Kun Wang & Wei Wang - 1-18 Two approximation algorithms for maximizing nonnegative weakly monotonic set functions
by Min Cui & Donglei Du & Dachuan Xu & Ruiqi Yang - 1-18 Vehicle scheduling problems with two agents on a line
by Hao Yan & Peihai Liu & Xiwen Lu - 1-19 Approximation algorithms for the lower bounded correlation clustering problem
by Sai Ji & Yinhong Dong & Donglei Du & Dongzhao Wang & Dachuan Xu - 1-19 Diversified-profit maximization in competitive social advertising
by Liman Du & Suixiang Gao & Wenguo Yang - 1-19 Cycle-connected mixed graphs and related problems
by Junran Lichen - 1-20 RETRACTED ARTICLE: Research on the influencing factors of living energy consumption and carbon emissions based on spatiotemporal model
by Yang Zhimao - 1-21 Algorithmic methods for covering arrays of higher index
by Ryan E. Dougherty & Kristoffer Kleine & Michael Wagner & Charles J. Colbourn & Dimitris E. Simos - 1-21 The weighted sitting closer to friends than enemies problem in the line
by Julio Aracena & Christopher Thraves Caro - 1-21 Faster algorithms for k-subset sum and variations
by Antonis Antonopoulos & Aris Pagourtzis & Stavros Petsalakis & Manolis Vasilakis - 1-21 Streaming submodular maximization under d-knapsack constraints
by Zihan Chen & Bin Liu & Hongmin W. Du - 1-21 A sharp upper bound for the transversal number of k-uniform connected hypergraphs with given size
by Zian Chen & Bin Chen & Zhongzheng Tang & Zhuo Diao - 1-21 Combinatorial approximation algorithms for the maximum bounded connected bipartition problem
by Xiaofei Liu & Yajie Li & Weidong Li & Jinhua Yang - 1-22 Approximation algorithms for some extensions of the maximum profit routing problem
by Bogdan Armaselu - 1-23 Novel modified convolutional neural network and FFA algorithm for fish species classification
by Pooja Prasenan & C. D. Suriyakala - 1-24 Bitcoin daily price prediction through understanding blockchain transaction pattern with machine learning methods
by Xiao Li & Linda Du - 1-25 Approximation algorithms for some min–max and minimum stacker crane cover problems
by Yuhui Sun & Wei Yu & Zhaohui Liu - 1-25 Modeling the relationship between fairness concern and customer loyalty in dual distribution channel
by Yingxiao Li & Jianheng Zhou - 1-27 An effective link prediction method in multiplex social networks using local random walk towards dependable pathways
by Wenjun Li & Ting Li & Kamal Berahmand - 1-27 Generalized self-profit maximization and complementary-profit maximization in attribute networks
by Liman Du & Suixiang Gao & Wenguo Yang - 1-28 Algorithms for influence maximization in socio-physical networks
by Hemant Gehlot & Shreyas Sundaram & Satish V. Ukkusuri - 1-28 RETRACTED ARTICLE: The mechanism and test of the impact of environmental regulation and technological innovation on high quality development
by Xiao-Hong Shi & Xiao Chen & Li Han & Ze-Jiong Zhou - 1-30 RETRACTED ARTICLE: Optimization design and implementation of shared information management system for industrial design network platform
by Na Qi & Xun Zhang - 1-30 Envy-freeness and relaxed stability: hardness and approximation algorithms
by Prem Krishnaa & Girija Limaye & Meghana Nasre & Prajakta Nimbhorkar - 1-30 Approximation algorithms for sorting by k-cuts on signed permutations
by Andre Rodrigues Oliveira & Alexsandro Oliveira Alexandrino & Géraldine Jean & Guillaume Fertin & Ulisses Dias & Zanoni Dias - 1-31 A polyhedral approach to least cost influence maximization in social networks
by Cheng-Lung Chen & Eduardo L. Pasiliao & Vladimir Boginski - 1-33 Maliciously roaming person's detection around hospital surface using intelligent cloud-edge based federated learning
by S. Gokulakrishnan & Muhammad Aslam Jarwar & Mohammed Hasan Ali & M. M. Kamruzzaman & Iyapparaja Meenakshisundaram & Mustafa Musa Jaber & R. Lakshmana Kumar
December 2022, Volume 44, Issue 5
- 3165-3193 A DC programming approach for solving a centralized group key management problem
by Hoai An Le Thi & Thi Tuyet Trinh Nguyen & Hoang Phuc Hau Luu - 3194-3211 Constructing tri-CISTs in shuffle-cubes
by Yu-Han Chen & Kung-Jui Pai & Hsin-Jung Lin & Jou-Ming Chang - 3212-3232 Private non-monotone submodular maximization
by Xin Sun & Gaidi Li & Yapu Zhang & Zhenning Zhang - 3233-3262 Convex-Concave fitting to successively updated data and its application to covid-19 analysis
by Demetrius E. Davos & Ioannis C. Demetriou - 3263-3293 Pancake graphs: Structural properties and conditional diagnosability
by Nai-Wen Chang & Hsuan-Jung Wu & Sun-Yuan Hsieh - 3294-3309 DPMA: a distributed profit-based placement scheme for multi-sp mobile edge computing
by Rui Mao & Hongwei Du - 3310-3330 Characterizing 3-uniform linear extremal hypergraphs on feedback vertex number
by Zhongzheng Tang & Yucong Tang & Zhuo Diao - 3331-3350 Partial inverse maximum spanning tree problem under the Chebyshev norm
by Xianyue Li & Ruowang Yang & Heping Zhang & Zhao Zhang - 3351-3363 Online data caching in edge-cloud collaborative system with the data center
by Xinxin Han & Sijia Dai & Guichen Gao & Yang Wang & Yong Zhang - 3364-3404 Online algorithms for the maximum k-interval coverage problem
by Songhua Li & Minming Li & Lingjie Duan & Victor C. S. Lee - 3405-3418 Exponential-time algorithms for parallel machine scheduling problems
by Olivier Ploton & Vincent T’kindt - 3419-3445 Algorithms for maximum internal spanning tree problem for some graph classes
by Gopika Sharma & Arti Pandey & Michael C. Wigal - 3446-3476 A column-generation-based approach for an integrated service planning and physician scheduling problem considering re-consultation
by Shaowen Lan & Wenjuan Fan & Kaining Shao & Shanlin Yang & Panos M. Pardalos - 3477-3494 RETRACTED ARTICLE: Capacitance pin defect detection based on deep learning
by Cheng Cheng & Ning Dai & Jie Huang & Yahong Zhuang & Tao Tang & Longlong Liu - 3495-3519 Linear time algorithms on mirror trees
by Alain Quilliot & Djamal Rebaine - 3520-3534 Bounding quality of pure Nash equilibria in dual-role facility location games
by Xin Chen & Wenjing Liu & Qingqin Nong & Qizhi Fang - 3535-3548 Online scheduling with migration on two hierarchical machines
by Islam Akaria & Leah Epstein - 3549-3574 Fast algorithms for supermodular and non-supermodular minimization via bi-criteria strategy
by Xiaojuan Zhang & Qian Liu & Min Li & Yang Zhou - 3575-3594 Computing a consensus trajectory in a vehicular network
by Peng Zou & Letu Qingge & Qing Yang & Binhai Zhu - 3595-3610 A local search 4/3-approximation algorithm for the minimum 3-path partition problem
by Yong Chen & Randy Goebel & Guohui Lin & Longcheng Liu & Bing Su & Weitian Tong & Yao Xu & An Zhang - 3611-3640 Learn from history for online bipartite matching
by Huili Zhang & Rui Du & Kelin Luo & Weitian Tong - 3641-3662 Generalized opinion dynamics model for social trust networks
by Changxiang He & Jiayuan Zeng & Guang Zhang & Shuting Liu - 3663-3700 Optimal dynamic mining policy of blockchain selfish mining through sensitivity-based optimization
by Jing-Yu Ma & Quan-Lin Li - 3701-3710 Faster deterministic algorithms for Co-path Packing and Co-path/cycle Packing
by Dekel Tsur - 3711-3734 Using the method of conditional expectations to supply an improved starting point for CCLS
by Daniel Berend & Shahar Golan & Yochai Twitto - 3735-3777 RETRACTED ARTICLE: Industrial structure optimization, economic development factors and regional economic risk prevention in post COVID-19 period: empirical analysis based on panel data of Guangdong regional economy
by Dongwu Wu & Linlin Wu & Yongbo Ye - 3778-3791 Performance prediction and optimization for healthcare enterprises in the context of the COVID-19 pandemic: an intelligent DEA-SVM model
by He Huang & Liwei Zhong & Ting Shen & Huixin Wang
November 2022, Volume 44, Issue 4
- 2167-2179 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 - 2180-2194 Approximation approach for robust vessel fleet deployment problem with ambiguous demands
by E. Zhang & Feng Chu & Shijin Wang & Ming Liu & Yang Sui - 2195-2206 A tight approximation algorithm for problem $$P2\rightarrow D|v=1,c=1|C_{\max }$$ P 2 → D | v = 1 , c = 1 | C max
by Yinling Wang & Yan Lan & Xin Chen & Xin Han & Yong Piao - 2207-2223 Due date assignment and two-agent scheduling under multitasking environment
by Yongjian Yang & Guangqiang Yin & Chunyu Wang & Yunqiang Yin - 2224-2245 Truthful mechanism design for bin packing with applications on cloud computing
by Deshi Ye & Feng Xie & Guochuan Zhang - 2246-2268 Online economic ordering problem for deteriorating items with limited price information
by Wenqiang Dai & Meng Zheng & Xu Chen & Zhuolin Yang - 2269-2285 Parameterized algorithms and complexity for the traveling purchaser problem and its variants
by Mingyu Xiao & Jianan Zhang & Weibo Lin - 2286-2301 Principal–agent problem under the linear contract
by Guichen Gao & Xinxin Han & Li Ning & Hing-Fung Ting & Yong Zhang - 2302-2323 Intersections and circuits in sets of line segments
by Boris Brimkov & Jesse Geneson & Alathea Jensen & Jordan Broussard & Pouria Salehi Nowbandegani - 2324-2346 Regularized graph cuts based discrete tomography reconstruction methods
by Marina Marčeta & Tibor Lukić - 2347-2374 Relative-perfectness of discrete gradient vector fields and multi-parameter persistent homology
by Claudia Landi & Sara Scaramuccia - 2375-2394 The spherical k-means++ algorithm via local search scheme
by Xiaoyun Tian & Dachuan Xu & Donglei Du & Ling Gai - 2395-2409 1-Attempt parallel thinning
by Kálmán Palágyi & Gábor Németh - 2410-2422 An approximation algorithm for the spherical k-means problem with outliers by local search
by Yishui Wang & Chenchen Wu & Dongmei Zhang & Juan Zou - 2423-2442 Further steps on the reconstruction of convex polyominoes from orthogonal projections
by Paolo Dulio & Andrea Frosini & Simone Rinaldi & Lama Tarsissi & Laurent Vuillon - 2443-2459 Data source selection for approximate query
by Hongjie Guo & Jianzhong Li & Hong Gao - 2460-2481 A data structure for efficiently managing a set of energy functions
by Jacques Carlier & Antoine Jouglet & Eric Pinson & Abderrahim Sahli - 2482-2498 A new lower bound for the eternal vertex cover number of graphs
by Jasine Babu & Veena Prabhakaran - 2499-2514 Approximation algorithms with constant ratio for general cluster routing problems
by Xiaoyan Zhang & Donglei Du & Gregory Gutin & Qiaoxia Ming & Jian Sun - 2515-2532 An integrated model for medical expense system optimization during diagnosis process based on artificial intelligence algorithm
by He Huang & Po-Chou Shih & Yuelan Zhu & Wei Gao - 2533-2550 Improved local search algorithms for Bregman k-means and its variants
by Xiaoyun Tian & Dachuan Xu & Longkun Guo & Dan Wu - 2551-2576 The enforcement of ECA regulations: inspection strategy for on-board fuel sampling
by Lingyue Li & Suixiang Gao & Wenguo Yang - 2577-2597 Study on the incentive and coordination mechanism of tumor healthcare alliance based on evolutionary game
by Gengjun Gao & Zhen Wu & Shuyun Wang - 2598-2625 Nonsubmodular constrained profit maximization from increment perspective
by Liman Du & Shengminjie Chen & Suixiang Gao & Wenguo Yang - 2626-2641 Approximation algorithms for stochastic set cover and single sink rent-or-buy with submodular penalty
by Jian Sun & Haiyun Sheng & Yuefang Sun & Donglei Du & Xiaoyan Zhang - 2642-2660 Local routing in a tree metric 1-spanner
by Milutin Brankovic & Joachim Gudmundsson & André van Renssen - 2661-2680 Characterizing slope regions
by Rocio Gonzalez-Diaz & Darshan Batavia & Rocio M. Casablanca & Walter G. Kropatsch - 2681-2699 Constructing tree decompositions of graphs with bounded gonality
by Hans L. Bodlaender & Josse Dobben de Bruyn & Dion Gijswijt & Harry Smit - 2700-2728 Uniform Voronoi tessellation of digital manifolds: a GPU-based algorithm with applications to remeshing
by Ashutosh Soni & Partha Bhowmick - 2729-2747 Surface polygonization of 3D objects using norm similarity
by Somrita Saha & Arindam Biswas - 2748-2761 Optimal frequency assignment and planar list L(2, 1)-labeling
by Haiyang Zhu & Junlei Zhu & Ying Liu & Shuling Wang & Danjun Huang & Lianying Miao - 2762-2781 W[1]-hardness of the k-center problem parameterized by the skeleton dimension
by Johannes Blum - 2782-2808 An integrated method for hybrid distribution with estimation of demand matching degree
by Ling Gai & Ying Jin & Binyuan Zhang - 2809-2831 A new metric to compare local community detection algorithms in social networks using geodesic distance
by Sahar Bakhtar & Hovhannes A. Harutyunyan - 2832-2852 1-line minimum rectilinear steiner trees and related problems
by Jianping Li & Junran Lichen & Wencheng Wang & Jean Yeh & YeongNan Yeh & Xingxing Yu & Yujie Zheng - 2853-2870 HM-EIICT: Fairness-aware link prediction in complex networks using community information
by Akrati Saxena & George Fletcher & Mykola Pechenizkiy - 2871-2892 On the enumeration of minimal non-pairwise compatibility graphs
by Naveed Ahmed Azam & Aleksandar Shurbevski & Hiroshi Nagamochi - 2893-2918 On the restricted k-Steiner tree problem
by Prosenjit Bose & Anthony D’Angelo & Stephane Durocher - 2919-2945 Measuring the influence and amplification of users on social network with unsupervised behaviors learning and efficient interaction-based knowledge graph
by Quan M. Tran & Hien D. Nguyen & Tai Huynh & Kha V. Nguyen & Suong N. Hoang & Vuong T. Pham - 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