Journal of Combinatorial Optimization

1997 - 2025

Current editor(s): Thai, My T.

From Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

Access Statistics for this journal.
Is something missing from the series or not right? See the RePEc data check for the archive and series.

2022, volume 44, articles 5

A DC programming approach for solving a centralized group key management problem pp. 3165-3193

Hoai An Le Thi, Thi Tuyet Trinh Nguyen and Hoang Phuc Hau Luu

Constructing tri-CISTs in shuffle-cubes pp. 3194-3211

Yu-Han Chen, Kung-Jui Pai, Hsin-Jung Lin and Jou-Ming Chang

Private non-monotone submodular maximization pp. 3212-3232

Xin Sun, Gaidi Li, Yapu Zhang and Zhenning Zhang

Convex-Concave fitting to successively updated data and its application to covid-19 analysis pp. 3233-3262

Demetrius E. Davos and Ioannis C. Demetriou

Pancake graphs: Structural properties and conditional diagnosability pp. 3263-3293

Nai-Wen Chang, Hsuan-Jung Wu and Sun-Yuan Hsieh

DPMA: a distributed profit-based placement scheme for multi-sp mobile edge computing pp. 3294-3309

Rui Mao and Hongwei Du

Characterizing 3-uniform linear extremal hypergraphs on feedback vertex number pp. 3310-3330

Zhongzheng Tang, Yucong Tang and Zhuo Diao

Partial inverse maximum spanning tree problem under the Chebyshev norm pp. 3331-3350

Xianyue Li, Ruowang Yang, Heping Zhang and Zhao Zhang

Online data caching in edge-cloud collaborative system with the data center pp. 3351-3363

Xinxin Han, Sijia Dai, Guichen Gao, Yang Wang and Yong Zhang

Online algorithms for the maximum k-interval coverage problem pp. 3364-3404

Songhua Li, Minming Li, Lingjie Duan and Victor C. S. Lee

Exponential-time algorithms for parallel machine scheduling problems pp. 3405-3418

Olivier Ploton and Vincent T’kindt

Algorithms for maximum internal spanning tree problem for some graph classes pp. 3419-3445

Gopika Sharma, Arti Pandey and Michael C. Wigal

A column-generation-based approach for an integrated service planning and physician scheduling problem considering re-consultation pp. 3446-3476

Shaowen Lan, Wenjuan Fan, Kaining Shao, Shanlin Yang and Panos M. Pardalos

RETRACTED ARTICLE: Capacitance pin defect detection based on deep learning pp. 3477-3494

Cheng Cheng, Ning Dai, Jie Huang, Yahong Zhuang, Tao Tang and Longlong Liu

Linear time algorithms on mirror trees pp. 3495-3519

Alain Quilliot and Djamal Rebaine

Bounding quality of pure Nash equilibria in dual-role facility location games pp. 3520-3534

Xin Chen, Wenjing Liu, Qingqin Nong and Qizhi Fang

Online scheduling with migration on two hierarchical machines pp. 3535-3548

Islam Akaria and Leah Epstein

Fast algorithms for supermodular and non-supermodular minimization via bi-criteria strategy pp. 3549-3574

Xiaojuan Zhang, Qian Liu, Min Li and Yang Zhou

Computing a consensus trajectory in a vehicular network pp. 3575-3594

Peng Zou, Letu Qingge, Qing Yang and Binhai Zhu

A local search 4/3-approximation algorithm for the minimum 3-path partition problem pp. 3595-3610

Yong Chen, Randy Goebel, Guohui Lin, Longcheng Liu, Bing Su, Weitian Tong, Yao Xu and An Zhang

Learn from history for online bipartite matching pp. 3611-3640

Huili Zhang, Rui Du, Kelin Luo and Weitian Tong

Generalized opinion dynamics model for social trust networks pp. 3641-3662

Changxiang He, Jiayuan Zeng, Guang Zhang and Shuting Liu

Optimal dynamic mining policy of blockchain selfish mining through sensitivity-based optimization pp. 3663-3700

Jing-Yu Ma and Quan-Lin Li

Faster deterministic algorithms for Co-path Packing and Co-path/cycle Packing pp. 3701-3710

Dekel Tsur

Using the method of conditional expectations to supply an improved starting point for CCLS pp. 3711-3734

