Printed from https://ideas.repec.org/s/spr/jcomop.html
Content
Undated material is presented at the end, although it may be more recent than other items
November 2025, Volume 50, Issue 4
- 1-8 Low-degree spanning trees of 2-edge-connected graphs in linear time
by Dariusz Dereniowski & Janusz Dybizbański & Przemysław Karpiński & Michał Zakrzewski & Paweł Żyliński - 1-21 On injective edge coloring of sparse graphs with maximum degree 5
by Yanqing Wu - 1-22 A quantum genetic algorithm for a parallel machine scheduling problem
by Tilmann Schwenzow & Annika Lehnert & Christoph Liebrecht & Jörg Franke & Sebastian Reitelshöfer - 1-24 Reinforcement learning-guided adaptive large neighborhood search for vehicle routing problem with time windows
by Zhaohui Wang & Qiao Cui & Bin Tan & Xiao Yang & Weibang Zhou & Xiangsheng Huang - 1-28 Distributionally robust joint chance-constrained approach for the stochastic survivable capacitated network design problem
by Salman Khodayifar & Mohammadreza Farjaie - 1-29 Hot potato or valuable opportunity: e-tailer’s support for competitor logistics service
by Zeling Xu & Li Liu & Feiyu Guo
October 2025, Volume 50, Issue 3
- 1-15 Bicriterion parallel-machine scheduling of equal-length jobs to minimize total tardiness and number of tardy jobs
by Jing Zhang & Rubing Chen & Jinjiang Yuan & C. T. Ng & T. C. E. Cheng - 1-17 Stochastic single-machine scheduling problems with both time-dependent deterioration and position-dependent learning effect
by Yuncheng Luo - 1-29 Transitivity in some graph-classes
by Subhabrata Paul & Kamal Santra - 1-38 Optimal intelligent investment strategy in competing supply chains of electric vehicle charging facilities
by Baoyu Liao & Wenting Wang - 1-39 Investigation of discriminatory government subsidies for fuel vehicles and new energy vehicles by considering trade-ins
by Baoyu Liao & Mengyu Sun & Xiaoxi Zhu & Panos M. Pardalos - 1-42 The multi-terminal vertex separator problem: total dual integrality and polytope composition
by Y. Magnouche & A. R. Mahjoub & S. Martin - 1-47 Quadratization and convexification in polynomial binary optimization
by Yves Crama & Sourour Elloumi & Amélie Lambert & Elisabeth Rodríguez-Heck - 1-48 EmoMAC: a bias-induced multimodal fusion model for emotional analysis with visualization analytics enabled through super affective computing in emails
by C. Pabitha & K. Revathi & W. Gracy Theresa & Pornpimol Chawengsaksopark & Mithileysh Sathiyanarayanan - 1-91 Proof of the Goldberg–Seymour conjecture on edge–colorings of multigraphs
by Guantao Chen & Guangming Jing & Wenan Zang
September 2025, Volume 50, Issue 2
- 1-18 A divide-and-conquer based preprocessing for routing in a simple polygon
by Siddharth Gaur & R. Inkulu - 1-20 Strategy-proof mechanisms for maximizing social satisfaction in the facility location game
by Xiaowei Li & Xiwen Lu - 1-21 Embedding crossed cube into diverse product graphs and tree-derived architectures
by Paul Immanuel & A. Berin Greeni - 1-21 Graph Coloring problem solving using monte carlo tree search and deep reinforcement learning
by Wenzhu Yang & Zhanshan Li - 1-23 Maximum expert consensus models with both type- $$\alpha $$ and type- $$\varepsilon $$ constraints
by Dong Cheng & Huina Zhang & Yong Wu - 1-23 General Sombor index: a study of branching in trees and solution for maximal trees with prescribed maximum degree
by Sultan Ahmad & Kinkar Chandra Das - 1-26 An improvement on the Louvain algorithm using random walks
by Duy Hieu Do & Thi Ha Duong Phan - 1-30 Semistrong edge colorings of planar graphs
by Yuquan Lin & Wensong Lin - 1-35 Moving horizon capacitated arc routing problem
by Somnath Buriuly & Leena Vachhani & Arpita Sinha & Sivapragasam Ravitharan & Sunita Chauhan - 1-35 Quaternion-based formulations for volume maximisation problems
by Jonas Tollenaere & Tony Wauters
August 2025, Volume 50, Issue 1
- 1-5 New Challenges in Combinatorial Optimization
by Bo Chen & Alexander Kulikov & Silvano Martello - 1-16 Mutually dependent, balanced contributions, and the priority value
by Songtao He & Erfang Shan & Yuxin Sun - 1-16 Approximate maximin share allocation for indivisible goods under a knapsack constraint
by Bin Deng & Weidong Li - 1-17 Bivalent quadratic optimization with sum-of-square of quadratic penalties
by Tongli Zhang & Yong Xia - 1-19 Algorithms for 2-balanced connected k-partition problem in graphs
by Junran Yu & Jing Hu & Jiaquan Gao & Donglei Du & Xiaoyan Zhang - 1-19 On the initial transition of graphs of Kirkman schedules by the partial team swap
by Yusuke Kashiwagi & Masaki Yamamoto & Takamasa Yashima - 1-21 Synchronizing production planning and job scheduling: MILP models and exact algorithms
by Aurélien Mombelli & Alain Quilliot - 1-21 A Branch–Reduction–Bound algorithm for linear fractional multi-product planning problems
by Xianfeng Ding & Meiling Hu - 1-35 An integrated operating room and physician scheduling problem solved by a hybrid variable neighborhood search-based algorithm
by Yuli Wang & Wenjuan Fan & Shaowen Lan & Shuwan Zhu & Jianmei Du - 1-36 Single machine lot scheduling to minimize maximum weighted completion time
by Feifeng Zheng & Na Li & Ming Liu & Yinfeng Xu - 1-36 Hybrid quantum-enhanced reinforcement learning for energy-efficient resource allocation in fog-edge computing
by S. Sureka Nithila Princy & Paulraj Ranjith kumar - 1-40 Hardness and algorithms for several new optimization problems on the weighted massively parallel computation model
by Hengzhao Ma & Jianzhong Li
July 2025, Volume 49, Issue 5
- 1-9 On some path-critical Ramsey numbers
by Ye Wang & Yanyan Song - 1-9 Pseudo-Shapley value for weak games of threats
by Daniel Li Li & Erfang Shan - 1-11 The independent quadratic assignment problem: complexity and polynomially solvable special cases
by Ante Ćustić & Wei Yang & Yang Wang & Abraham P. Punnen - 1-13 Approximation algorithms for the W-prize-collecting scheduling problem on a single machine with submodular rejection penalties
by Tianjiao Guo & Wen Liu & Gengsheng Zhang & Bo Hou - 1-15 Finding a b-matching that embeds the maximum number of edge pairs in a given set
by Siraphob Buahong & Vorapong Suppakitpaisarn & Piyashat Sripratak - 1-15 Approximation algorithms for the total dominating set problem
by Limin Wang & Zhao Zhang & Donglei Du & Yaping Mao & Xiaoyan Zhang - 1-15 Approximation algorithms for the partition set cover problem with penalties
by Qi Wang & Bo Hou & Gengsheng Zhang & Yisheng Zhou & Wen Liu - 1-15 Integrated airline aircraft routing and crew pairing by alternating Lagrangian decomposition
by Cong Li & Suixiang Gao & Wenguo Yang & Zhipeng Jiang - 1-16 An exponential cone integer programming and piece-wise linear approximation approach for 0-1 fractional programming
by Hoang Giang Pham & Thuy Anh Ta & Tien Mai - 1-16 Approximating combinatorial contracts with a cardinality constraint
by Qinqin Gong & Ling Gai & Yanjun Jiang & Yang Lv & Ruiqi Yang - 1-17 Improved approximation algorithms for multiprocessor indivisible coflow scheduling
by Mingyang Gong & Guangting Chen & Guohui Lin & Bing Su - 1-20 Frequency allocation problem over an algebraic structure
by Annayat Ali & Rameez Raja - 1-20 Sufficient conditions for some graphical properties in terms of the Lanzhou index and the ad-hoc Lanzhou index
by Xiangge Liu & Yong Lu & Qiannan Zhou - 1-26 Smart health system with deep kronecker network-based key generation for privacy-aware aggregate authentication and access control in IoT
by M. Sathya & V. Mareeswari & M. Jeyaselvi & A. Solairaj - 1-26 Approximating the maximum weight cycle/path partition in graphs with weights one and two
by Xinmeng Guo & Wei Yu & Zhaohui Liu - 1-27 Impact of payment schemes on performance in a medical cost-sharing system: bundled payment vs. total prepayment
by Miao Yu & Wang Zhou & Yu Zhao - 1-27 Mechanism Design with Predictions for Facility Location Games with Candidate Locations
by Jiazhu Fang & Qizhi Fang & Wenjing Liu & Qingqin Nong & Alexandros A. Voudouris - 1-28 Further combinatorial analysis of substar reliability in star networks
by Hao Li & Eminjan Sabir - 1-29 Fitting and analyzing data with convex-area-wise linear regression models
by Bohan Lyu & Jianzhong Li - 1-30 The influence of carbon sink trading on carbon emission reduction in agricultural supply chains
by Tingting Meng & Yukun Cheng & Xujin Pu & Rui Li - 1-31 Refining waste and elevating customer service: assessing the efficacy of reverse logistics strategies for product returns management
by Xiaoyao Li & Bing Jiang & Xueying Meng & Yang Bai - 1-32 On combinatorial network flows algorithms and circuit augmentation for pseudoflows
by Steffen Borgwardt & Angela Morrison - 1-42 Robust static and dynamic maximum flows
by Christian Biefel & Martina Kuchlbauer & Frauke Liers & Lisa Waldmüller - 1-45 ZeSAI: AI vigilant malware detection in email security with zero shot-based hybrid network and threat intelligence integration
by Venkadeshan Ramalingam & R. Gopal & Syed Ziaur Rahman & R. Senthil - 1-51 The multiple steiner TSP with cyclic order on terminals: valid inequalities and polyhedra
by A. Ridha Mahjoub & Raouia Taktak & Eduardo Uchoa
May 2025, Volume 49, Issue 4
- 1-12 Neighbor sum distinguishable $$k$$ k -edge colorings of joint graphs
by Xiangzhi Tu & Peng Li & Yangjing Long & Aifa Wang - 1-14 Faster parameterized algorithms for variants of 3-Hitting Set
by Dekel Tsur - 1-17 The two-center problem of uncertain points on cactus graphs
by Haitao Xu & Jingru Zhang - 1-19 Scheduling problems with rejection in green manufacturing industry
by Fanyu Kong & Jiaxin Song & Cuixia Miao & Yuzhong Zhang - 1-21 Chaotic guided local search algorithm for solving global optimization and engineering problems
by Anis Naanaa - 1-23 Semi-online scheduling with non-increasing job sizes and a buffer
by Leah Epstein & Hanan Zebedat-Haider - 1-24 Path survival reliabilities as measures of reliability for lifeline utility networks
by Brian Godwin Lim & Renzo Roel Tan & Richard de Jesus & Lessandro Estelito Garciano & Agnes Garciano & Kazushi Ikeda - 1-24 Better approximating SONET k-edge partition for small capacity k
by Junhui Ye & Huihuang Jiang & Guangting Chen & Yong Chen & Guohui Lin & An Zhang - 1-24 Analyzing the 3-path vertex cover problem in selected graph classes
by Sangram K. Jena & K. Subramani - 1-28 Randomized approximation algorithms for monotone k-submodular function maximization with constraints
by Yuying Li & Min Li & Yang Zhou & Shuxian Niu & Qian Liu - 1-29 A multi-objective perspective on the cable-trench problem
by Lara Löhken & Michael Stiglmayr - 1-32 A 3-space dynamic programming heuristic for the cubic knapsack problem
by Ibrahim Dan Dije & Franklin Djeumou Fomeni & Leandro C. Coelho - 1-35 Linear-time algorithm for generating L-shaped floorplans using canonical ordering technique
by Shiksha & Krishnendra Shekhawat & Ritu Chandna & Akshaj Gupta - 1-44 Big data-driven optimal weighted fused features-based ensemble learning classifier for thyroid prediction with heuristic algorithm
by K. Hema Priya & K. Valarmathi - 1-46 A review on the versions of artificial bee colony algorithm for scheduling problems
by Beyza Gorkemli & Ebubekir Kaya & Dervis Karaboga & Bahriye Akay
April 2025, Volume 49, Issue 3
- 1-15 Approximation algorithm for dynamic facility location problem
by Li Zhang & Qiaoliang Li - 1-16 A sharp upper bound for the edge dominating number of hypergraphs with minimum degree
by Zhongzheng Tang & Zhuo Diao - 1-18 On the parenthesisations of matrix chains: All are useful, few are essential
by Francisco López & Lars Karlsson & Paolo Bientinesi - 1-19 Superposed semi-Markov decision process with application to optimal maintenance systems
by Jianmin Shi - 1-19 Approximation algorithms for solving the heterogeneous rooted tree/path cover problems
by Pengxiang Pan & Junran Lichen & Ping Yang & Jianping Li - 1-20 Link fault tolerability of the Cartesian product power graph $$(K_{9}-C_{9})^{n}$$ ( K 9 - C 9 ) n : conditional edge-connectivities under six link fault patterns
by Zhaoman Huang & Yayu Yang & Mingzu Zhang & Weihua Yang - 1-21 Testing Higher-order Clusterability on Graphs
by Yifei Li & Donghua Yang & Jianzhong Li - 1-21 Guaranteeing fairness and efficiency under budget constraints
by Yuanyuan Wang & Xin Chen & Qizhi Fang & Qingqin Nong & Wenjing Liu - 1-21 Inefficiency of multiplicative approximate Nash equilibrium for scheduling games
by Zhuyinan Wang & Chen Zhang & Zhiyi Tan - 1-22 Some results on the total (zero) forcing number of a graph
by Jianxi Li & Dongxin Tu & Wai Chee Shiu - 1-22 Exact and approximation algorithms for the multi-depot data mule scheduling with handling time and time span constraints
by Minqin Liu & Wei Yu & Zhaohui Liu & Xinmeng Guo - 1-25 Uav trajectory optimization for maximizing the ToI-based data utility in wireless sensor networks
by Qing Zhao & Zhen Li & Jianqiang Li & Jianxiong Guo & Xingjian Ding & Deying Li - 1-26 Single-machine scheduling with the learning effect of processing time and the deterioration effect of delivery time for prefabricated components
by Na Li & Ran Ma & Yuzhong Zhang - 1-28 Steiner trees with infinitely many terminals on the sides of an angle
by Danila Cherkashin & Emanuele Paolini & Yana Teplitskaya - 1-29 An improved approximation algorithm for covering vertices by $$4^+$$ 4 + -paths
by Mingyang Gong & Zhi-Zhong Chen & Guohui Lin & Lusheng Wang - 1-29 Improved black widow optimization algorithm for multi-objective hybrid flow shop batch-scheduling problem
by Xiyang Liu & Fangjun Luan - 1-35 Mathematical models for the one-dimensional cutting stock problem with setups and open stacks
by Gabriel Gazzinelli Guimarães & Kelly Cristina Poldi & Mateus Martin - 1-49 Maximizing utilitarian and Egalitarian welfare of fractional hedonic games on tree-like graphs
by Tesshu Hanaka & Airi Ikeyama & Hirotaka Ono
March 2025, Volume 49, Issue 2
- 1-9 The edge-vertex domination and weighted edge-vertex domination problem
by Peng Li & Xinyi Xue & Xingli Zhou - 1-13 The minimum orientable genus of the repeated Cartesian product of graphs
by Marietta Galea & John Baptist Gauci - 1-15 Recognizing integrality of weighted rectangles partitions
by Paul Deuker & Ulf Friedrich - 1-15 $$(K_{1}\vee {P_{t})}$$ ( K 1 ∨ P t ) -saturated graphs with minimum number of edges
by Jinze Hu & Shengjin Ji & Qing Cui - 1-18 Degree and betweenness-based label propagation for community detection
by Qiufen Ni & Jun Wang & Zhongzheng Tang - 1-19 Improved lower bound for estimating the number of defective items
by Nader H. Bshouty - 1-21 Energy-efficient real-time multi-workflow scheduling in container-based cloud
by Zaixing Sun & Hejiao Huang & Zhikai Li & Chonglin Gu - 1-22 The undirected optical indices of trees
by Yuan-Hsun Lo & Hung-Lin Fu & Yijin Zhang & Wing Shing Wong - 1-22 Solving the optimal order quantity with unknown parameters for products with stock-dependent demand and variable holding cost rate
by Zhanbing Guo & Yejie Zhang - 1-22 An improved PTAS for covering targets with mobile sensors
by Nonthaphat Wongwattanakij & Nattawut Phetmak & Chaiporn Jaikaeo & Jittat Fakcharoenphol - 1-24 A fuzzy approach for the intuitionistic multi-objective linear fractional programming problem using a bisection method
by Nurdan Kara & Hale Gonce Kocken & Hande Günay Akdemir - 1-24 Agent-constrained truthful facility location games
by Argyrios Deligkas & Mohammad Lotfi & Alexandros A. Voudouris - 1-27 Multiple identical serial-batch machines scheduling with release dates and submodular rejection penalties
by Zhichao Geng & Lingfa Lu - 1-28 An $$L_2$$ L 2 regularization reduced quadratic surface support vector machine model
by Jiguang Wang & Fangfang Guo & Jie Shen - 1-30 Embedded-filter ACO using clustering based mutual information for feature selection
by S. Kumar Reddy Mallidi & Rajeswara Rao Ramisetty - 1-35 Advertising meets assortment planning: joint advertising and assortment optimization under multinomial logit model
by Chenhao Wang & Yao Wang & Shaojie Tang - 1-39 Social media actors: perception and optimization of influence across different types
by Alexander A. Kharlamov & Aleksey N. Raskhodchikov & Maria Pilgun - 1-44 Enhancing decision-making in cloud service provider selection using probabilistic p, q-rung orthopair fuzzy model
by Pairote Yiarayong
January 2025, Volume 49, Issue 1
- 1-10 Np-completeness and bounds for disjunctive total domination subdivision
by Canan Çiftçi & Aysun Aytaç - 1-14 Enhanced deterministic approximation algorithm for non-monotone submodular maximization under knapsack constraint with linear query complexity
by Canh V. Pham - 1-15 A study on $$k$$ k - $$walk$$ walk generation algorithm to prevent the tottering in graph edit distance heuristic algorithms
by SeongCheol Yoon & Daehee Seo & Su-Hyun Kim & Im-Yeong Lee - 1-17 Online scheduling on an unbounded parallel-batch machine to minimize the weighted makespan
by Han Zhang & Lingfa Lu & Jinjiang Yuan - 1-17 Lollipop and cubic weight functions for graph pebbling
by Marshall Yang & Carl Yerger & Runtian Zhou - 1-17 New bounds on the price of anarchy of selfish bin packing with partial punishment
by Xiaowei Li & Peihai Liu & Xiwen Lu - 1-18 Incentive mechanism design for value-decreasing tasks in dynamic competitive edge computing networks
by Qie Li & Zichen Wang & Hongwei Du - 1-20 Customer segmentation using flying fox optimization algorithm
by Konstantinos Zervoudakis & Stelios Tsafarakis - 1-21 Online multiple one way non-preemptive time series search with interrelated prices
by Jinghan Zhao & Yongxi Cheng & Jan Eube & Haodong Liu - 1-23 Discrete circles: analytical definition and generation in the hexagonal grid
by Rita Zrour & Lidija Čomić & Eric Andres & Gaëlle Largeteau Skapin - 1-25 Greedy algorithms for stochastic monotone k-submodular maximization under full-bandit feedback
by Xin Sun & Tiande Guo & Congying Han & Hongyang Zhang - 1-27 Optimal blocks for maximizing the transaction fee revenue of Bitcoin miners
by Mohsen Alambardar Meybodi & Amir Goharshady & Mohammad Reza Hooshmandasl & Ali Shakiba - 1-28 Optimal dispatching of electric vehicles based on optimized deep learning in IoT
by V. Agalya & M. Muthuvinayagam & R. Gandhi - 1-33 Approximation algorithms for the airport and railway problem
by Mohammad R. Salavatipour & Lijiangnan Tian - 1-39 Facial expression-based emotion recognition across diverse age groups: a multi-scale vision transformer with contrastive learning approach
by G. Balachandran & S. Ranjith & T. R. Chenthil & G. C. Jagan - 1-43 Spectral influence in networks: an application to input-output analysis
by Nizar Riane - 1-73 A novel arctic fox survival strategy inspired optimization algorithm
by E. Subha & V. Jothi Prakash & S. Arul Antran Vijay
December 2024, Volume 48, Issue 5
- 1-11 On injective chromatic index of sparse graphs with maximum degree 5
by Jian Lu & Zhen-Mu Hong & Zheng-Jiang Xia - 1-14 An upper bound for neighbor-connectivity of graphs
by Hongliang Ma & Baoyindureng Wu - 1-18 Dynamic time window based full-view coverage maximization in CSNs
by Jingfang Su & Zeqing Li & Hongwei Du & Shengxin Liu - 1-20 Non-submodular maximization with a decomposable objective function
by Cheng Lu & Wenguo Yang - 1-21 Different due-window assignment scheduling with deterioration effects
by Yurong Zhang & Xi Wang & Li-Han Zhang & Xue Jia & Ji-Bo Wang - 1-22 Minimum $$ s-t $$ s - t hypercut in (s, t)-planar hypergraphs
by Abolfazl Hassanpour & Massoud Aman & Alireza Ebrahimi - 1-30 The sum of root-leaf distance interdiction problem with cardinality constraint by upgrading edges on trees
by Xiao Li & Xiucui Guan & Qiao Zhang & Xinyi Yin & Panos M. Pardalos - 1-44 Maximizing diversity and persuasiveness of opinion articles in social networks
by Liman Du & Wenguo Yang & Suixiang Gao
November 2024, Volume 48, Issue 4
- 1-7 New approximations for monotone submodular maximization with knapsack constraint
by Hongmin W. Du & Xiang Li & Guanghua Wang - 1-8 On greedy approximation algorithm for the minimum resolving dominating set problem
by Hao Zhong - 1-17 A MILP model for the connected multidimensional maximum bisection problem
by Zoran Lj. Maksimović - 1-18 Fashion game on graphs with more than two actions
by Qi Wang & Wensong Lin - 1-20 Optimizing hospital bed allocation for coordinated medical efficiency and quality improvement
by Haiyue Yu & Ting Shen & Liwei Zhong - 1-22 Explicit construction of mixed dominating sets in generalized Petersen graphs
by Meysam Rajaati Bavil Olyaei & Mohsen Alambardar Meybodi & Mohammad Reza Hooshmandasl & Ali Shakiba - 1-24 Efficient heuristics to compute minimal and stable feedback arc sets
by Claudia Cavallaro & Vincenzo Cutello & Mario Pavone - 1-28 Algorithms for the bin packing problem with scenarios
by Yulle G. F. Borges & Vinícius L. Lima & Flávio K. Miyazawa & Lehilton L. C. Pedrosa & Thiago A. Queiroz & Rafael C. S. Schouery - 1-48 The hamiltonian path graph is connected for simple s, t paths in rectangular grid graphs
by Rahnuma Islam Nishat & Venkatesh Srinivasan & Sue Whitesides
October 2024, Volume 48, Issue 3
- 1-9 W-prize-collecting scheduling problem on parallel machines
by Bo Hou & Tianjiao Guo & Suogang Gao & Guanghua Wang & Weili Wu & Wen Liu - 1-13 Approximate weak efficiency of the set-valued optimization problem with variable ordering structures
by Zhiang Zhou & Wenbin Wei & Fei Huang & Kequan Zhao - 1-14 The k-th Roman domination problem is polynomial on interval graphs
by Peng Li - 1-17 Matroid-rooted packing of arborescences
by Zoltán Szigeti - 1-18 Algorithmic study on liar’s vertex-edge domination problem
by Debojyoti Bhattacharya & Subhabrata Paul - 1-18 A common generalization of budget games and congestion games
by Fuga Kiyosue & Kenjiro Takazawa - 1-18 Approximation algorithm for prize-collecting vertex cover with fairness constraints
by Mingchao Zhou & Zhao Zhang & Ding-Zhu Du - 1-22 Faster algorithms for evacuation problems in networks with a single sink of small degree and bounded capacitated edges
by Yuya Higashikawa & Naoki Katoh & Junichi Teruyama & Yuki Tokuni - 1-22 Minimizing the maximum lateness for scheduling with release times and job rejection
by Imed Kacem & Hans Kellerer - 1-24 Approximation algorithms for solving the trip-constrained vehicle routing cover problems
by Jianping Li & Ping Yang & Junran Lichen & Pengxiang Pan - 1-25 Construction of floorplans for plane graphs over polygonal boundaries
by Rohit Lohani & Krishnendra Shekhawat - 1-27 Efficient branch-and-bound algorithms for finding triangle-constrained 2-clubs
by Niels Grüttemeier & Philipp Heinrich Keßler & Christian Komusiewicz & Frank Sommer
September 2024, Volume 48, Issue 2
- 1-13 The prize-collecting single machine scheduling with bounds and penalties
by Guojun Hu & Pengxiang Pan & Suding Liu & Ping Yang & Runtao Xie - 1-20 Minmax regret 1-sink location problems on dynamic flow path networks with parametric weights
by Tetsuya Fujie & Yuya Higashikawa & Naoki Katoh & Junichi Teruyama & Yuki Tokuni - 1-21 Meta-heuristic-based hybrid deep learning model for vulnerability detection and prevention in software system
by Lijin Shaji & R. Suji Pramila - 1-36 Efficient estimation of the modified Gromov–Hausdorff distance between unweighted graphs
by Vladyslav Oles & Nathan Lemons & Alexander Panchenko
August 2024, Volume 48, Issue 1
- 1-17 Algorithms for a two-machine no-wait flow shop scheduling problem with two competing agents
by Qi-Xia Yang & Long-Cheng Liu & Min Huang & Tian-Run Wang - 1-21 Polynomial algorithms for sparse spanners on subcubic graphs
by R. Gómez & F. K. Miyazawa & Y. Wakababayashi - 1-21 Maximizing stochastic set function under a matroid constraint from decomposition
by Shengminjie Chen & Donglei Du & Wenguo Yang & Suixiang Gao - 1-23 On the complexity of minimum maximal acyclic matchings
by Juhi Chaudhary & Sounaka Mishra & B. S. Panda - 1-24 Embedding and the first Laplace eigenvalue of a finite graph
by Takumi Gomyou & Toshimasa Kobayashi & Takefumi Kondo & Shin Nayatani - 1-24 First zagreb spectral radius of unicyclic graphs and trees
by Parikshit Das & Kinkar Chandra Das & Sourav Mondal & Anita Pal - 1-25 Approximating the probabilistic p-Center problem under pressure
by Marc Demange & Marcel A. Haddad & Cécile Murat - 1-25 Risk-adjusted exponential gradient strategies for online portfolio selection
by Jin’an He & Fangping Peng & Xiuying Xie - 1-27 Models for two-dimensional bin packing problems with customer order spread
by Mateus Martin & Horacio Hideki Yanasse & Maristela O. Santos & Reinaldo Morabito - 1-31 Customer churn prediction using a novel meta-classifier: an investigation on transaction, Telecommunication and customer churn datasets
by Fatemeh Ehsani & Monireh Hosseini - 1-38 An improved upper bound for the online graph exploration problem on unicyclic graphs
by Koji M. Kobayashi & Ying Li
July 2024, Volume 47, Issue 5
- 1-12 The frustum network model based on clique extension
by Anthony Bonato & Ryan Cushman & Trent G. Marbach & Zhiyuan Zhang - 1-12 Approximation algorithms for two clustered arc routing problems
by Xiaoguang Bao & Xinhao Ni - 1-15 Online learning under one sided $$\sigma $$ σ -smooth function
by Hongxiang Zhang & Dachuan Xu & Ling Gai & Zhenning Zhang - 1-15 On the oriented diameter of planar triangulations
by Debajyoti Mondal & N. Parthiban & Indra Rajasingh - 1-16 The maximum 3-star packing problem in claw-free cubic graphs
by Wenying Xi & Wensong Lin - 1-20 The critical node game
by Gabriele Dragotto & Amine Boukhtouta & Andrea Lodi & Mehdi Taobane - 1-21 On the SVP for low-dimensional circulant lattices
by Gengran Hu & Yanbin Pan & Renzhang Liu - 1-21 An intensification approach based on fitness landscape characteristics for job shop scheduling problem
by Aparecida de Fátima Castello Rosa & Fabio Henrique Pereira - 1-26 A novel local search approach with connected dominating degree-based incremental neighborhood evaluation for the minimum 2-connected dominating set problem
by Mao Luo & Huigang Qin & Xinyun Wu & Caiquan Xiong - 1-27 Phylogenetic network-assisted rooting of unrooted gene trees
by Jerzy Tiuryn & Natalia Rutecka & Paweł Górecki - 1-27 Improved kernelization and fixed-parameter algorithms for bicluster editing
by Manuel Lafond - 1-28 A neural network accelerated optimization method for FPGA
by Zhengwei Hu & Sijie Zhu & Leilei Wang & Wangbin Cao & Zhiyuan Xie - 1-29 Scheduling of elective operations with coordinated utilization of hospital beds and operating rooms
by Zhaohui Li & Haiyue Yu & Zhaowei Zhou - 1-29 New efficient algorithms for the two-machine no-wait chain-reentrant shop problem
by Nazim Sami & Karim Amrouche & Mourad Boudhar - 1-31 Diabetic prediction and classification of risk level using ODDTADC method in big data analytics
by G. Geo Jenefer & A. J. Deepa & M. Mary Linda - 1-31 Finding a second Hamiltonian decomposition of a 4-regular multigraph by integer linear programming
by Andrei V. Nikolaev & Egor V. Klimov - 1-32 Multiple shooting approach for finding approximately shortest paths for autonomous robots in unknown environments in 2D
by Phan Thanh An & Nguyen Thi Le - 1-32 Injective edge-coloring of claw-free subcubic graphs
by Qing Cui & Zhenmeng Han - 1-44 On ABC spectral radius of uniform hypergraphs
by Hongying Lin & Bo Zhou - 1-53 A hybrid grey wolf optimizer for engineering design problems
by Shuilin Chen & Jianguo Zheng
May 2024, Volume 47, Issue 4
- 1-2 Retraction Note: Lightweight multi-level authentication scheme for secured data transmission in IoT-Fog context
by Pratik Kanani & Pooja Vartak & Kanchan Dabre & Vipul Gohil & Archana Nanade & Niti Desai & Mamta Padole - 1-10 Approximation algorithm for the minimum partial connected Roman dominating set problem
by Yaoyao Zhang & Zhao Zhang & Ding-Zhu Du - 1-14 Approximation algorithms for maximum weighted target cover problem with distance limitations
by Jianhong Jin & Yingli Ran & Zhao Zhang - 1-16 Planar graphs are acyclically edge $$(\Delta + 5)$$ ( Δ + 5 ) -colorable
by Qiaojun Shu & Guohui Lin - 1-17 The doubly metric dimensions of cactus graphs and block graphs
by Kairui Nie & Kexiang Xu