default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Optimization, Volume 49
Volume 49, Number 1, January 2025
- E. Subha, V. Jothi Prakash
, S. Arul Antran Vijay:
A novel arctic fox survival strategy inspired optimization algorithm. 1 - Canh V. Pham:
Enhanced deterministic approximation algorithm for non-monotone submodular maximization under knapsack constraint with linear query complexity. 2 - Qie Li, Zichen Wang, Hongwei Du:
Incentive mechanism design for value-decreasing tasks in dynamic competitive edge computing networks. 3 - Xiaowei Li, Peihai Liu, Xiwen Lu:
New bounds on the price of anarchy of selfish bin packing with partial punishment. 4 - Konstantinos Zervoudakis, Stelios Tsafarakis:
Customer segmentation using flying fox optimization algorithm. 5 - Han Zhang, Lingfa Lu, Jinjiang Yuan:
Online scheduling on an unbounded parallel-batch machine to minimize the weighted makespan. 6 - Xin Sun, Tiande Guo, Congying Han, Hongyang Zhang:
Greedy algorithms for stochastic monotone k-submodular maximization under full-bandit feedback. 7 - Mohammad R. Salavatipour, Lijiangnan Tian:
Approximation algorithms for the airport and railway problem. 8 - SeongCheol Yoon, Daehee Seo, Su-Hyun Kim, Im-Yeong Lee:
A study on k-walk generation algorithm to prevent the tottering in graph edit distance heuristic algorithms. 9 - Canan Çiftçi, Aysun Aytaç:
Np-completeness and bounds for disjunctive total domination subdivision. 10 - G. Balachandran, S. Ranjith, T. R. Chenthil, G. C. Jagan:
Facial expression-based emotion recognition across diverse age groups: a multi-scale vision transformer with contrastive learning approach. 11 - Jinghan Zhao, Yongxi Cheng, Jan Eube, Haodong Liu:
Online multiple one way non-preemptive time series search with interrelated prices. 12 - Nizar Riane:
Spectral influence in networks: an application to input-output analysis. 13 - Rita Zrour, Lidija Comic, Eric Andres, Gaëlle Largeteau-Skapin:
Discrete circles: analytical definition and generation in the hexagonal grid. 14 - Mohsen Alambardar Meybodi, Amir Kafshdar Goharshady, Mohammad Reza Hooshmandasl, Ali Shakiba:
Optimal blocks for maximizing the transaction fee revenue of Bitcoin miners. 15 - Marshall Yang, Carl Yerger, Runtian Zhou:
Lollipop and cubic weight functions for graph pebbling. 16 - V. Agalya, Muthuvinayagam Madasamy, Gandhi Ramasamy:
Optimal dispatching of electric vehicles based on optimized deep learning in IoT. 17
Volume 49, Number 2, March 2025
- Alexander A. Kharlamov, Aleksey N. Raskhodchikov, Maria Pilgun:
Social media actors: perception and optimization of influence across different types. 18 - Paul Deuker, Ulf Friedrich:
Recognizing integrality of weighted rectangles partitions. 19 - Nonthaphat Wongwattanakij, Nattawut Phetmak, Chaiporn Jaikaeo, Jittat Fakcharoenphol:
An improved PTAS for covering targets with mobile sensors. 20 - Qiufen Ni, Jun Wang, Zhongzheng Tang:
Degree and betweenness-based label propagation for community detection. 21 - Yuan-Hsun Lo, Hung-Lin Fu, Yijin Zhang, Wing Shing Wong:
The undirected optical indices of trees. 22 - Jinze Hu, Shengjin Ji, Qing Cui:
$(K_{1}\vee {P_{t})}$-saturated graphs with minimum number of edges. 23 - Argyrios Deligkas, Mohammad Lotfi, Alexandros A. Voudouris:
Agent-constrained truthful facility location games. 24 - Chenhao Wang, Yao Wang, Shaojie Tang:
Advertising meets assortment planning: joint advertising and assortment optimization under multinomial logit model. 25 - Nurdan Kara, Hale Gonce Kocken, Hande Günay Akdemir:
A fuzzy approach for the intuitionistic multi-objective linear fractional programming problem using a bisection method. 26 - S. Kumar Reddy Mallidi, Rajeswara Rao Ramisetty:
Embedded-filter ACO using clustering based mutual information for feature selection. 27 - Zhanbing Guo, Yejie Zhang:
Solving the optimal order quantity with unknown parameters for products with stock-dependent demand and variable holding cost rate. 28 - Jiguang Wang, Fangfang Guo, Jie Shen:
An L2 regularization reduced quadratic surface support vector machine model. 29 - Peng Li, Xinyi Xue, Xingli Zhou:
The edge-vertex domination and weighted edge-vertex domination problem. 30 - Marietta Galea, John Baptist Gauci:
The minimum orientable genus of the repeated Cartesian product of graphs. 31 - Zhichao Geng, Lingfa Lu:
Multiple identical serial-batch machines scheduling with release dates and submodular rejection penalties. 32 - Nader H. Bshouty:
Improved lower bound for estimating the number of defective items. 33 - Zai-Xing Sun, Hejiao Huang, Zhikai Li, Chonglin Gu:
Energy-efficient real-time multi-workflow scheduling in container-based cloud. 34 - Pairote Yiarayong:
Enhancing decision-making in cloud service provider selection using probabilistic p, q-rung orthopair fuzzy model. 35
Volume 49, Number 3, April 2025
- Jianxi Li, Dongxin Tu, Wai Chee Shiu:
Some results on the total (zero) forcing number of a graph. 36 - Na Li, Ran Ma, Yuzhong Zhang:
Single-machine scheduling with the learning effect of processing time and the deterioration effect of delivery time for prefabricated components. 37 - Zhuyinan Wang, Chen Zhang, Zhiyi Tan:
Inefficiency of multiplicative approximate Nash equilibrium for scheduling games. 38 - Minqin Liu, Wei Yu, Zhaohui Liu, Xinmeng Guo:
Exact and approximation algorithms for the multi-depot data mule scheduling with handling time and time span constraints. 39 - Danila D. Cherkashin, Emanuele Paolini, Yana Teplitskaya:
Steiner trees with infinitely many terminals on the sides of an angle. 40 - Jianmin Shi:
Superposed semi-Markov decision process with application to optimal maintenance systems. 41 - Xiyang Liu, Fangjun Luan:
Improved black widow optimization algorithm for multi-objective hybrid flow shop batch-scheduling problem. 42 - Gabriel Gazzinelli Guimarães, Kelly Cristina Poldi, Mateus Martin:
Mathematical models for the one-dimensional cutting stock problem with setups and open stacks. 43 - Yuanyuan Wang, Xin Chen, Qizhi Fang, Qingqin Nong, Wenjing Liu:
Guaranteeing fairness and efficiency under budget constraints. 44 - Qing Zhao, Zhen Li, Jianqiang Li, Jianxiong Guo, Xingjian Ding, Deying Li:
Uav trajectory optimization for maximizing the ToI-based data utility in wireless sensor networks. 45 - Zhongzheng Tang, Zhuo Diao:
A sharp upper bound for the edge dominating number of hypergraphs with minimum degree. 46 - Pengxiang Pan, Junran Lichen, Ping Yang, Jianping Li:
Approximation algorithms for solving the heterogeneous rooted tree/path cover problems. 47 - Li Zhang, Qiaoliang Li:
Approximation algorithm for dynamic facility location problem. 48 - Mingyang Gong, Zhi-Zhong Chen, Guohui Lin, Lusheng Wang:
An improved approximation algorithm for covering vertices by 4+-paths. 49 - Zhaoman Huang, Yayu Yang, Mingzu Zhang, Weihua Yang:
Link fault tolerability of the Cartesian product power graph (K9-C9)n: conditional edge-connectivities under six link fault patterns. 50 - Yifei Li, Donghua Yang, Jianzhong Li:
Testing Higher-order Clusterability on Graphs. 51 - Francisco López, Lars Karlsson, Paolo Bientinesi:
On the parenthesisations of matrix chains: All are useful, few are essential. 52 - Tesshu Hanaka, Airi Ikeyama, Hirotaka Ono:
Maximizing utilitarian and Egalitarian welfare of fractional hedonic games on tree-like graphs. 53
Volume 49, Number 4, May 2025
- Haitao Xu, Jingru Zhang:
The two-center problem of uncertain points on cactus graphs. 54 - Lara Löhken, Michael Stiglmayr:
A multi-objective perspective on the cable-trench problem. 55 - Anis Naanaa:
Chaotic guided local search algorithm for solving global optimization and engineering problems. 56 - Brian Godwin Lim, Renzo Roel Tan, Richard de Jesus, Lessandro Estelito Garciano, Agnes D. Garciano, Kazushi Ikeda:
Path survival reliabilities as measures of reliability for lifeline utility networks. 57 - Sangram K. Jena, K. Subramani:
Analyzing the 3-path vertex cover problem in selected graph classes. 58 - Leah Epstein, Hanan Zebedat-Haider:
Semi-online scheduling with non-increasing job sizes and a buffer. 59 - Ibrahim Dan Dije, Franklin Djeumou Fomeni, Leandro C. Coelho:
A 3-space dynamic programming heuristic for the cubic knapsack problem. 60 - Dekel Tsur:
Faster parameterized algorithms for variants of 3-Hitting Set. 61 - Beyza Görkemli, Ebubekir Kaya, Dervis Karaboga, Bahriye Akay:
A review on the versions of artificial bee colony algorithm for scheduling problems. 62 - Fanyu Kong, Jiaxin Song, Cuixia Miao, Yuzhong Zhang:
Scheduling problems with rejection in green manufacturing industry. 63 - Yuying Li, Min Li, Yang Zhou, Shuxian Niu, Qian Liu:
Randomized approximation algorithms for monotone k-submodular function maximization with constraints. 64 - Shiksha, Krishnendra Shekhawat, Ritu Chandna, Akshaj Gupta:
Linear-time algorithm for generating L-shaped floorplans using canonical ordering technique. 65 - Junhui Ye, Huihuang Jiang, Guangting Chen, Yong Chen, Guohui Lin, An Zhang:
Better approximating SONET k-edge partition for small capacity k. 66 - K. Hema Priya, K. Valarmathi:
Big data-driven optimal weighted fused features-based ensemble learning classifier for thyroid prediction with heuristic algorithm. 67 - Xiangzhi Tu, Peng Li, Yangjing Long, Aifa Wang:
Neighbor sum distinguishable k -edge colorings of joint graphs. 68
Volume 49, Number 5, July 2025
- Miao Yu, Wang Zhou, Yu Zhao:
Impact of payment schemes on performance in a medical cost-sharing system: bundled payment vs. total prepayment. 69 - Ante Custic, Wei Yang, Yang Wang, Abraham P. Punnen:
The independent quadratic assignment problem: complexity and polynomially solvable special cases. 70 - Qinqin Gong, Ling Gai, Yanjun Jiang, Yang Lv, Ruiqi Yang:
Approximating combinatorial contracts with a cardinality constraint. 71 - Tianjiao Guo, Wen Liu, Gengsheng Zhang, Bo Hou:
Approximation algorithms for the W-prize-collecting scheduling problem on a single machine with submodular rejection penalties. 72 - Steffen Borgwardt, Angela Morrison:
On combinatorial network flows algorithms and circuit augmentation for pseudoflows. 73 - Jiazhu Fang, Qizhi Fang, Wenjing Liu, Qingqin Nong, Alexandros A. Voudouris:
Mechanism Design with Predictions for Facility Location Games with Candidate Locations. 74 - Daniel Li Li, Erfang Shan:
Pseudo-Shapley value for weak games of threats. 75 - Qi Wang, Bo Hou, Gengsheng Zhang, Yisheng Zhou, Wen Liu:
Approximation algorithms for the partition set cover problem with penalties. 76 - Hao Li, Eminjan Sabir:
Further combinatorial analysis of substar reliability in star networks. 77 - Christian Biefel, Martina Kuchlbauer, Frauke Liers, Lisa Waldmüller:
Robust static and dynamic maximum flows. 78 - Mingyang Gong, Guangting Chen, Guohui Lin, Bing Su:
Improved approximation algorithms for multiprocessor indivisible coflow scheduling. 79 - Tingting Meng, Yukun Cheng, Xujin Pu, Rui Li:
The influence of carbon sink trading on carbon emission reduction in agricultural supply chains. 80 - M. Sathya, V. Mareeswari, M. Jeyaselvi, A. Solairaj:
Smart health system with deep kronecker network-based key generation for privacy-aware aggregate authentication and access control in IoT. 81 - Xinmeng Guo, Wei Yu, Zhaohui Liu:
Approximating the maximum weight cycle/path partition in graphs with weights one and two. 82 - Venkadeshan Ramalingam, R. Gopal, Syed Ziaur Rahman, R. Senthil:
ZeSAI: AI vigilant malware detection in email security with zero shot-based hybrid network and threat intelligence integration. 83 - Ye Wang, Yanyan Song:
On some path-critical Ramsey numbers. 84 - Hoang Giang Pham, Thuy Anh Ta, Tien Mai:
An exponential cone integer programming and piece-wise linear approximation approach for 0-1 fractional programming. 85
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-06-21 00:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