Daniel Berend, Shahar Golan and Yochai Twitto

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 pp. 3735-3777

Dongwu Wu, Linlin Wu and Yongbo Ye

Performance prediction and optimization for healthcare enterprises in the context of the COVID-19 pandemic: an intelligent DEA-SVM model pp. 3778-3791

He Huang, Liwei Zhong, Ting Shen and Huixin Wang

2022, volume 44, articles 4

An approximation algorithm for a supply-chain scheduling problem with an assignable common due window and holding time pp. 2167-2179

Long Zhang, Yuzhong Zhang and Qingguo Bai

Approximation approach for robust vessel fleet deployment problem with ambiguous demands pp. 2180-2194

E. Zhang, Feng Chu, Shijin Wang, Ming Liu and Yang Sui

A tight approximation algorithm for problem $$P2\rightarrow D|v=1,c=1|C_{\max }$$ P 2 → D | v = 1, c = 1 | C max pp. 2195-2206

Yinling Wang, Yan Lan, Xin Chen, Xin Han and Yong Piao

Due date assignment and two-agent scheduling under multitasking environment pp. 2207-2223

Yongjian Yang, Guangqiang Yin, Chunyu Wang and Yunqiang Yin

Truthful mechanism design for bin packing with applications on cloud computing pp. 2224-2245

Deshi Ye, Feng Xie and Guochuan Zhang

Online economic ordering problem for deteriorating items with limited price information pp. 2246-2268

Wenqiang Dai, Meng Zheng, Xu Chen and Zhuolin Yang

Parameterized algorithms and complexity for the traveling purchaser problem and its variants pp. 2269-2285

Mingyu Xiao, Jianan Zhang and Weibo Lin

Principal–agent problem under the linear contract pp. 2286-2301

Guichen Gao, Xinxin Han, Li Ning, Hing-Fung Ting and Yong Zhang

Intersections and circuits in sets of line segments pp. 2302-2323

Boris Brimkov, Jesse Geneson, Alathea Jensen, Jordan Broussard and Pouria Salehi Nowbandegani

Regularized graph cuts based discrete tomography reconstruction methods pp. 2324-2346

Marina Marčeta and Tibor Lukić

Relative-perfectness of discrete gradient vector fields and multi-parameter persistent homology pp. 2347-2374

Claudia Landi and Sara Scaramuccia

The spherical k-means++ algorithm via local search scheme pp. 2375-2394

Xiaoyun Tian, Dachuan Xu, Donglei Du and Ling Gai

1-Attempt parallel thinning pp. 2395-2409

Kálmán Palágyi and Gábor Németh

An approximation algorithm for the spherical k-means problem with outliers by local search pp. 2410-2422

Yishui Wang, Chenchen Wu, Dongmei Zhang and Juan Zou

Further steps on the reconstruction of convex polyominoes from orthogonal projections pp. 2423-2442

Paolo Dulio, Andrea Frosini, Simone Rinaldi, Lama Tarsissi and Laurent Vuillon

Data source selection for approximate query pp. 2443-2459

Hongjie Guo, Jianzhong Li and Hong Gao

A data structure for efficiently managing a set of energy functions pp. 2460-2481

Jacques Carlier, Antoine Jouglet, Eric Pinson and Abderrahim Sahli

A new lower bound for the eternal vertex cover number of graphs pp. 2482-2498

Jasine Babu and Veena Prabhakaran

Approximation algorithms with constant ratio for general cluster routing problems pp. 2499-2514

Xiaoyan Zhang, Donglei Du, Gregory Gutin, Qiaoxia Ming and Jian Sun

An integrated model for medical expense system optimization during diagnosis process based on artificial intelligence algorithm pp. 2515-2532

He Huang, Po-Chou Shih, Yuelan Zhu and Wei Gao

Improved local search algorithms for Bregman k-means and its variants pp. 2533-2550

Xiaoyun Tian, Dachuan Xu, Longkun Guo and Dan Wu

The enforcement of ECA regulations: inspection strategy for on-board fuel sampling pp. 2551-2576

Lingyue Li, Suixiang Gao and Wenguo Yang

Study on the incentive and coordination mechanism of tumor healthcare alliance based on evolutionary game pp. 2577-2597

