JOURNAL OF COMBINATORIAL OPTIMIZATION
ISSN:1382-6905

JOURNAL OF COMBINATORIAL OPTIMIZATION

J COMB OPTIM
学科领域:数学
是否预警:不在预警名单内
是否OA:
录用周期:较慢,6-12周
新锐分区:数学4区
年发文量:103
影响因子:1.1
JCR分区:Q2

基本信息

《组合优化杂志》的目标是推进和促进组合优化的理论和应用,这是一个研究领域,在应用数学,计算机科学和运筹学的交叉点,并与许多其他领域,如计算复杂性,计算生物学,VLSI设计,通信网络和管理科学重叠。它包括复杂性分析和算法设计的组合优化问题,数值实验和问题发现与应用在科学和工程。杂志的组合优化出版的参考论文处理所有理论,计算和应用方面的组合优化。它还出版有关书籍的评论和期刊的特刊。
1382-6905SCIE/Scopus收录
1.1
0.9
2026年3月发布
点击查看历史分区趋势    >
大类学科小类学科Top期刊综述期刊
数学4区
COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS 计算机:跨学科应用
4区
MATHEMATICS, APPLIED 应用数学
4区
N/A
WOS期刊SCI分区  2024-2025最新升级版
按JIF指标学科分区收集子录JIF分区JIF排名百分位
学科:COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
SCIE
Q4
148/177
学科:MATHEMATICS, APPLIED
SCIE
Q2
162/344
按JCR指标学科分区收集子录JCR分区JCR排名百分位
学科:COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
SCIE
Q3
119/177
学科:MATHEMATICS, APPLIED
SCIE
Q3
228/344
40
103
-0较慢,6-12周-数学-计算机:跨学科应用
0%
时间预警情况
2026年03月发布的新锐学术版不在预警名单中
2025年03月发布的2025版不在预警名单中
2024年02月发布的2024版不在预警名单中
2023年01月发布的2023版不在预警名单中
2021年12月发布的2021版不在预警名单中
2020年12月发布的2020版不在预警名单中
100.00%7.89%-
CiteScore:2.60
SJR:0.432
SNIP:0.844
学科类别分区排名百分位
大类:Mathematics
小类:Discrete Mathematics and Combinatorics
Q1
20 / 95
大类:Mathematics
小类:Applied Mathematics
Q2
276 / 665
大类:Mathematics
小类:Control and Optimization
Q2
70 / 160
大类:Mathematics
小类:Computational Theory and Mathematics
Q3
101 / 197
大类:Mathematics
小类:Computer Science Applications
Q3
549 / 947

期刊高被引文献

