![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Journal of Combinatorial Optimization, Volume 47
Volume 47, Number 1, January 2024
- Lin Niu, Xiangwen Li
:
On the Alon-Tarsi number of semi-strong product of graphs. 1
Volume 47, Number 2, March 2024
- Francisco J. Tapia-Ubeda
, Pablo A. Miranda Gonzalez
, Gabriel Gutiérrez-Jarpa:
Integrating supplier selection decisions into an inventory location problem for designing the supply chain network. 2 - Tengteng Liang, Mingzu Zhang
, Sufang Liu:
Concentration behavior: 50 percent of h-extra edge connectivity of pentanary n-cube with exponential faulty edges. 3 - Thi Quynh Trang Vo, Mourad Baïou, Viet Hung Nguyen
:
A branch-and-cut algorithm for the balanced traveling salesman problem. 4 - Linqing Gao, Dengzhe Ha, Litao Ma, Jiqiang Chen:
The prediction model of water level in front of the check gate of the LSTM neural network based on AIW-CLPSO. 5 - Shikha Mehta
:
Improved shuffled Frog leaping algorithm with unsupervised population partitioning strategies for complex optimization problems. 6 - Jun Wu, Zhen Yang, Guiqing Zhang, Yongxi Cheng:
An extension of the Christofides heuristic for a single-depot multiple Hamiltonian path problem. 7 - A. Mohanapriya
, P. Renjith, N. Sadagopan:
On convexity in split graphs: complexity of Steiner tree and domination. 8 - Reza Naserasr, Weiqiang Yu:
On the packing number of antibalanced signed simple planar graphs of negative girth at least 5. 9 - G. Jaykrishnan, Asaf Levin
:
EPTAS for parallel identical machine scheduling with time restrictions. 10 - Hechao Liu, Lihua You, Yufei Huang, Zenan Du:
On sufficient conditions for Hamiltonicity of graphs, and beyond. 11 - Guangwei Wu, Fu Zuo, Feng Shi
, Jian-Xin Wang:
On scheduling multiple parallel two-stage flowshops with Johnson's Rule. 12 - Manuel V. C. Vieira
:
A linear ordering problem with weighted rank. 13 - Yingying Guo, Qiaoliang Li
:
Approximation algorithms for the fault-tolerant facility location problem with submodular penalties. 14
Volume 47, Number 3, April 2024
- Lin Sun
, Guanglong Yu, Jianliang Wu:
On list (p, 1)-total labellings of special planar graphs and 1-planar graphs. 15 - Retraction Note: Algorithm research on the influence of financing structure and cash holding on enterprise innovation based on system GMM model function theory. 16
- Joyashree Mondal, S. Vijayakumar
:
Star covers and star partitions of double-split graphs. 17 - Retraction Note: Design of extended dense coding protocol strategy based on combinatorial optimization. 18
- Retraction Note: Sector-like optimization model of 5G base transceiver stations redeployment and the generalization. 19
- Retraction Note: Optimal design of garments for high-temperature operations based on the finite difference method. 20
- Retraction Note: The mechanism and test of the impact of environmental regulation and technological innovation on high quality development. 21
- Retraction Note: Spatial-temporal deep learning model based rumor source identification in social networks. 22
- Retraction Note: Dynamic analysis of structures installed hysteretic dampers with hardening post-yielding stiffness using connection element method. 23
- Retraction Note: Research on the influencing factors of living energy consumption and carbon emissions based on spatiotemporal model. 24
- Retraction Note: 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. 25
- Retraction Note: A combination of TEXTCNN model and Bayesian classifier for microblog sentiment analysis. 26
- Retraction Note: Optimization design and implementation of shared information management system for industrial design network platform. 27
- Retraction Note: Premium rate making of jujube revenue insurance in Xinjiang Aksu Region based on the mixed Copula-stochastic optimization model. 28
- Retraction Note: AHI: a hybrid machine learning model for complex industrial information systems. 29
- Retraction Note: Capacitance pin defect detection based on deep learning. 30
- Retraction Note: ARX and ARMAX modelling of SBCNC-60 machine for surface roughness and MRR with optimization of system response using PSO. 31
- Haodong Liu, Kelin Luo
, Yinfeng Xu, Huili Zhang:
Online car-sharing problem with variable booking times. 32 - Asaf Levin
:
Selecting intervals to optimize the design of observational studies subject to fine balance constraints. 33 - Ruiqing Sun:
Randomized approximation schemes for minimizing the weighted makespan on identical parallel machines. 34 - Retraction Note: Research on shale gas productivity prediction method based on optimization algorithm. 35
- Retraction Note: Enhanced post-quantum key escrow system for supervised data conflict of interest based on consortium blockchain. 36
- Retraction Note: A novel dynamic en-route and slot allocation method based on receding horizon control. 37
- Retraction Note: Combinatorial optimization analysis of the production process of C4 olefins from ethanol based on the PSO-BP algorithm. 38
- Retraction Note: Sound absorption performance of EPDM-based textile composites investigated through the transfer matrix model. 39
- Retraction Note: AISAS model-based statistical analysis for intelligent eldercare products consumption research. 40
- Retraction Note: Identifying vital nodes in hypernetwork based on local centrality. 41
- Retraction Note: A Bayesian analysis based on multivariate stochastic volatility model: evidence from green stocks. 42
- Retraction Note: On Aα-spectrum of a unicyclic graph. 43
- Retraction Note: Expression recognition algorithm based on MDS-HOG feature optimization and differential weights. 44
- Alexander V. Kononov
, Marina Pakulich:
An exact borderline between the NP-hard and polynomial-time solvable cases of flow shop scheduling with job-dependent storage requirements. 45 - Alain Hertz
, Sébastien Bonte, Gauvain Devillez, Hadrien Mélot:
The average size of maximal matchings in graphs. 46 - Mehdi Ghiyasvand
, Iman Keshtkar:
Minimizing the expense transmission time from the source node to demand nodes. 47 - Fei-Huang Chang, Ma-Lian Chia, Shih-Ang Jiang, David Kuo, Jing-Ho Yan:
n-fold L(2, 1)-labelings of Cartesian product of paths and cycles. 48 - Retraction Note: Alternating-direction-method-of-multipliers-based fast model predictive control for an aerial trees-pruning robot. 49
- Retraction Note: The Sachs theorem and its application on extended adjacency matrix of graphs. 50
- Retraction Note: Cost-optimized data placement strategy for social network with security awareness in edge-cloud computing environment. 51
- Retraction Note: International market risk, monetary policy stance, and corporate financing: China's economic recovery in the post-pandemic era. 52
- Retraction Note: Analysis of modern circulation industry development level using industrial structure mechanism. 53
- Matthew Broussard, Bala Krishnamoorthy
:
A tight max-flow min-cut duality theorem for nonlinear multicommodity flows. 54
Volume 47, Number 4, May 2024
- Kameng Nip, Peng Xie:
Computational complexity and algorithms for two scheduling problems under linear constraints. 55 - Ibrahima Diarrassouba, Youssouf Hadhbi
, Ali Ridha Mahjoub:
Branch-and-cut-and-price algorithm for the constrained-routing and spectrum assignment problem. 56 - Milad Ahanjideh, Tínaz Ekim
, Mehmet Akif Yildiz
:
Maximum size of a triangle-free graph with bounded maximum degree and matching number. 57 - Jiaming Hu, Dachuan Xu, Donglei Du, Cuixia Miao
:
Differentially private submodular maximization with a cardinality constraint over the integer lattice. 58 - Yukun Cheng
, Zhanghao Yao, Tingting Meng:
Cooperation models in automotive supply chain under low-carbon emission reduction policies. 59 - Jianhong Jin, Yingli Ran, Zhao Zhang
:
Approximation algorithms for maximum weighted target cover problem with distance limitations. 60 - Siavash Askari, Manouchehr Zaker:
Spread of influence with incentives in edge-weighted graphs with emphasis on some families of graphs. 61 - Yaoyao Zhang, Zhao Zhang, Ding-Zhu Du:
Approximation algorithm for the minimum partial connected Roman dominating set problem. 62 - Retraction Note: Lightweight multi-level authentication scheme for secured data transmission in IoT-Fog context. 63
- Qiaojun Shu, Guohui Lin
:
Planar graphs are acyclically edge (Δ + 5)-colorable. 64 - Qi Zhao, Wenjing Liu
, Qingqin Nong
, Qizhi Fang:
Constrained heterogeneous two-facility location games with sum-variant. 65 - Sundeep Raj, Sandesh Tripathi, K. C. Tripathi, Rajendra Kumar Bharti:
Hybrid optimized deep recurrent neural network for atmospheric and oceanic parameters prediction by feature fusion and data augmentation model. 66 - Kairui Nie
, Kexiang Xu
:
The doubly metric dimensions of cactus graphs and block graphs. 67 - Zakir Deniz
:
Some results on 2-distance coloring of planar graphs with girth five. 68 - Suthee Ruangwises
:
Verifying the first nonzero term: physical ZKPs for ABC End View, Goishi Hiroi, and Toichika. 69 - Robert D. Barish
, Tetsuo Shibuya:
Proper colorability of segment intersection graphs. 70
Volume 47, Number 5, July 2024
- Phan Thanh An
, Nguyen Thi Le:
Multiple shooting approach for finding approximately shortest paths for autonomous robots in unknown environments in 2D. 71 - Mao Luo, Huigang Qin, Xinyun Wu
, Caiquan Xiong:
A novel local search approach with connected dominating degree-based incremental neighborhood evaluation for the minimum 2-connected dominating set problem. 72 - Wenying Xi, Wensong Lin
:
The maximum 3-star packing problem in claw-free cubic graphs. 73 - Gabriele Dragotto
, Amine Boukhtouta
, Andrea Lodi
, Mehdi Taobane
:
The critical node game. 74 - Zhaohui Li, Haiyue Yu
, Zhaowei Zhou:
Scheduling of elective operations with coordinated utilization of hospital beds and operating rooms. 75 - Hongxiang Zhang, Dachuan Xu, Ling Gai
, Zhenning Zhang:
Online learning under one sided σ-smooth function. 76 - Aparecida de Fátima Castello Rosa, Fábio Henrique Pereira
:
An intensification approach based on fitness landscape characteristics for job shop scheduling problem. 77 - Anthony Bonato, Ryan Cushman, Trent G. Marbach, Zhiyuan Zhang:
The frustum network model based on clique extension. 78 - Debajyoti Mondal
, N. Parthiban
, Indra Rajasingh
:
On the oriented diameter of planar triangulations. 79 - G. Geo Jenefer, A. J. Deepa, M. Mary Linda:
Diabetic prediction and classification of risk level using ODDTADC method in big data analytics. 80 - Gengran Hu
, Yanbin Pan, Renzhang Liu:
On the SVP for low-dimensional circulant lattices. 81 - Jerzy Tiuryn, Natalia Rutecka, Pawel Górecki
:
Phylogenetic network-assisted rooting of unrooted gene trees. 82 - Nazim Sami
, Karim Amrouche, Mourad Boudhar:
New efficient algorithms for the two-machine no-wait chain-reentrant shop problem. 83 - Zhengwei Hu, Sijie Zhu, Leilei Wang, Wangbin Cao, Zhiyuan Xie:
A neural network accelerated optimization method for FPGA. 84 - Hongying Lin, Bo Zhou
:
On ABC spectral radius of uniform hypergraphs. 85 - Shuilin Chen
, Jianguo Zheng:
A hybrid grey wolf optimizer for engineering design problems. 86 - Qing Cui
, Zhenmeng Han:
Injective edge-coloring of claw-free subcubic graphs. 87 - Xiaoguang Bao, Xinhao Ni:
Approximation algorithms for two clustered arc routing problems. 88 - Andrei V. Nikolaev
, Egor V. Klimov
:
Finding a second Hamiltonian decomposition of a 4-regular multigraph by integer linear programming. 89 - Manuel Lafond
:
Improved kernelization and fixed-parameter algorithms for bicluster editing. 90
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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.