Gengjun Gao, Zhen Wu and Shuyun Wang

Nonsubmodular constrained profit maximization from increment perspective pp. 2598-2625

Liman Du, Shengminjie Chen, Suixiang Gao and Wenguo Yang

Approximation algorithms for stochastic set cover and single sink rent-or-buy with submodular penalty pp. 2626-2641

Jian Sun, Haiyun Sheng, Yuefang Sun, Donglei Du and Xiaoyan Zhang

Local routing in a tree metric 1-spanner pp. 2642-2660

Milutin Brankovic, Joachim Gudmundsson and André van Renssen

Characterizing slope regions pp. 2661-2680

Rocio Gonzalez-Diaz, Darshan Batavia, Rocio M. Casablanca and Walter G. Kropatsch

Constructing tree decompositions of graphs with bounded gonality pp. 2681-2699

Hans L. Bodlaender, Josse Dobben de Bruyn, Dion Gijswijt and Harry Smit

Uniform Voronoi tessellation of digital manifolds: a GPU-based algorithm with applications to remeshing pp. 2700-2728

Ashutosh Soni and Partha Bhowmick

Surface polygonization of 3D objects using norm similarity pp. 2729-2747

Somrita Saha and Arindam Biswas

Optimal frequency assignment and planar list L(2, 1)-labeling pp. 2748-2761

Haiyang Zhu, Junlei Zhu, Ying Liu, Shuling Wang, Danjun Huang and Lianying Miao

W[1]-hardness of the k-center problem parameterized by the skeleton dimension pp. 2762-2781

Johannes Blum

An integrated method for hybrid distribution with estimation of demand matching degree pp. 2782-2808

Ling Gai, Ying Jin and Binyuan Zhang

A new metric to compare local community detection algorithms in social networks using geodesic distance pp. 2809-2831

Sahar Bakhtar and Hovhannes A. Harutyunyan

1-line minimum rectilinear steiner trees and related problems pp. 2832-2852

Jianping Li, Junran Lichen, Wencheng Wang, Jean Yeh, YeongNan Yeh, Xingxing Yu and Yujie Zheng

HM-EIICT: Fairness-aware link prediction in complex networks using community information pp. 2853-2870

Akrati Saxena, George Fletcher and Mykola Pechenizkiy

On the enumeration of minimal non-pairwise compatibility graphs pp. 2871-2892

Naveed Ahmed Azam, Aleksandar Shurbevski and Hiroshi Nagamochi

On the restricted k-Steiner tree problem pp. 2893-2918

Prosenjit Bose, Anthony D’Angelo and Stephane Durocher

Measuring the influence and amplification of users on social network with unsupervised behaviors learning and efficient interaction-based knowledge graph pp. 2919-2945

Quan M. Tran, Hien D. Nguyen, Tai Huynh, Kha V. Nguyen, Suong N. Hoang and Vuong T. Pham

Bicriteria streaming algorithms to balance gain and cost with cardinality constraint pp. 2946-2962

Yijing Wang, Dachuan Xu, Donglei Du and Yanjun Jiang

On zero-error codes produced by greedy algorithms pp. 2963-2980

Marcin Jurkiewicz

Topology preservation on the BCC grid pp. 2981-2995

Péter Kardos

TLHSA and SACA: two heuristic algorithms for two variant VRP models pp. 2996-3022

Xuhong Cai, Li Jiang, Songhu Guo, Hejiao Huang and Hongwei Du

Unfolding H-convex Manhattan Towers pp. 3023-3037

Lydie Richaume, Eric Andres, Gaëlle Largeteau-Skapin and Rita Zrour

Strong Euler well-composedness pp. 3038-3055

Nicolas Boutry, Rocio Gonzalez-Diaz, Maria-Jose Jimenez and Eduardo Paluzo-Hildago

Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane pp. 3056-3082

Sanjana Agrawal and R. Inkulu

A study of feature representation via neural network feature extraction and weighted distance for clustering pp. 3083-3105

Lily Schleider, Eduardo L. Pasiliao, Zhecheng Qiang and Qipeng P. Zheng

Computing a maximum clique in geometric superclasses of disk graphs pp. 3106-3135

Nicolas Grelier

The optimization of self-interference in wideband full-duplex phased array with joint transmit and receive beamforming pp. 3136-3152