Gene tree reconciliation including transfers with replacement is NP-hard and FPT
来源期刊:Journal of Combinatorial OptimizationDOI:10.1007/s10878-019-00396-z
Speed scaling on parallel processors with migration
来源期刊:Journal of Combinatorial OptimizationDOI:10.1007/S10878-018-0352-0
Amortized efficiency of constructing multiple independent spanning trees on bubble-sort networks
来源期刊:Journal of Combinatorial OptimizationDOI:10.1007/s10878-019-00430-0
Space-efficient algorithms for maximum cardinality search, its applications, and variants of BFS
来源期刊:Journal of Combinatorial OptimizationDOI:10.1007/s10878-018-0270-1
Semipaired domination in maximal outerplanar graphs
来源期刊:Journal of Combinatorial OptimizationDOI:10.1007/s10878-019-00427-9
Better approximability results for min–max tree/cycle/path cover problems
来源期刊:Journal of Combinatorial OptimizationDOI:10.1007/s10878-018-0268-8
Minmax scheduling problems with common due-date and completion time penalty
来源期刊:Journal of Combinatorial OptimizationDOI:10.1007/S10878-018-0365-8
On the extremal cacti of given parameters with respect to the difference of zagreb indices
来源期刊:Journal of Combinatorial OptimizationDOI:10.1007/S10878-019-00391-4
On perfect Roman domination number in trees: complexity and bounds
来源期刊:Journal of Combinatorial OptimizationDOI:10.1007/S10878-019-00408-Y
On the 2-rainbow domination stable graphs
来源期刊:Journal of Combinatorial OptimizationDOI:10.1007/S10878-018-0355-X
Maximizing profit of multiple adoptions in social networks with a martingale approach
来源期刊:Journal of Combinatorial OptimizationDOI:10.1007/S10878-018-0361-Z
The one-cop-moves game on planar graphs
来源期刊:Journal of Combinatorial OptimizationDOI:10.1007/S10878-019-00417-X
The eigenvectors to the p-spectral radius of general hypergraphs
来源期刊:Journal of Combinatorial OptimizationDOI:10.1007/S10878-019-00393-2
Parallel-machine scheduling with job-dependent cumulative deterioration effect and rejection
来源期刊:Journal of Combinatorial OptimizationDOI:10.1007/s10878-019-00429-7
A dynamic approach to detecting, eliminating and fixing memory leaks
来源期刊:Journal of Combinatorial OptimizationDOI:10.1007/S10878-019-00398-X
A new lower bound on the domination number of a graph
来源期刊:Journal of Combinatorial OptimizationDOI:10.1007/S10878-019-00409-X
Deadlock resolution in wait-for graphs by vertex/arc deletion
来源期刊:Journal of Combinatorial OptimizationDOI:10.1007/s10878-018-0279-5
LP-based pivoting algorithm for higher-order correlation clustering
来源期刊:Journal of Combinatorial OptimizationDOI:10.1007/S10878-018-0354-Y
A linear time–cost tradeoff problem with multiple milestones under a comb graph
来源期刊:Journal of Combinatorial OptimizationDOI:10.1007/S10878-019-00385-2
A lower bound for online rectangle packing
来源期刊:Journal of Combinatorial OptimizationDOI:10.1007/s10878-019-00423-z
An improved lower bound on the growth constant of polyiamonds
来源期刊:Journal of Combinatorial OptimizationDOI:10.1007/s10878-018-0336-0
Unbounded parallel-batch scheduling under agreeable release and processing to minimize total weighted number of tardy jobs
来源期刊:Journal of Combinatorial OptimizationDOI:10.1007/S10878-019-00407-Z
Optimal channel assignment with list-edge coloring
来源期刊:Journal of Combinatorial OptimizationDOI:10.1007/S10878-018-00376-9
Jointly stable matchings
来源期刊:Journal of Combinatorial OptimizationDOI:10.1007/S10878-019-00402-4
Dynamic rank-maximal and popular matchings
来源期刊:Journal of Combinatorial OptimizationDOI:10.1007/s10878-018-0348-9
Estimating the number of basins of attraction of multi-objective combinatorial problems
来源期刊:Journal of Combinatorial OptimizationDOI:10.1007/S10878-018-0357-8
Independent bondage number of a graph
来源期刊:Journal of Combinatorial OptimizationDOI:10.1007/s10878-018-0319-1
An improved algorithm for the $$(n, 3)$$(n,3)-MaxSAT problem: asking branchings to satisfy the clauses
来源期刊:Journal of Combinatorial OptimizationDOI:10.1007/S10878-019-00421-1
A spectral partitioning algorithm for maximum directed cut problem
来源期刊:Journal of Combinatorial OptimizationDOI:10.1007/S10878-018-0369-4
The new treatment mode research of hepatitis B based on ant colony algorithm
来源期刊:Journal of Combinatorial OptimizationDOI:10.1007/s10878-019-00478-y
On operations preserving semi-transitive orientability of graphs
来源期刊:Journal of Combinatorial OptimizationDOI:10.1007/s10878-018-0358-7
Approximation algorithms for Median Hub Location Problems
来源期刊:Journal of Combinatorial OptimizationDOI:10.1007/S10878-019-00386-1
Energy-efficient weak-barrier coverage with adaptive sensor rotation
来源期刊:Journal of Combinatorial OptimizationDOI:10.1007/s10878-019-00491-1
An improved mechanism for selfish bin packing
来源期刊:Journal of Combinatorial OptimizationDOI:10.1007/s10878-019-00476-0
Unfolding some classes of orthogonal polyhedra of arbitrary genus
来源期刊:Journal of Combinatorial OptimizationDOI:10.1007/s10878-018-0299-1
Balanced tree partition problems with virtual nodes
来源期刊:Journal of Combinatorial OptimizationDOI:10.1007/S10878-018-0351-1
Improved algorithms for single vehicle scheduling on tree/cycle networks
来源期刊:Journal of Combinatorial OptimizationDOI:10.1007/S10878-019-00420-2
Reoptimization of minimum latency problem revisited: don’t panic when asked to revisit the route after local modifications
来源期刊:Journal of Combinatorial OptimizationDOI:10.1007/s10878-018-0317-3
Medical consumable usage control based on Canopy_K-means clustering and WARM
来源期刊:Journal of Combinatorial OptimizationDOI:10.1007/s10878-019-00468-0
Integer programming formulations for the shared multicast tree problem
来源期刊:Journal of Combinatorial OptimizationDOI:10.1007/s10878-019-00428-8
A temporal logic programming approach to planning
来源期刊:Journal of Combinatorial OptimizationDOI:10.1007/S10878-019-00389-Y
Determining the interset distance
来源期刊:Journal of Combinatorial OptimizationDOI:10.1007/S10878-019-00384-3
Batch scheduling of nonidentical job sizes with minsum criteria
来源期刊:Journal of Combinatorial OptimizationDOI:10.1007/S10878-019-00419-9
An approximation algorithm for genome sorting by reversals to recover all adjacencies
来源期刊:Journal of Combinatorial OptimizationDOI:10.1007/S10878-018-0346-Y
An improved algorithm for two stage time minimization assignment problem
来源期刊:Journal of Combinatorial OptimizationDOI:10.1007/s10878-018-0318-2
The spectral radius and domination number in linear uniform hypergraphs
来源期刊:Journal of Combinatorial OptimizationDOI:10.1007/S10878-019-00424-Y
Two-stage stochastic days-off scheduling of multi-skilled analysts with training options
来源期刊:Journal of Combinatorial OptimizationDOI:10.1007/S10878-018-0368-5
Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10
来源期刊:Journal of Combinatorial OptimizationDOI:10.1007/s10878-018-00375-w
Independence and matching number of some graphs
来源期刊:Journal of Combinatorial OptimizationDOI:10.1007/S10878-018-0356-9
Research on dispatch of drugs and consumables in SPD warehouse of large scale hospital under uncertain environment: take respiratory consumables as an example
来源期刊:Journal of Combinatorial OptimizationDOI:10.1007/s10878-019-00505-y

相关文章

2026年3月发布
大类学科小类学科Top期刊综述期刊
数学4区
COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS 计算机:跨学科应用
4区
MATHEMATICS, APPLIED 应用数学
4区
N/A
2025年3月升级版
大类学科小类学科Top期刊综述期刊
数学4区
COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS 计算机:跨学科应用
4区
MATHEMATICS, APPLIED 应用数学
4区
2023年12月旧的升级版
大类学科小类学科Top期刊综述期刊
数学4区
COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS 计算机:跨学科应用
4区
MATHEMATICS, APPLIED 应用数学
4区