《Discrete Optimization》重点专注发布管理科学-应用数学领域的新研究,旨在促进和传播该领域相关的新技术和新知识。鼓励该领域研究者详细地发表他们的高质量实验研究和理论结果。该杂志创刊至今,在管理科学-应用数学领域,有较高影响力,对来稿文章质量要求较高,稿件投稿过审难度较大。欢迎广大同领域研究者投稿该杂志。
CiteScore | SJR | SNIP | CiteScore排名 | |||
---|---|---|---|---|---|---|
2.1 | 0.443 | 0.778 | 学科类别 | 分区 | 排名 | 百分位 |
大类:大类:Mathematics
小类:小类:AppliedMathematics
|
Q3 | 339/635 | 46% | |||
大类:大类:Mathematics
小类:小类:ComputationalTheoryandMathematics
|
Q3 | 106/176 | 40% | |||
大类:大类:Mathematics
小类:小类:TheoreticalComputerScience
|
Q3 | 89/130 | 31% |
按JIF指标学科分区 | 收录子集 | 分区 | 排名 | 百分位 |
---|---|---|---|---|
学科:MATHEMATICS, APPLIED | SCIE | Q3 | 200 / 331 | 39.7% |
学科:OPERATIONS RESEARCH & MANAGEMENT SCIENCE | SCIE | Q4 | 94 / 106 | 11.8% |
按JCI指标学科分区 | 收录子集 | 分区 | 排名 | 百分位 |
---|---|---|---|---|
学科:MATHEMATICS, APPLIED | SCIE | Q3 | 242 / 331 | 27.04% |
学科:OPERATIONS RESEARCH & MANAGEMENT SCIENCE | SCIE | Q3 | 70 / 106 | 34.43% |
文章名称
引用次数
On ve-degree and ev-degree of graphs
10
Global optimization of multilevel electricity market models including network design and graph partitioning
4
Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem
4
Robust combinatorial optimization with knapsack uncertainty
4
The quadratic minimum spanning tree problem and its variations
3
Two-level lot-sizing with inventory bounds
3
The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs
3
The vertex k-cut problem
3
Total dominating sequences in trees, split graphs, and under modular decomposition
3
Complexity of min-max-min robustness for combinatorial optimization under discrete uncertainty
3
国家/地区
发文量
TGERMANY (FED REP GER)
21
TUSA
17
TFrance
12
TCHINA MAINLAND
8
TCanada
8
TJapan
8
TItaly
6
TNetherlands
6
TIsrael
5
TEngland
4





