Printed from https://ideas.repec.org/s/spr/jcomop4.html
Content
November 2021, Volume 42, Issue 4
- 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 - 848-865 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 - 866-883 Path optimization for joint distribution of medical consumables under hospital SPD supply chain mode
by Gengjun Gao & Yuxuan Che & Jian Shen - 884-895 An intelligent data-driven model for disease diagnosis based on machine learning theory
by He Huang & Wei Gao & Chunming Ye - 896-908 A three-stage supply chain scheduling problem based on the nursing assistants’ daily work in a hospital
by Jing Fan & Hui Shi - 909-927 Early warning of venous thromboembolism after surgery based on self-organizing competitive network
by Shi Yin & Jian Chang & Hailan Pan & Haizhou Mao & Mei Wang - 928-936 Three-sided matching problem with mixed preferences
by Feng Zhang & Liwei Zhong - 937-947 Fitting PB1-p62 filaments model structure into its electron microscopy based on an improved genetic algorithm
by Zhihong Zhao & Beibei Li & Jun Liu - 948-965 A novel kernel-free nonlinear SVM for semi-supervised classification in disease diagnosis
by Xin Yan & Hongmiao Zhu & Jian Luo - 966-987 Risk prediction of hypertension complications based on the intelligent algorithm optimized Bayesian network
by Gang Du & Xi Liang & Xiaoling Ouyang & Chunming Wang - 988-1003 Research on model and algorithm of TCM constitution identification based on artificial intelligence
by Bin Li & Qianghua Wei & Xinye Zhou - 1004-1029 Emergency medical center location problem with people evacuation solved by extended TODIM and objective programming
by Ling Gai & Zhiyue Peng & Jiming Zhang & Jiafu Zhang - 1030-1041 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 - 1042-1052 Research of SVM ensembles in medical examination scheduling
by Yi Du & Hua Yu & Zhijun Li - 1053-1063 An optimized approach of venous thrombus embolism risk assessment
by Ruiping Wang & Mei Wang & Jian Chang & Zai Luo & Feng Zhang & Chen Huang
October 2021, Volume 42, Issue 3
- 339-339 Preface: special issue on the annual international conference on combinatorial optimization and applications (COCOA)
by Xiaofeng Gao - 340-353 Conflict-free connection of trees
by Hong Chang & Meng Ji & Xueliang Li & Jingshu Zhang - 354-372 On the complexity and approximability of repair position selection problem
by Xianmin Liu & Yingshu Li & Jianzhong Li & Yuqiang Feng - 373-395 A spectral partitioning algorithm for maximum directed cut problem
by Zhenning Zhang & Donglei Du & Chenchen Wu & Dachuan Xu & Dongmei Zhang - 396-408 On the complexity of and algorithms for detecting k-length negative cost cycles
by Longkun Guo & Peng Li - 409-426 A dynamic approach to detecting, eliminating and fixing memory leaks
by Bin Yu & Cong Tian & Nan Zhang & Zhenhua Duan & Hongwei Du - 427-441 Mixed connectivity properties of random graphs and some special graphs
by Ran Gu & Yongtang Shi & Neng Fan - 442-475 The one-cop-moves game on planar graphs
by Ziyuan Gao & Boting Yang - 476-498 Tropical paths in vertex-colored graphs
by Johanne Cohen & Giuseppe F. Italiano & Yannis Manoussakis & Nguyen Kim Thang & Hong Phong Pham - 499-523 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 - 524-542 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 - 543-564 Batch scheduling of nonidentical job sizes with minsum criteria
by Rongqi Li & Zhiyi Tan & Qianyu Zhu - 565-580 Improved algorithms for single vehicle scheduling on tree/cycle networks
by Yuanxiao Wu & Xiwen Lu - 581-592 The spectral radius and domination number in linear uniform hypergraphs
by Liying Kang & Wei Zhang & Erfang Shan - 593-615 Big data driven urban railway planning: Shenzhen metro case study
by Wen Xu & Caiwei Yuan & Keke Peng & Hongwei Du - 616-635 On the price of anarchy of two-stage machine scheduling games
by Deshi Ye & Lin Chen & Guochuan Zhang - 636-656 An improved mechanism for selfish bin packing
by Xin Chen & Qingqin Nong & Qizhi Fang - 657-674 Modified Greedy Heuristic for the one-dimensional cutting stock problem
by Gonçalo R. L. Cerqueira & Sérgio S. Aguiar & Marlos Marques
August 2021, Volume 42, Issue 2
- 207-211 Theory and applications in combinatorial optimization
by John Baptist Gauci & Silvano Martello - 212-230 Hamiltonian decomposition and verifying vertex adjacency in 1-skeleton of the traveling salesperson polytope by variable neighborhood search
by Andrei Nikolaev & Anna Kozlova - 231-257 Sublinear search spaces for shortest path planning in grid and road networks
by Johannes Blum & Stefan Funke & Sabine Storandt - 258-275 The principal eigenvector to $$\alpha $$ α -spectral radius of hypergraphs
by Jing Wang & Liying Kang & Erfang Shan - 276-309 A 5-parameter complexity classification of the two-stage flow shop scheduling problem with job dependent storage requirements
by Yakov Zinder & Alexandr Kononov & Joey Fung - 310-326 Nullspace vertex partition in graphs
by Irene Sciriha & Xandru Mifsud & James L. Borg - 327-338 A note on the single machine CON and CONW problems with lot scheduling
by Baruch Mor & Gur Mosheiov
July 2021, Volume 42, Issue 1
- 1-23 Efficient feature selection for logical analysis of large-scale multi-class datasets
by Kedong Yan & Dongjing Miao & Cui Guo & Chanying Huang - 24-39 (Strong) Total proper connection of some digraphs
by Yingbin Ma & Kairui Nie - 40-55 Complexity results for two kinds of colored disconnections of graphs
by You Chen & Ping Li & Xueliang Li & Yindi Weng - 56-70 Algorithmic aspects of 2-secure domination in graphs
by Pavan Kumar Jakkepalli & Venkata Subba Reddy Palagiri - 71-84 A 3/2-approximation for big two-bar charts packing
by Adil Erzin & Georgii Melidi & Stepan Nazarenko & Roman Plotnikov - 85-124 Declawing a graph: polyhedra and Branch-and-Cut algorithms
by Felipe C. Fragoso & Gilberto F. Sousa Filho & Fábio Protti - 125-150 A unifying model for locally constrained spanning tree problems
by Luiz Viana & Manoel Campêlo & Ignasi Sau & Ana Silva - 151-173 Suboptimal sliding manifold For nonlinear supply chain with time delay
by Sajjad Aslani Khiavi & Hamid Khaloozadeh & Fahimeh Soltanian - 174-186 Roman {k}-domination in trees and complexity results for some classes of graphs
by Cai-Xia Wang & Yu Yang & Hong-Juan Wang & Shou-Jun Xu - 187-205 Efficient algorithms for support path with time constraint
by Lili Zhang & Cheng-Kuan Lin & Xiaoqiang Chen & Jianxi Fan & Yuan-Hsiang Teng
May 2021, Volume 41, Issue 4
- 781-793 Single-machine scheduling with periodic due dates to minimize the total earliness and tardy penalty
by Byung-Cheon Choi & Myoung-Ju Park - 794-816 A metaheuristic for the delivery man problem with time windows
by Ha-Bang Ban - 817-829 On the relation between Wiener index and eccentricity of a graph
by Hamid Darabi & Yaser Alizadeh & Sandi Klavžar & Kinkar Chandra Das - 830-843 Single-machine online scheduling of jobs with non-delayed processing constraint
by Wenjie Li & Jinjiang Yuan - 844-860 The m-Steiner Traveling Salesman Problem with online edge blockages
by Henan Liu & Huili Zhang & Yi Xu - 861-887 Capacitated inverse optimal value problem on minimum spanning tree under bottleneck Hamming distance
by Hui Wang & Xiucui Guan & Qiao Zhang & Binwu Zhang - 888-904 An LP-rounding based algorithm for a capacitated uniform facility location problem with penalties
by Wei Lv & Chenchen Wu - 905-922 A continuous generalization of domination-like invariants
by Michitaka Furuya - 923-933 Complete-Subgraph-Transversal-Sets problem on bounded treewidth graphs
by Ke Liu & Mei Lu
April 2021, Volume 41, Issue 3
- 579-602 Length-weighted $$\lambda $$ λ -rearrangement distance
by Alexsandro Oliveira Alexandrino & Guilherme Henrique Santos Miranda & Carla Negri Lintzmayer & Zanoni Dias - 603-624 Minimum constellation covers: hardness, approximability and polynomial cases
by Santiago Valdés Ravelo - 625-639 The simple grid polygon exploration problem
by Qi Wei & Jie Sun & Xuehou Tan & Xiaolin Yao & Yonggong Ren - 640-677 Designing emergency flood evacuation plans using robust optimization and artificial intelligence
by Soheyl Khalilpourazari & Seyed Hamid Reza Pasandideh - 678-693 Some mixed graphs with H-rank 4, 6 or 8
by Jinling Yang & Ligong Wang & Xiuwen Yang - 694-709 On maximum $$P_3$$ P 3 -packing in claw-free subcubic graphs
by Wenying Xi & Wensong Lin - 710-735 The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation
by Tınaz Ekim & Mordechai Shalom & Oylum Şeker - 736-761 On the computational complexity of finding a sparse Wasserstein barycenter
by Steffen Borgwardt & Stephan Patterson - 762-779 Digraphs that contain at most t distinct walks of a given length with the same endpoints
by Zhenhua Lyu
February 2021, Volume 41, Issue 2
- 267-289 Application of multi-objective optimization algorithm for siting and sizing of distributed generations in distribution networks
by J. Rajalakshmi & S. Durairaj - 290-303 Research on single-machine scheduling with position-dependent weights and past-sequence-dependent delivery times
by Ji-Bo Wang & Bo Cui & Ping Ji & Wei-Wei Liu - 304-317 Algorithmic complexity of outer independent Roman domination and outer independent total Roman domination
by Abolfazl Poureidi & Mehrdad Ghaznavi & Jafar Fathali - 318-327 Differentially private approximate aggregation based on feature selection
by Zaobo He & Akshita Maradapu Vera Venkata Sai & Yan Huang & Daehee seo & Hanzhou Zhang & Qilong Han - 328-347 Group level social media popularity prediction by MRGB and Adam optimization
by Navdeep Bohra & Vishal Bhatnagar - 348-356 On strict submodularity of social influence
by Qiufen Ni & Hongwei Du - 357-400 Application of optimization methods in the closed-loop supply chain: a literature review
by Luttiely Santos Oliveira & Ricardo Luiz Machado - 401-413 Secure domination in rooted product graphs
by Rangel Hernández-Ortiz & Luis Pedro Montejano & Juan Alberto Rodríguez-Velázquez - 414-432 Dominating set of rectangles intersecting a straight line
by Supantha Pandit - 433-450 Approximation algorithm for the multicovering problem
by Abbass Gorgi & Mourad El Ouali & Anand Srivastav & Mohamed Hachimi - 451-486 Bounds on the semipaired domination number of graphs with minimum degree at least two
by Teresa W. Haynes & Michael A. Henning - 487-503 On sufficient topological indices conditions for properties of graphs
by Yong Lu & Qiannan Zhou - 504-525 Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work
by Ruyan He & Jinjiang Yuan & C. T. Ng & T. C. E. Cheng - 526-543 Italian domination in the Cartesian product of paths
by Hong Gao & Tingting Feng & Yuansheng Yang - 544-552 The balanced double star has maximum exponential second Zagreb index
by Roberto Cruz & Juan Daniel Monsalve & Juan Rada - 553-577 Zero forcing versus domination in cubic graphs
by Randy Davila & Michael A. Henning
January 2021, Volume 41, Issue 1
- 1-11 Single machine lot scheduling with optional job-rejection
by Baruch Mor & Gur Mosheiov & Dana Shapira - 12-27 A randomized approximation algorithm for metric triangle packing
by Yong Chen & Zhi-Zhong Chen & Guohui Lin & Lusheng Wang & An Zhang - 28-42 Improved approximation algorithms for two-stage flexible flow shop scheduling
by Anzhen Peng & Longcheng Liu & Weifeng Lin - 43-55 Sequence submodular maximization meets streaming
by Ruiqi Yang & Dachuan Xu & Longkun Guo & Dongmei Zhang - 56-72 Secure Italian domination in graphs
by M. Dettlaff & M. Lemańska & J. A. Rodríguez-Velázquez - 73-79 Quaternary splitting algorithm in group testing
by Jinn Lu & Hung-Lin Fu - 80-104 Top-k overlapping densest subgraphs: approximation algorithms and computational complexity
by Riccardo Dondi & Mohammad Mehdi Hosseinzadeh & Giancarlo Mauri & Italo Zoppis - 105-117 The t-latency bounded strong target set selection problem in some kinds of special family of graphs
by Xianliang Liu & Zishen Yang & Wei Wang - 118-127 A greedy algorithm for the fault-tolerant outer-connected dominating set problem
by Xiaozhi Wang & Xianyue Li & Bo Hou & Wen Liu & Lidong Wu & Suogang Gao - 128-142 Non-monotone submodular function maximization under k-system constraint
by Majun Shi & Zishen Yang & Donghyun Kim & Wei Wang - 143-169 A scenario-based robust optimization with a pessimistic approach for nurse rostering problem
by Mohammad Reza Hassani & J. Behnamian - 170-196 On multi-path routing for reliable communications in failure interdependent complex networks
by Zishen Yang & Wei Wang & Donghyun Kim - 197-212 New construction of error-correcting pooling designs from singular linear spaces over finite fields
by Gang Wang & You Gao - 213-233 Discount allocation for cost minimization in online social networks
by Qiufen Ni & Smita Ghosh & Chuanhe Huang & Weili Wu & Rong Jin - 234-266 On characterizations for subclasses of directed co-graphs
by Frank Gurski & Dominique Komander & Carolin Rehs
November 2020, Volume 40, Issue 4
- 861-868 Note on the time complexity of resource constrained scheduling with general truncated job-dependent learning effect
by Dexin Zou & Chong Jiang & Weiwei Liu - 869-875 Connected max cut is polynomial for graphs without the excluded minor $$K_5\backslash e$$ K 5 \ e
by Brahim Chaourar - 876-900 A characterization of optimal multiprocessor schedules and new dominance rules
by Rico Walter & Alexander Lawrinenko - 901-906 A short proof for stronger version of DS decomposition in set function optimization
by Xiang Li & H. George Du - 907-928 Influence maximization problem: properties and algorithms
by Wenguo Yang & Yapu Zhang & Ding-Zhu Du - 929-952 New approximation algorithms for machine scheduling with rejection on single and parallel machine
by Peihai Liu & Xiwen Lu - 953-973 General multiplicative Zagreb indices of trees and unicyclic graphs with given matching number
by Tomáš Vetrík & Selvaraj Balachandran - 974-1007 Online maximum matching with recourse
by Spyros Angelopoulos & Christoph Dürr & Shendan Jin - 1008-1019 Some algorithmic results for finding compatible spanning circuits in edge-colored graphs
by Zhiwei Guo & Hajo Broersma & Ruonan Li & Shenggui Zhang - 1020-1029 Intersecting families in $$\left( {\begin{array}{c}{[m]}\\ \ell \end{array}}\right) \cup \left( {\begin{array}{c}{[n]}\\ k\end{array}}\right) $$ [ m ] ℓ ∪ [ n ] k
by Jun Wang & Huajun Zhang - 1030-1043 A linear time algorithm for the p-maxian problem on trees with distance constraint
by Trung Kien Nguyen & Nguyen Thanh Hung & Huong Nguyen-Thu - 1044-1064 Minimizing maximum delivery completion time for order scheduling with rejection
by Ren-Xia Chen & Shi-Sheng Li - 1065-1074 An approximation algorithm for submodular hitting set problem with linear penalties
by Shaojing Du & Suogang Gao & Bo Hou & Wen Liu - 1075-1091 Partial inverse min–max spanning tree problem
by Javad Tayyebi & Ali Reza Sepasian - 1092-1120 Maximizing user type diversity for task assignment in crowdsourcing
by Ana Wang & Meirui Ren & Hailong Ma & Lichen Zhang & Peng Li & Longjiang Guo - 1121-1135 The maximum Wiener index of maximal planar graphs
by Debarun Ghosh & Ervin Győri & Addisu Paulos & Nika Salia & Oscar Zamora
October 2020, Volume 40, Issue 3
- 571-589 The complexity of total edge domination and some related results on trees
by Zhuo Pan & Yu Yang & Xianyue Li & Shou-Jun Xu - 590-609 A completely positive formulation of the graph isomorphism problem and its positive semidefinite relaxation
by Pawan Aurora & Shashank K. Mehta - 610-635 Selfish colorful bin packing games
by Vittorio Bilò & Francesco Cellinese & Giovanna Melideo & Gianpiero Monaco - 636-659 A rapid learning automata-based approach for generalized minimum spanning tree problem
by Masoumeh Zojaji & Mohammad Reza Mollakhalili Meybodi & Kamal Mirzaie - 660-696 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 - 697-712 Average eccentricity, minimum degree and maximum degree in graphs
by P. Dankelmann & F. J. Osaye - 713-732 Maximum weight induced matching in some subclasses of bipartite graphs
by B. S. Panda & Arti Pandey & Juhi Chaudhary & Piyush Dane & Manav Kashyap - 733-756 Personalized manufacturing service composition recommendation: combining combinatorial optimization and collaborative filtering
by Shuangyao Zhao & Qiang Zhang & Zhanglin Peng & Xiaonong Lu - 757-773 Complexity and characterization aspects of edge-related domination for graphs
by Zhuo Pan & Xianyue Li & Shou-Jun Xu - 774-795 Single machine batch scheduling with two non-disjoint agents and splitable jobs
by Zhichao Geng & Jiayu Liu - 796-805 Bottleneck subset-type restricted matching problems
by Oleg Duginov - 806-824 A $$(1.4 + \epsilon )$$ ( 1.4 + ϵ ) -approximation algorithm for the 2-Max-Duo problem
by Yong Chen & Guohui Lin & Tian Liu & Taibo Luo & Bing Su & Yao Xu & Peng Zhang - 825-847 Boosting node activity by recommendations in social networks
by Wenguo Yang & Shengminjie Chen & Suixiang Gao & Ruidong Yan - 848-860 Approximating the $$\tau $$ τ -relaxed soft capacitated facility location problem
by Lu Han & Dachuan Xu & Yicheng Xu & Dongmei Zhang
August 2020, Volume 40, Issue 2
- 279-302 Crossing minimization in perturbed drawings
by Radoslav Fulek & Csaba D. Tóth - 303-332 A class of exponential neighbourhoods for the quadratic travelling salesman problem
by Brad D. Woods & Abraham P. Punnen - 333-365 Coordination mechanisms for scheduling selfish jobs with favorite machines
by Cong Chen & Yinfeng Xu - 366-378 Approximation algorithms for the selling with preference
by Pan Li & Qiang Hua & Zhijun Hu & Hing-Fung Ting & Yong Zhang - 379-411 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 - 412-430 More on limited packings in graphs
by Xuqing Bai & Hong Chang & Xueliang Li - 431-453 Integer linear programming formulations of the filter partitioning minimization problem
by Hazhar Rahmani & Jason M. O’Kane - 454-481 The band collocation problem
by Hakan Kutucu & Arif Gursoy & Mehmet Kurt & Urfat Nuriyev - 482-500 Power domination on triangular grids with triangular and hexagonal shape
by Prosenjit Bose & Valentin Gledel & Claire Pennarun & Sander Verdonschot - 501-511 On the Roman domination subdivision number of a graph
by J. Amjadi & R. Khoeilar & M. Chellali & Z. Shao - 512-546 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 - 547-569 Multiprocessor open shop problem: literature review and future directions
by Zeynep Adak & Mahmure Övül Arıoğlu Akan & Serol Bulkan
July 2020, Volume 40, Issue 1
- 1-20 Plane graphs with $$\Delta =7$$Δ=7 are entirely 10-colorable
by Jiangxu Kong & Xiaoxue Hu & Yiqiao Wang - 21-35 Approximating the asymmetric p-center problem in parameterized complete digraphs
by Wei Ding & Ke Qiu - 36-44 A variation of DS decomposition in set function optimization
by Xiang Li & H. George Du & Panos M. Pardalos - 45-58 Planar graphs without 4- and 6-cycles are (7 : 2)-colorable
by Haitao Wu & Yaojun Chen & Xiaolan Hu - 59-68 Fractional Gallai–Edmonds decomposition and maximal graphs on fractional matching number
by Yan Liu & Mengxia Lei & Xueli Su - 69-97 A $$\frac{5}{2}$$52-approximation algorithm for coloring rooted subtrees of a degree 3 tree
by Anuj Rawat & Mark Shayman - 98-109 Secure domination of honeycomb networks
by M. R. Chithra & Manju K. Menon - 110-140 Joint chance constrained shortest path problem with Copula theory
by Zohreh Hosseini Nodeh & Ali Babapour Azar & Rashed Khanjani Shiraz & Salman Khodayifar & Panos M. Pardalos - 141-169 Classification optimization for training a large dataset with Naïve Bayes
by Thi Thanh Sang Nguyen & Pham Minh Thu Do - 170-180 An improved semi-online algorithm for scheduling on a single machine with unexpected breakdown
by Ji Tian & Yan Zhou & Ruyan Fu - 181-204 New restrictions on defective coloring with applications to steinberg-type graphs
by Addie Armstrong & Nancy Eaton - 205-226 KATZ centrality with biogeography-based optimization for influence maximization problem
by Abbas Salehi & Behrooz Masoumi - 227-233 The strong chromatic index of graphs with edge weight eight
by Lily Chen & Shumei Chen & Ren Zhao & Xiangqian Zhou - 234-278 Analysis of Divide-and-Conquer strategies for the 0–1 minimization knapsack problem
by Fernando A. Morales & Jairo A. Martínez
May 2020, Volume 39, Issue 4
- 933-954 An efficient local search algorithm for solving maximum edge weight clique problem in large graphs
by Yi Chu & Boxiao Liu & Shaowei Cai & Chuan Luo & Haihang You - 955-987 Co-density and fractional edge cover packing
by Qiulan Zhao & Zhibin Chen & Jiajun Sang - 988-1016 On the robustness of a synchronized multi-robot system
by Sergey Bereg & Andrew Brunner & Luis-Evaristo Caraballo & José-Miguel Díaz-Báñez & Mario A. Lopez - 1017-1037 Maximum independent and disjoint coverage
by Amit Kumar Dhar & Raghunath Reddy Madireddy & Supantha Pandit & Jagpreet Singh - 1038-1059 Neighbour-distinguishing labellings of powers of paths and powers of cycles
by Atílio G. Luiz & C. N. Campos & Simone Dantas & Diana Sasaki - 1060-1078 Two-machine flow shop scheduling with an operator non-availability period to minimize makespan
by Dawei Li & Xiwen Lu - 1079-1095 Stabilizing social structure via modifying local patterns
by Sajjad Salehi & Fattaneh Taghiyareh - 1096-1128 The quadratic cycle cover problem: special cases and efficient bounds
by Frank Meijer & Renata Sotirov - 1129-1152 Local antimagic orientation of graphs
by Yulin Chang & Fei Jing & Guanghui Wang - 1153-1207 Efficient reassembling of three-regular planar graphs
by Assaf Kfoury & Laura Sisson - 1208-1220 A 1/2-approximation algorithm for maximizing a non-monotone weak-submodular function on a bounded integer lattice
by Qingqin Nong & Jiazhu Fang & Suning Gong & Dingzhu Du & Yan Feng & Xiaoying Qu
April 2020, Volume 39, Issue 3
- 637-661 Bicriteria scheduling of equal length jobs on uniform parallel machines
by Qiulan Zhao & Jinjiang Yuan - 662-686 The complexity of symmetric connectivity in directional wireless sensor networks
by Tien Tran & Dung T. Huynh - 687-707 Compact quadratizations for pseudo-Boolean functions
by Endre Boros & Yves Crama & Elisabeth Rodríguez-Heck - 708-724 Dynamic programming algorithms for the general quay crane double-cycling problem with internal-reshuffles
by Feifeng Zheng & Yaxin Pang & Ming Liu & Yinfeng Xu - 725-746 A primal-dual algorithm for the minimum partial set multi-cover problem
by Yingli Ran & Yishuo Shi & Changbing Tang & Zhao Zhang - 747-763 Algorithmic and complexity aspects of problems related to total Roman domination for graphs
by Abolfazl Poureidi & Nader Jafari Rad - 764-775 Exponential time algorithms for just-in-time scheduling problems with common due date and symmetric weights
by Vincent T’kindt & Lei Shang & Federico Della Croce - 776-791 On reduced second Zagreb index
by Lkhagva Buyantogtokh & Batmend Horoldagva & Kinkar Chandra Das - 792-825 Solution of boolean quadratic programming problems by two augmented Lagrangian algorithms based on a continuous relaxation
by Rupaj Kumar Nayak & Nirmalya Kumar Mohanty - 826-848 Linear time algorithms for finding independent spanning trees on pyramid networks
by Shuo-I Wang & Fu-Hsing Wang - 849-858 Marginal contributions and derivatives for set functions in cooperative games
by Daniel Li Li & Erfang Shan - 859-873 On the sizes of bi-k-maximal graphs
by Liqiong Xu & Yingzhi Tian & Hong-Jian Lai - 874-898 Contrast in greyscales of graphs
by Natalia Castro & María A. Garrido-Vizuete & Rafael Robles & María Trinidad Villar-Liñán - 899-914 3D camera sensor scheduling algorithms for indoor multi-objective tracking
by Yi Hong & Yongcai Wang & Yuqing Zhu & Deying Li & Zhibo Chen & Jing Li - 915-932 Fractional matching preclusion number of graphs and the perfect matching polytope
by Ruizhi Lin & Heping Zhang
February 2020, Volume 39, Issue 2
- 305-314 Price of dependence: stochastic submodular maximization with dependent items
by Shaojie Tang - 315-333 The average covering tree value for directed graph games
by Anna Khmelnitskaya & Özer Selçuk & Dolf Talman - 334-350 On the edge metric dimension of convex polytopes and its related graphs
by Yuezhong Zhang & Suogang Gao - 351-364 The Wiener index of hypergraphs
by Xiangxiang Liu & Ligong Wang & Xihe Li - 365-384 On the zero forcing number of a graph involving some classical parameters
by Shuchao Li & Wanting Sun - 385-411 A new approximate cluster deletion algorithm for diamond-free graphs
by Sabrine Malek & Wady Naanaa - 412-424 On the total neighbour sum distinguishing index of graphs with bounded maximum average degree
by H. Hocquard & J. Przybyło - 425-436 Domination and matching in power and generalized power hypergraphs
by Yanxia Dong & Moo Young Sohn & Zuosong Liang - 437-456 Nontrivial path covers of graphs: existence, minimization and maximization
by Renzo Gómez & Yoshiko Wakabayashi - 457-491 Degree bounded bottleneck spanning trees in three dimensions
by Patrick J. Andersen & Charl J. Ras - 492-508 Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem
by Jianping Li & Suding Liu & Junran Lichen & Wencheng Wang & Yujie Zheng - 509-518 A new upper bound on the work function algorithm for the k-server problem
by Wenming Zhang & Yongxi Cheng - 519-546 Research on the impact of green innovation alliance mode on decision-making of two-cycle closed-loop supply chain
by Chunmei Ma & Dan Huang - 547-580 A patient flow scheduling problem in ophthalmology clinic solved by the hybrid EDA–VNS algorithm
by Wenjuan Fan & Yi Wang & Tongzhu Liu & Guixian Tong