Mathematical Programming
短名 | Math. Program. |
Journal Impact | 2.23 |
国际分区 | OPERATIONS RESEARCH & MANAGEMENT SCIENCE(Q2) |
期刊索引 | SCI Q1中科院 2 区 |
ISSN | 0025-5610, 1436-4646 |
h-index | 143 |
国内分区 | 数学(2区)数学计算机软件工程(2区)数学应用数学(2区)数学运筹学与管理科学(3区) |
Top期刊 | 是 |
MATHEMATICAL PROGRAMMING 发表涉及数学优化各个方面的原创文章;也就是说,所有直接或间接使用的关于优化许多变量的函数的问题,通常受到一组约束。这涉及理论和计算问题以及应用研究。除了线性、非线性、整数、圆锥、随机和组合优化等标准主题外,还包括用于制定和应用数学规划模型、凸、非光滑和变分分析、多面体理论、变分不等式以及控制和博弈的技术从数学规划的角度看理论。
期刊主页投稿网址涉及主题 | 数学数学分析数学优化计算机科学算法应用数学几何学数值分析组合数学物理程序设计语言离散数学生物经济量子力学工程类哲学 |
出版信息 | 出版商: Springer-Verlag GmbH and Co. KG,出版周期: Monthly,期刊类型: journal |
基本数据 | 创刊年份: 1971,原创研究文献占比: 100.00%,自引率:4.50%, Gold OA占比: 33.04% |
平均审稿周期 | 网友分享经验:偏慢,4-8周 |
平均录用比例 | 网友分享经验:较易 |
期刊引文格式
这些示例是对学术期刊文章的引用,以及它们应该如何出现在您的参考文献中。
并非所有期刊都按卷和期组织其已发表的文章,因此这些字段是可选的。有些电子期刊不提供页面范围,而是列出文章标识符。在这种情况下,使用文章标识符而不是页面范围是安全的。
只有1位作者的期刊
有2位作者的期刊
有3位作者的期刊
有5位以上作者的期刊
书籍引用格式
以下是创作和编辑的书籍的参考文献的示例。
学位论文引用格式
网页引用格式
这些示例是对网页的引用,以及它们应该如何出现在您的参考文献中。
专利引用格式
最新文章
Recycling valid inequalities for robust combinatorial optimization with budgeted uncertainty
2024-8-29
Accelerated stochastic approximation with state-dependent noise
2024-8-27
A fast combinatorial algorithm for the bilevel knapsack problem with interdiction constraints
2024-8-22
Nonlinear conjugate gradient methods: worst-case convergence rates via computer-assisted analyses
2024-8-22
Machine learning augmented branch and bound for mixed integer linear programming
2024-8-22
On the strength of Lagrangian duality in multiobjective integer programming
2024-8-20
Convexification techniques for fractional programs
2024-8-16
A radial basis function method for noisy global optimisation
2024-8-8
Nonsmooth convex–concave saddle point problems with cardinality penalties
2024-8-8
Configuration balancing for stochastic requests
2024-8-8
On the correlation gap of matroids
2024-8-8
Optimizing for strategy diversity in the design of video games
2024-8-8
Unified smoothing approach for best hyperparameter selection problem using a bilevel optimization strategy
2024-8-8
Optimizing distortion riskmetrics with distributional uncertainty
2024-7-29
On supervalid inequalities for binary interdiction games
2024-7-27
Convergence in distribution of randomized algorithms: the case of partially separable optimization
2024-7-27
The pseudo-Boolean polytope and polynomial-size extended formulations for binary polynomial optimization
2024-7-22
Competitive kill-and-restart and preemptive strategies for non-clairvoyant scheduling
2024-7-22
A trust region-type normal map-based semismooth Newton method for nonsmooth nonconvex composite optimization
2024-7-22
New notions of simultaneous diagonalizability of quadratic forms with applications to QCQPs
2024-7-17
Distributional utility preference robust optimization models in multi-attribute decision making
2024-7-17
On the geometry and refined rate of primal–dual hybrid gradient for linear programming
2024-7-17
Efficient separation of RLT cuts for implicit and explicit bilinear terms
2024-7-16
Structural iterative rounding for generalized k-median problems
2024-7-10
Monoidal strengthening and unique lifting in MIQCPs
2024-7-8
On the directional asymptotic approach in optimization theory
2024-7-5
Optimal methods for convex nested stochastic composite optimization
2024-7-5
Matrix discrepancy and the log-rank conjecture
2024-7-5
On solving a rank regularized minimization problem via equivalent factorized column-sparse regularized models
2024-7-3
On circuit diameter bounds via circuit imbalances
2024-7-1
Special Issue: Integer Programming and Combinatorial Optimization (IPCO) 2022
2024-6-28
On the tightness of an SDP relaxation for homogeneous QCQP with three real or four complex homogeneous constraints
2024-6-21
Generalized scaling for the constrained maximum-entropy sampling problem
2024-6-20
A slope generalization of Attouch theorem
2024-6-20
A PTAS for the horizontal rectangle stabbing problem
2024-6-13
A unified framework for symmetry handling
2024-6-4
The complexity of first-order optimization methods from a metric perspective
2024-6-4
An asynchronous proximal bundle method
2024-6-4
Universal heavy-ball method for nonconvex optimization under Hölder continuous Hessians
2024-6-4
Polarized consensus-based dynamics for optimization and sampling
2024-5-31
Exploiting the polyhedral geometry of stochastic linear bilevel programming
2024-5-27
Information complexity of mixed-integer convex optimization
2024-5-27
A tight $$(1.5+\epsilon )$$-approximation for unsplittable capacitated vehicle routing on trees
2024-5-25
ReLU neural networks of polynomial size for exact maximum flow computation
2024-5-25
Stable set polytopes with high lift-and-project ranks for the Lovász–Schrijver SDP operator
2024-5-25
Optimal general factor problem and jump system intersection
2024-5-23
A characterization of maximal homogeneous-quadratic-free sets
2024-5-23
A linear time algorithm for linearizing quadratic and higher-order shortest path problems
2024-5-9
Gaining or losing perspective for convex multivariate functions on box domains
2024-5-8
Sample complexity analysis for adaptive optimization algorithms with stochastic oracles
2024-4-29
帮你贴心管理全部的文献
研飞ivySCI,高效的论文管理
投稿经验分享
分享我的经验,帮你走得更远