Xiaoxin Wang, Zhipeng Jiang, Wenguo Yang and Suixiang Gao

Triangle packing and covering in dense random graphs pp. 3153-3164

Zhongzheng Tang and Zhuo Diao

2022, volume 44, articles 3

Error-correcting codes based on partial linear maps of finite-dimensional vector spaces pp. 1377-1386

Junli Liu, Wei Jiang and Xuedong Zhang

A sustainable supply chain network considering lot sizing with quantity discounts under disruption risks: centralized and decentralized models pp. 1387-1432

Parisa Rafigh, Ali Akbar Akbari, Hadi Mohammadi Bidhandi and Ali Husseinzadeh Kashan

On metric dimension of plane graphs with $$\frac{m}{2}$$ m 2 number of 10 sided faces pp. 1433-1458

Sunny Kumar Sharma and Vijay Kumar Bhat

An approximation algorithm for a general class of multi-parametric optimization problems pp. 1459-1494

Stephan Helfrich, Arne Herzel, Stefan Ruzika and Clemens Thielen

Improved algorithms for ranking and unranking (k, m)-ary trees in B-order pp. 1495-1510

Yu-Hsuan Chang, Ro-Yu Wu, Ruay-Shiung Chang and Jou-Ming Chang

Fast computation of global solutions to the single-period unit commitment problem pp. 1511-1536

Cheng Lu, Zhibin Deng, Shu-Cherng Fang, Qingwei Jin and Wenxun Xing

Energy-efficient weak-barrier coverage with adaptive sensor rotation pp. 1537-1555

Catalina Aranzazu-Suescun and Mihaela Cardei

Robustly assigning unstable items pp. 1556-1577

Ananya Christman, Christine Chung, Nicholas Jaczko, Scott Westvold and David S. Yuen

From packing rules to cost-sharing mechanisms pp. 1578-1593

Chenhao Zhang and Guochuan Zhang

Computing an $$L_1$$ L 1 shortest path among splinegonal obstacles in the plane pp. 1594-1614

Tameem Choudhury and R. Inkulu

On the approximability of Time Disjoint Walks pp. 1615-1636

Alexandre Bayen, Jesse Goodman and Eugene Vinitsky

A balm: defend the clique-based attack from a fundamental aspect pp. 1637-1658

Meng Han, Dongjing Miao, Jinbao Wang and Liyuan Liu

Isolation branching: a branch and bound algorithm for the k-terminal cut problem pp. 1659-1679

Mark Velednitsky and Dorit S. Hochbaum

An approximation algorithm for stochastic multi-level facility location problem with soft capacities pp. 1680-1692

Chenchen Wu, Donglei Du and Yue Kang

The bi-criteria seeding algorithms for two variants of k-means problem pp. 1693-1704

Min Li

On weak Pareto optimality of nonatomic routing networks pp. 1705-1723

Xujin Chen, Zhuo Diao and Xiaodong Hu

Related machine scheduling with machine speeds satisfying linear constraints pp. 1724-1740

Siyun Zhang, Kameng Nip and Zhenbo Wang

Computation and algorithm for the minimum k-edge-connectivity of graphs pp. 1741-1752

Yuefang Sun, Chenchen Wu, Xiaoyan Zhang and Zhao Zhang

Approximation algorithms for the maximally balanced connected graph tripartition problem pp. 1753-1773

Guangting Chen, Yong Chen, Zhi-Zhong Chen, Guohui Lin, Tian Liu and An Zhang

Approximation algorithms for constructing required subgraphs using stock pieces of fixed length pp. 1774-1795

Junran Lichen, Jianping Li, Ko-Wei Lih and Xingxing Yu

Randomized selection algorithm for online stochastic unrelated machines scheduling pp. 1796-1811

Xiaoyan Zhang, Ran Ma, Jian Sun and Zan-Bo Zhang

An approximation algorithm for the uniform capacitated k-means problem pp. 1812-1823

Lu Han, Dachuan Xu, Donglei Du and Dongmei Zhang

Max–min dispersion on a line pp. 1824-1830

Tetsuya Araki and Shin-ichi Nakano

Analysis of consensus sorting via the cycle metric pp. 1831-1847

Ivan Avramovic and Dana S. Richards

