首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   915篇
  免费   91篇
  国内免费   22篇
化学   47篇
力学   18篇
综合类   16篇
数学   844篇
物理学   103篇
  2023年   3篇
  2022年   24篇
  2021年   34篇
  2020年   22篇
  2019年   22篇
  2018年   18篇
  2017年   40篇
  2016年   46篇
  2015年   25篇
  2014年   53篇
  2013年   60篇
  2012年   42篇
  2011年   40篇
  2010年   35篇
  2009年   69篇
  2008年   62篇
  2007年   55篇
  2006年   54篇
  2005年   49篇
  2004年   35篇
  2003年   25篇
  2002年   33篇
  2001年   19篇
  2000年   10篇
  1999年   12篇
  1998年   19篇
  1997年   23篇
  1996年   18篇
  1995年   15篇
  1994年   6篇
  1993年   8篇
  1992年   6篇
  1991年   5篇
  1990年   2篇
  1989年   4篇
  1988年   1篇
  1987年   1篇
  1986年   2篇
  1985年   5篇
  1984年   3篇
  1983年   1篇
  1982年   4篇
  1981年   4篇
  1980年   5篇
  1979年   2篇
  1978年   2篇
  1977年   2篇
  1976年   1篇
  1973年   2篇
排序方式: 共有1028条查询结果,搜索用时 500 毫秒
1.
Aliprantis  C.D.  Cornet  B.  Tourky  R. 《Positivity》2002,6(3):205-241
Mathematical economics has a long history and covers many interdisciplinary areas between mathematics and economics. At its center lies the theory of market equilibrium. The purpose of this expository article is to introduce mathematicians to price decentralization in general equilibrium theory. In particular, it concentrates on the role of positivity in the theory of convex economic analysis and the role of normal cones in the theory of non-convex economies.  相似文献   
2.
In this paper we obtain Lower Bounds (LBs) to concave cost network flow problems. The LBs are derived from state space relaxations of a dynamic programming formulation, which involve the use of non-injective mapping functions guaranteing a reduction on the cardinality of the state space. The general state space relaxation procedure is extended to address problems involving transitions that go across several stages, as is the case of network flow problems. Applications for these LBs include: estimation of the quality of heuristic solutions; local search methods that use information of the LB solution structure to find initial solutions to restart the search (Fontes et al., 2003, Networks, 41, 221–228); and branch-and-bound (BB) methods having as a bounding procedure a modified version of the LB algorithm developed here, (see Fontes et al., 2005a). These LBs are iteratively improved by penalizing, in a Lagrangian fashion, customers not exactly satisfied or by performing state space modifications. Both the penalties and the state space are updated by using the subgradient method. Additional constraints are developed to improve further the LBs by reducing the searchable space. The computational results provided show that very good bounds can be obtained for concave cost network flow problems, particularly for fixed-charge problems.  相似文献   
3.
作业成本法数学模型的创新   总被引:2,自引:0,他引:2  
姜硕  宋磊  刘琳 《运筹与管理》2004,13(1):156-159
随着企业产品价格竞争愈演愈烈,成本的合理分配、计算日显重要,但在间接费用的分摊上,传统成本会计对成本信息反映失真的局限性日益显露,会计理论界和实务界开始寻求一种新的准确的成本计算方法,作业成本法应运而生。本将由作业成本法基本原理推导出其数学模型,并将对其数学模型进一步改进,建立比较数学模型。使作业成本法向实际应用更进一步。  相似文献   
4.
毛定祥 《运筹与管理》2005,14(5):108-111,149
本文利用我国上市公司1997至2002年的有关财务数据,建立了我国上市公司资本成本面板数据模型,运用该模型分析了我国上市公司资本成本与财务杠杆、企业规模的关系.结果表明,财务杠杆的提升、企业规模的扩大将使资本成本下降.该结论对我国上市公司优化资本结构、提高企业价值具有一定的参考价值.  相似文献   
5.
工程施工中运输网络优化方案   总被引:5,自引:0,他引:5  
施工工地运输方案的优化设计可以归结为 :按施工期要求设计运输线路或验证已有线路通行能力 ,计算总线路中影响提高流量的关键路段 ,取得最小费用最大流 .本文运用图论理论这一数学工具把实际问题抽象为有向网络 ,进而建立数学模型 .此方法理论上严密 ,解题步聚直观清晰 ,对水利、公路、水路、铁路等其它运输系统有普遍意义 .  相似文献   
6.
7.
This paper presents a unified analysis of decomposition algorithms for continuously differentiable optimization problems defined on Cartesian products of convex feasible sets. The decomposition algorithms are analyzed using the framework of cost approx imation algorithms. A convergence analysis is made for three decomposition algorithms: a sequential algorithm which extends the classical Gauss-Seidel scheme, a synchronized parallel algorithm which extends the Jacobi method, and a partially asynchronous parallel algorithm. The analysis validates inexact computations in both the subproblem and line search phases, and includes convergence rate results. The range of feasible step lengths within each algorithm is shown to have a direct correspondence to the increasing degree of parallelism and asynchronism, and the resulting usage of more outdated information in the algorithms.  相似文献   
8.
一类经典”秘书问题”的推广   总被引:2,自引:0,他引:2  
”秘书问题”在最优停时理论的发展中曾起过重要作用 ,实际中的一类问题与”秘书问题”有类似之处 ,但比”秘书问题”更复杂 .本文将经典”秘书问题”进行推广 ,建立了一类比经典”秘书问题”更有实际意义的模型 ,并给出了该类模型的解 .  相似文献   
9.
针对人力资本组合投资模式仅定性分析职员和企业对人力资本投资行为的特点,应用博弈论进行了相应的定量分析,将贝克尔投资模式与组合投资模式相结合,建立了确定企业投资比率的计算公式,为企业进行人力资本培训投资提供了定量的决策依据。  相似文献   
10.
This paper presents an axiomatic characterization of a family of solutions to two-player quasi-linear social choice problems. In these problems the players select a single action from a set available to them. They may also transfer money between themselves.The solutions form a one-parameter family, where the parameter is a non-negative number, t.The solutions can be interpreted as follows: Any efficient action can be selected. Based on this action, compute for each player a “best claim for compensation”. A claim for compensation is the difference between the value of an alternative action and the selected efficient action, minus a penalty proportional to the extent to which the alternative action is inefficient. The coefficient of proportionality of this penalty is t. The best claim for compensation for a player is the maximum of this computed claim over all possible alternative actions. The solution, at the parameter value t, is to implement the chosen efficient action and make a monetary transfer equal to the average of these two best claims. The characterization relies on three main axioms. The paper presents and justifies these axioms and compares them to related conditions used in other bargaining contexts. In Nash Bargaining Theory, the axioms analogous to these three are in conflict with each other. In contrast, in the quasi-linear social choice setting of this paper, all three conditions can be satisfied simultaneously.This work was supported by the Division of Research at the Harvard Business School. Thanks are due to the Cowles Foundation for Research in Economics at Yale University for its kind hospitality during the Spring of 2002. I have received helpful advice and comments from Youngsub Chun, Ehud Kalai, Herve Moulin, Al Roth, Ilya Segal, Adam Szeidl, Richard Zeckhauser, and other members of the Theory Seminars at Harvard, MIT, Princeton, Rice and Northwestern.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号