Ausgabe 2/2022
Inhalt (22 Artikel)
A sifting-edges algorithm for accelerating the computation of absolute 1-center in graphs
Wei Ding, Ke Qiu, Yu Zhou, Zhou Ye
Paired domination versus domination and packing number in graphs
Magda Dettlaff, Didem Gözüpek, Joanna Raczek
A note on the minimum power partial cover problem on the plane
Han Dai, Bin Deng, Weidong Li, Xiaofei Liu
Algorithms for covering multiple submodular constraints and applications
Chandra Chekuri, Tanmay Inamdar, Kent Quanrud, Kasturi Varadarajan, Zhao Zhang
A vector evaluated evolutionary algorithm with exploitation reinforcement for the dynamic pollution routing problem
Nasreddine Ouertani, Hajer Ben-Romdhane, Saoussen Krichen, Issam Nouaouri
Competitive analysis of online machine rental and online parallel machine scheduling problems with workload fence
Feifeng Zheng, Yuhong Chen, Ming Liu, Yinfeng Xu
Estimation of distribution algorithms using Gaussian Bayesian networks to solve industrial optimization problems constrained by environment variables
Vicente P. Soloviev, Pedro Larrañaga, Concha Bielza
An efficient approach for searching optimal multi-keywords coverage routes
Rong Yang, Baoning Niu, Pengfei Jin
The min-p robust optimization approach for facility location problem under uncertainty
Zhizhu Lai, Qun Yue, Zheng Wang, Dongmei Ge, Yulong Chen, Zhihong Zhou
Sharp upper bound of injective coloring of planar graphs with girth at least 5
Qiming Fang, Li Zhang
The upper bounds on the Steiner k-Wiener index in terms of minimum and maximum degrees
Wanping Zhang, Jixiang Meng, Baoyindureng Wu
Steiner tree in k-star caterpillar convex bipartite graphs: a dichotomy
D. H. Aneesh, A. Mohanapriya, P. Renjith, N. Sadagopan
Lease or financial lease? Deterministic strategies for on-line financial lease problem with the second-hand transaction
Yong Zhang, Jiahao Li, Xingyu Yang, Xiaohui Wang
Job-shop scheduling-joint consideration of production, transport, and storage/retrieval systems
Dalila B. M. M. Fontes, S. Mahdi Homayouni, Mauricio G. C. Resende
The fractional matching preclusion number of complete n-balanced k-partite graphs
Yu Luan, Mei Lu, Yi Zhang
Minimizing total weighted late work on a single-machine with non-availability intervals
Shi-Sheng Li, Ren-Xia Chen