Tighter price of anarchy for selfish task allocation on selfish machines pp. 1848-1879

Xiayan Cheng, Rongheng Li and Yunxia Zhou

An approximation algorithm for the maximum spectral subgraph problem pp. 1880-1899

Cristina Bazgan, Paul Beaujean and Éric Gourdin

Online scheduling on a single machine with linear deteriorating processing times and delivery times pp. 1900-1912

Xing Chai, Wenhua Li, Hang Yuan and Libo Wang

A primal-dual algorithm for the minimum power partial cover problem pp. 1913-1923

Menghong Li, Yingli Ran and Zhao Zhang

Weighted thresholding homotopy method for sparsity constrained optimization pp. 1924-1952

Wenxing Zhu, Huating Huang, Lanfan Jiang and Jianli Chen

Capacitated vehicle routing problem on line with unsplittable demands pp. 1953-1963

Yuanxiao Wu and Xiwen Lu

Combinatorial approximation algorithms for the submodular multicut problem in trees with submodular penalties pp. 1964-1976

Xiaofei Liu and Weidong Li

The seeding algorithm for spherical k-means clustering with penalties pp. 1977-1994

Sai Ji, Dachuan Xu, Longkun Guo, Min Li and Dongmei Zhang

Bipartite communities via spectral partitioning pp. 1995-2028

Kelly B. Yancey and Matthew P. Yancey

Algorithmic aspect on the minimum (weighted) doubly resolving set problem of graphs pp. 2029-2039

Changhong Lu, Qingjie Ye and Chengru Zhu

General restricted inverse assignment problems under $$l_1$$ l 1 and $$l_\infty $$ l ∞ norms pp. 2040-2055

Qin Wang, Tianyu Yang and Longshu Wu

Computing equilibrium in network utility-sharing and discrete election games pp. 2056-2084

Rahul Swamy and Timothy Murray

Exact algorithms for finding constrained minimum spanning trees pp. 2085-2103

Pei Yao and Longkun Guo

The price of fairness for a two-agent scheduling game minimizing total completion time pp. 2104-2122

Yubai Zhang, Zhao Zhang and Zhaohui Liu

Atomic congestion games with random players: network equilibrium and the price of anarchy pp. 2123-2142

Chenlan Wang, Xuan Vinh Doan and Bo Chen

Online traveling salesman problem with time cost and non-zealous server pp. 2143-2166

Tengyu Wu, Lin He and Haiyan Yu

2022, volume 44, articles 2

A sifting-edges algorithm for accelerating the computation of absolute 1-center in graphs pp. 905-920

Wei Ding, Ke Qiu, Yu Zhou and Zhou Ye

Paired domination versus domination and packing number in graphs pp. 921-933

Magda Dettlaff, Didem Gözüpek and Joanna Raczek

Leafy spanning k-forests pp. 934-946

Cristina G. Fernandes, Carla N. Lintzmayer and Mário César San Felice

Particle swarm optimization based-algorithms to solve the two-machine cross-docking flow shop problem: just in time scheduling pp. 947-969

Imen Hamdi and Imen Boujneh

A note on the minimum power partial cover problem on the plane pp. 970-978

Han Dai, Bin Deng, Weidong Li and Xiaofei Liu

Algorithms for covering multiple submodular constraints and applications pp. 979-1010

Chandra Chekuri, Tanmay Inamdar, Kent Quanrud, Kasturi Varadarajan and Zhao Zhang

A vector evaluated evolutionary algorithm with exploitation reinforcement for the dynamic pollution routing problem pp. 1011-1038

Nasreddine Ouertani, Hajer Ben-Romdhane, Saoussen Krichen and Issam Nouaouri

Online routing and searching on graphs with blocked edges pp. 1039-1059

Davood Shiri and Hakan Tozan

Competitive analysis of online machine rental and online parallel machine scheduling problems with workload fence pp. 1060-1076

Feifeng Zheng, Yuhong Chen, Ming Liu and Yinfeng Xu

Estimation of distribution algorithms using Gaussian Bayesian networks to solve industrial optimization problems constrained by environment variables pp. 1077-1098

Vicente P. Soloviev, Pedro Larrañaga and Concha Bielza

Comment on “Approximation algorithms for quadratic programming” pp. 1099-1103

