理学 >>> 数学 >>> 运筹学 >>> 线性规划 非线性规划 动态规划 组合最优化 参数规划 整数规划 随机规划 排队论 对策论 库存论 决策论 搜索论 图论 统筹论 最优化 运筹学其他学科
搜索结果: 1-15 共查到运筹学 e problem,相关记录15条 . 查询时间(0.218 秒)
Weitzman (1979) introduced the Pandora Box problem as a model for sequential search with inspection costs, and gave an elegant index-based policy that attains provably optimal expected payoff. In vari...
Generalized Nash Equilibrium problem is widely used but hard to solve. In this paper, we transform the generalized Nash game into a special bilevel programming with one leader and multi-followers by s...
This paper presents some improved relaxed CQ methods to solve the split feasibility problem. These new methods, which are based on the modified relaxed CQ algorithm, generate the new iterate by search...
Abstract: The simplified Lennard-Jones (LJ) potential minimization problem is $f(x)=4\sum_{i=1}^N \sum_{j=1,jbb{R}^n,$ where...
Abstract: We study the optimal execution problem in the presence of market impact and give a generalization of the main result of Kato(2009). Then we consider an example where the security price follo...
Abstract: This article studies the sensitivity of the power utility maximization problem with respect to the investor's relative risk aversion, the statistical probability measure, the investment cons...
Two fundamental objects in knot theory are the minimal genus surface and the least area surface bounded by a knot in a 3-dimensional manifold.
A conjecture of I. H´avel asserts that all middle-levels graphs Mk of the (2k + 1)-cubes possess Hamilton cycles. In this work, a tree containing all vertices of certain reduced graphs of the Mk...
The Skorokhod embedding problem for Brownian motion W is, given a centred probability measure , to nd a stopping time  such that W  . There exist many classical solutions to this problem, some o...
It is unknown whether two graphs can be tested for isomorphism in polynomial time. A classical approach to the Graph Isomorphism Problem is the d-dimensional Weisfeiler-Lehman algorithm.
The Feynman checkerboard problem is an interesting path integral approach to the Dirac equation in ‘1+1’ dimensions. I compare two approaches reported in the literature and show how they may be reconc...
We present a numerical method to solve the optimal transport problem with a quadratic cost when the source and target measures are periodic probability densities. This method relies on a numerical res...
This paper solves the point mass problem on the real line when the recurrence coefficients are asymptotically periodic.First, we give formulae for the perturbed orthogonal polynomi-als and the perturb...
In this paper we give a complete solution to the Hamilton-Waterloo problem for the case of Hamilton cycles and C4k-factors for all positive integers k.

中国研究生教育排行榜-

正在加载...

中国学术期刊排行榜-

正在加载...

世界大学科研机构排行榜-

正在加载...

中国大学排行榜-

正在加载...

人 物-

正在加载...

课 件-

正在加载...

视听资料-

正在加载...

研招资料 -

正在加载...

知识要闻-

正在加载...

国际动态-

正在加载...

会议中心-

正在加载...

学术指南-

正在加载...

学术站点-

正在加载...