【期刊信息】Journal of the Operations Research Society of China 2025, Volume 13, Number 2, 2025

摘要

1.Derivative-Free Optimization with Transformed Objective Functions and the Algorithm
Based on the Least Frobenius Norm Updating Quadratic Model
Peng-Cheng Xie & Ya-Xiang Yuan
https://link.springer.com/article/10.1007/s40305-023-00532-x

2.Augmented Lagrangian Methods for Time-Varying Constrained Online Convex Optimization
Hao-Yang Liu, Xian-Tao Xiao & Li-Wei Zhang
https://link.springer.com/article/10.1007/s40305-023-00496-y

3.A Switching Time Optimization Strategy for Optimal Control Problems
Yin Chen, Chang-Jun Yu & Xi Zhu
https://link.springer.com/article/10.1007/s40305-023-00499-9

4.ε-Quasi-Weakly Solution for Semi-infinite Vector Optimization Problems with Data Uncertainty
Thanh-Hung Pham & Thanh-Sang Nguyen
https://link.springer.com/article/10.1007/s40305-023-00489-x

5.Global Approximation of Local Optimality: Nonsubmodular Optimization
Wei-Li Wu, Zhao Zhang & Ding-Zhu Du
https://link.springer.com/article/10.1007/s40305-023-00475-3

6.A Note on "Flowshop Scheduling with Learning Effectand Job Rejection"
Jin Yu, Pei-Hai Liu & Xi-Wen Lu
https://link.springer.com/article/10.1007/s40305-023-00487-z

7.On Ratio-k-Cuts of Graphs
Bo Bai, Xiang Chen, Jian-Feng Hou & Gong Zhang
https://link.springer.com/article/10.1007/s40305-023-00465-5

8.Double-Factored Decision Theory for Markov Decision Processes with Multiple Scenarios of the Parameters
Cheng-Jun Hou
https://link.springer.com/article/10.1007/s40305-023-00457-5

9.Characterizing the Extremal k-Girth Graphs on Feedback Vertex Set
Zhong-Zheng Tang & Zhuo Diao
https://link.springer.com/article/10.1007/s40305-023-00483-3

10.Approximation Algorithms for Solving the k-Chinese Postman Problem Under
Interdiction Budget Constraints
Peng-Xiang Pan, Jun-Ran Lichen, Wen-Cheng Wang, Li-Jian Cai & Jian-Ping Li
https://link.springer.com/article/10.1007/s40305-023-00488-y

11.Two-Disjoint-Cycle-Cover Pancyclicity of Augmented Cubes
Shu-Jie Zhou & Min Xu
https://link.springer.com/article/10.1007/s40305-023-00474-4

12.Using the minimum and maximum degrees to bound the diameter of orientations of bridgeless graphs
Wan-Ping Zhang, Ji-Xiang Meng & Baoyindureng Wu
https://link.springer.com/article/10.1007/s40305-023-00476-2

13.The Single-Machine Preemptive or Resumable Scheduling with Maintenance Intervals
Ru-Yan He, Jin-Jiang Yuan & Yuan Zhang
https://link.springer.com/article/10.1007/s40305-023-00495-z

14.A Best Possible Online Algorithm For Parallel-Batch Scheduling with Kind Release
Times and Job Compatibilities
Li-Yun Miao, Ji Tian & Ru-Yan Fu
https://link.springer.com/article/10.1007/s40305-023-00480-6

15.A Penalty Function Approach for Solving the Linear Trilevel Programming Problem
Yan Peng & Yi-Bing Lv
https://link.springer.com/article/10.1007/s40305-023-00464-6

16.A Strong Convergence Result for Solving Split Variational Inequality Problem
Jun Yang
https://link.springer.com/article/10.1007/s40305-023-00482-4

17.Tight Toughness, Isolated Toughness and Binding Number Bounds for the {K2, Cn}-Factors
Xia-Xia Guan, Tian-Long Ma & Chao Shi
https://link.springer.com/article/10.1007/s40305-023-00485-1

18.The mixed-strategy α-core of games with infinitely many pure strategies
Neng-Fa Wang & Zhe Yang
https://link.springer.com/article/10.1007/s40305-023-00497-x

19.Atomic Dynamic Routing Games with Multiple Destinations
Chang-Jun Wang
https://link.springer.com/article/10.1007/s40305-023-00500-5