Tongli Zhang and Yong Xia

An efficient approach for searching optimal multi-keywords coverage routes pp. 1104-1133

Rong Yang, Baoning Niu and Pengfei Jin

The min-p robust optimization approach for facility location problem under uncertainty pp. 1134-1160

Zhizhu Lai, Qun Yue, Zheng Wang, Dongmei Ge, Yulong Chen and Zhihong Zhou

Sharp upper bound of injective coloring of planar graphs with girth at least 5 pp. 1161-1198

Qiming Fang and Li Zhang

The upper bounds on the Steiner k-Wiener index in terms of minimum and maximum degrees pp. 1199-1220

Wanping Zhang, Jixiang Meng and Baoyindureng Wu

Steiner tree in k-star caterpillar convex bipartite graphs: a dichotomy pp. 1221-1247

D. H. Aneesh, A. Mohanapriya, P. Renjith and N. Sadagopan

Lease or financial lease? Deterministic strategies for on-line financial lease problem with the second-hand transaction pp. 1248-1264

Yong Zhang, Jiahao Li, Xingyu Yang and Xiaohui Wang

Computing the sequence of k-cardinality assignments pp. 1265-1283

Amnon Rosenmann

Job-shop scheduling-joint consideration of production, transport, and storage/retrieval systems pp. 1284-1322

Dalila B. M. M. Fontes, S. Mahdi Homayouni and Mauricio G. C. Resende

The fractional matching preclusion number of complete n-balanced k-partite graphs pp. 1323-1329

Yu Luan, Mei Lu and Yi Zhang

Minimizing total weighted late work on a single-machine with non-availability intervals pp. 1330-1355

Shi-Sheng Li and Ren-Xia Chen

2-Distance list $$(\Delta +2)$$ ( Δ + 2 ) -coloring of planar graphs with girth at least 10 pp. 1356-1375

Hoang La and Mickael Montassier

2022, volume 44, articles 1

A general greedy approximation algorithm for finding minimum positive influence dominating sets in social networks pp. 1-20

Weidong Chen, Hao Zhong, Lidong Wu and Ding-Zhu Du

Modeling and optimizing an agro-supply chain considering different quality grades and storage systems for fresh products: a Benders decomposition solution approach pp. 21-50

Fatemeh Keshavarz-Ghorbani and Seyed Hamid Reza Pasandideh

Network construction/restoration problems: cycles and complexity pp. 51-73

Tianyu Wang and Igor Averbakh

The sum of root-leaf distance interdiction problem by upgrading edges/nodes on trees pp. 74-93

Qiao Zhang, Xiucui Guan, Junhua Jia and Xinqiang Qian

Greedy algorithms for the profit-aware social team formation problem pp. 94-118

Shengxin Liu and Chung Keung Poon

On total and edge coloring some Kneser graphs pp. 119-135

C. M. H. de Figueiredo, C. S. R. Patrão, D. Sasaki and M. Valencia-Pabon

Monochromatic disconnection: Erdős-Gallai-type problems and product graphs pp. 136-153

Ping Li and Xueliang Li

Maximum properly colored trees in edge-colored graphs pp. 154-171

Jie Hu, Hao Li and Shun-ichi Maezawa

A speciation-based bilevel niching method for multimodal truss design problems pp. 172-206

Md. Jakirul Islam, Xiaodong Li and Kalyanmoy Deb

Parallel-machine scheduling of jobs with mixed job-, machine- and position-dependent processing times pp. 207-222

Bartłomiej Przybylski

A variable neighborhood search algorithm for human resource selection and optimization problem in the home appliance manufacturing industry pp. 223-241

Xing Ji, Baoyu Liao and Shanlin Yang

A novel approach to subgraph selection with multiple weights on arcs pp. 242-268

Mohammad Ali Raayatpanah, Salman Khodayifar, Thomas Weise and Panos Pardalos

A linear-time algorithm for weighted paired-domination on block graphs pp. 269-286

Ching-Chi Lin, Cheng-Yu Hsieh and Ta-Yu Mu

Sufficient conditions for the optimality of the greedy algorithm in greedoids pp. 287-302

Dávid Szeszlér

Results on vertex-edge and independent vertex-edge domination pp. 303-330

Subhabrata Paul and Keshav Ranjan

