Journal of the Operations Research Society of China

Công bố khoa học tiêu biểu

* Dữ liệu chỉ mang tính chất tham khảo

Sắp xếp:  
Herscovici’s Conjecture on the Product of the Thorn Graphs of the Complete Graphs
Journal of the Operations Research Society of China - Tập 2 - Trang 263-269 - 2014
Dong-Lin Hao, Ze-Tu Gao, Jian-Hua Yin
Given a distribution of pebbles on the vertices of a connected graph $$G$$ , a pebbling move on $$G$$ ...... hiện toàn bộ
Optimization and Operations Research in Mitigation of a Pandemic
Journal of the Operations Research Society of China - Tập 10 Số 2 - Trang 289-304 - 2022
Chen, Cai-Hua, Du, Yu-Hang, Ge, Dong-Dong, Lei, Lin, Ye, Yin-Yu
The pandemic of COVID-19 initiated in 2019 and spread all over the world in 2020 has caused significant damages to the human society, making troubles to all aspects of our daily life. Facing the serious outbreak of the virus, we consider possible solutions from the perspectives of both governments and enterprises. Particularly, this paper discusses several applications of supply chain management, ...... hiện toàn bộ
Characterizing Shadow Price via Lagrange Multiplier for Nonsmooth Problem
Journal of the Operations Research Society of China - Tập 11 - Trang 827-838 - 2022
Yan Gao
In this paper, the relation between the shadow price and the Lagrange multiplier for nonsmooth optimization problem is explored. It is obtained that the Lagrange multipliers are upper bounds of the shadow price for a convex optimization problem and a class of Lipschtzian optimization problems. This result can be used in pricing mechanisms for nonsmooth situation. Several nonsmooth functions involv...... hiện toàn bộ
Reducing Multivalued Discrete Variables in Solving Separable Task Assignment Problems
Journal of the Operations Research Society of China - Tập 4 - Trang 97-110 - 2015
Ling Gai, Qing-Wei Jin, Yuan Tian, Yao-Huei Huang
In this paper, we introduce the separable task assignment problem (STAP) in which n separable tasks are assigned to m agents subject to agents’ capacity constraints. The objective is to minimize the costs that occur during the manufacturing and the communication between agents. A task is separable if it can be divided into two pieces, and both of them can be assigned individually or together to an...... hiện toàn bộ
On Solutions of Sparsity Constrained Optimization
Journal of the Operations Research Society of China - Tập 3 - Trang 421-439 - 2015
Li-Li Pan, Nai-Hua Xiu, Sheng-Long Zhou
In this paper, we mainly study the existence of solutions to sparsity constrained optimization (SCO). Based on the expressions of tangent cone and normal cone of sparsity constraint, we present and characterize two first-order necessary optimality conditions for SCO: N-stationarity and T-stationarity. Then we give the second-order necessary and sufficient optimality conditions for SCO. At last, we...... hiện toàn bộ
A Novel MILP Model for N-vehicle Exploration Problem
Journal of the Operations Research Society of China - Tập 9 - Trang 359-373 - 2020
Guo-Jun Zhang, Jin-Chuan Cui
The N-vehicle exploration problem (NVEP) is a nonlinear discrete scheduling problem, and the complexity status remains open. To our knowledge, there is no literature until now employing mixed integer linear programming (MILP) technology to solve this problem except for Wang (J Oper Res Soc China 3(4):489–498, 2015). However, they did not give numerical experiments since their model existed strictl...... hiện toàn bộ
Approximate Optimality Conditions for Composite Convex Optimization Problems
Journal of the Operations Research Society of China - - 2016
Xian-Jun Long, Xiang-Kai Sun, Zai-Yun Peng
The purpose of this paper is to study the approximate optimality condition for composite convex optimization problems with a cone-convex system in locally convex spaces, where all functions involved are not necessarily lower semi-continuous. By using the properties of the epigraph of conjugate functions, we introduce a new regularity condition and give its equivalent characterizations. Under this ...... hiện toàn bộ
A New Infeasible-Interior-Point Algorithm Based on Wide Neighborhoods for Symmetric Cone Programming
Journal of the Operations Research Society of China - - 2016
Chang-He Liu, Dan Wu, You-Lin Shang
In this paper, we present an infeasible-interior-point algorithm, based on a new wide neighborhood for symmetric cone programming. We treat the classical Newton direction as the sum of two other directions, and equip them with different step sizes. We prove the complexity bound of the new algorithm for the Nesterov-Todd (NT) direction, and the xs and sx directions. The complexity bounds obtained h...... hiện toàn bộ
Residual Closeness of Graphs with Given Parameters
Journal of the Operations Research Society of China - Tập 11 - Trang 839-856 - 2022
Mei-Qun Cheng, Bo Zhou
Robustness of the network topology is a key aspect in the design of computer networks. Residual closeness is a new graph-theoretic concept defined as a measure of network robustness due to the failure of individual vertices. We identify those graphs with maximum residual closeness among connected graphs with fixed connectivity, edge connectivity and bipartiteness, respectively.
Optimal Contract for the Principal-Agent Under Knightian Uncertainty
Journal of the Operations Research Society of China - Tập 8 - Trang 637-654 - 2020
Kun-Lun Wang, Chen Fei, Wei-Yin Fei
Under the Knightian uncertainty, this paper constructs the optimal principal (he)-agent (she) contract model based on the principal’s expected profit and the agent’s expected utility function by using the sublinear expectation theory. The output process in the model is provided by the agent’s continuous efforts and the principal cannot directly observe the agent’s efforts. In the process of work, ...... hiện toàn bộ
Tổng số: 341   
  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • 10