The effect of vertex and edge deletion on the edge metric dimension of graphs pp. 331-342

Meiqin Wei, Jun Yue and Lily Chen

Approximation algorithm for the parallel-machine scheduling problem with release dates and submodular rejection penalties pp. 343-353

Hongye Zheng, Suogang Gao, Wen Liu, Weili Wu, Ding-Zhu Du and Bo Hou

Joint chance-constrained staffing optimization in multi-skill call centers pp. 354-378

Tien Thanh Dam, Thuy Anh Ta and Tien Mai

Improved formulations and branch-and-cut algorithms for the angular constrained minimum spanning tree problem pp. 379-413

Alexandre Salles Cunha

Competitive algorithm for scheduling of sharing machines with rental discount pp. 414-434

Yinfeng Xu, Rongteng Zhi, Feifeng Zheng and Ming Liu

The signed edge-domatic number of nearly cubic graphs pp. 435-445

Jia-Xiong Dan, Zhi-Bo Zhu, Xin-Kui Yang, Ru-Yi Li, Wei-Jie Zhao and Xiang-Jun Li

Single-machine multitasking scheduling with job efficiency promotion pp. 446-479

Min Ji, Yingchun Zhang, Yuan Zhang, T. C. E. Cheng and Yiwei Jiang

Single machine scheduling with non-availability interval and optional job rejection pp. 480-497

Baruch Mor and Dana Shapira

Strengthening a linear reformulation of the 0-1 cubic knapsack problem via variable reordering pp. 498-517

Richard J. Forrester and Lucas A. Waddell

An online trading problem with an increasing number of available products pp. 518-531

Wenming Zhang, Ye Zhang, Yongxi Cheng and Shankui Zheng

Allocation and optimization of shared self-service check-in system based on integer programming model pp. 532-556

Ying Liu, Xiuqing Yang, Yong Xiang, Yi Chen, Gang Mao and Xinzhi Zhou

Pattern-based ILP models for the one-dimensional cutting stock problem with setup cost pp. 557-582

Mateus Martin, Horacio Hideki Yanasse and Luiz Leduíno Salles-Neto

A solution approach for cardinality minimization problem based on fractional programming pp. 583-602

S. M. Mirhadi and S. A. MirHassani

Further results on the total monochromatic connectivity of graphs pp. 603-616

Yanhong Gao, Ping Li and Xueliang Li

Hierarchy cost of hierarchical clusterings pp. 617-634

Felix Bock

Election control through social influence with voters’ uncertainty pp. 635-669

Mohammad Abouei Mehrizi, Federico Corò, Emilio Cruciani and Gianlorenzo D’Angelo

Competitive analysis for two-option online leasing problem under sharing economy pp. 670-689

Yong Zhang, Jingting Wu, Wenxiong Lin and Muyu Hou

A tardiness-augmented approximation scheme for rejection-allowed multiprocessor rescheduling pp. 690-722

Wenchang Luo, Rylan Chin, Alexander Cai, Guohui Lin, Bing Su and An Zhang

Maximizing k-submodular functions under budget constraint: applications and streaming algorithms pp. 723-751

Canh V. Pham, Quang C. Vu, Dung K. T. Ha, Tai T. Nguyen and Nguyen D. Le

A heuristic approximation algorithm of minimum dominating set based on rough set theory pp. 752-769

Lihe Guan and Hong Wang

OnML: an ontology-based approach for interpretable machine learning pp. 770-793

Pelin Ayranci, Phung Lai, Nhathai Phan, Han Hu, Alexander Kolinowski, David Newman and Deijing Dou

An efficient spread-based evolutionary algorithm for solving dynamic multi-objective optimization problems pp. 794-849

Alireza Falahiazar, Arash Sharifi and Vahid Seydi

Multi-objective multi-verse optimiser for integrated two-sided assembly sequence planning and line balancing pp. 850-876

Mohd Fadzil Faisae Ab Rashid, Nik Mohd Zuki Nik Mohamed and Ahmad Nasser Mohd Rose

Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing pp. 877-893

Mingyang Gong, Randy Goebel, Guohui Lin and Eiji Miyano

Finding a minimal spanning hypertree of a weighted hypergraph pp. 894-904

G. H. Shirdel and B. Vaez-Zadeh