首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   252篇
  免费   3篇
  2021年   3篇
  2019年   3篇
  2017年   4篇
  2016年   3篇
  2015年   4篇
  2014年   2篇
  2013年   62篇
  2011年   2篇
  2010年   2篇
  2009年   2篇
  2008年   3篇
  2007年   3篇
  2006年   2篇
  2005年   4篇
  2004年   2篇
  2003年   3篇
  2002年   2篇
  2000年   2篇
  1999年   3篇
  1996年   4篇
  1995年   5篇
  1994年   6篇
  1993年   3篇
  1992年   3篇
  1991年   4篇
  1990年   2篇
  1989年   5篇
  1988年   6篇
  1987年   5篇
  1986年   7篇
  1985年   6篇
  1984年   2篇
  1983年   3篇
  1982年   9篇
  1980年   5篇
  1979年   3篇
  1978年   3篇
  1977年   4篇
  1976年   2篇
  1975年   5篇
  1974年   6篇
  1973年   6篇
  1972年   5篇
  1971年   8篇
  1970年   3篇
  1969年   5篇
  1968年   5篇
  1967年   2篇
  1966年   3篇
  1948年   3篇
排序方式: 共有255条查询结果,搜索用时 15 毫秒
131.
In this paper we study a capacity allocation problem for two firms, each of which has a local store and an online store. Customers may shift among the stores upon encountering a stockout. One question facing each firm is how to allocate its finite capacity (i.e., inventory) between its local and online stores. One firm's allocation affects the decision of the rival, thereby creating a strategic interaction. We consider two scenarios of a single‐product single‐period model and derive corresponding existence and stability conditions for a Nash equilibrium. We then conduct sensitivity analysis of the equilibrium solution with respect to price and cost parameters. We also prove the existence of a Nash equilibrium for a generalized model in which each firm has multiple local stores and a single online store. Finally, we extend the results to a multi‐period model in which each firm decides its total capacity and allocates this capacity between its local and online stores. A myopic solution is derived and shown to be a Nash equilibrium solution of a corresponding “sequential game.” © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006  相似文献   
132.
133.
In a recent article we demonstrated that implicit optimal modeling for shift scheduling (P2) has inherent size and execution time advantages over the general set-covering formulation for shift scheduling (P1) [11, 13]. We postulated that the absence of extraordinary overlap (EO) was a requirement for the equivalence of P1 and P2. We have defined EO as the condition in which the earliest and latest starts for a break in one shift are earlier and later than the earliest and latest starts for a break in any other shift(s). In this article, we prove that our earlier postulate was accurate. Additionally, we discuss research extensions and note other scheduling problems for which implicit modeling may be appropriate. © 1996 John Wiley & Sons, Inc.  相似文献   
134.
Facility location problems in the plane are among the most widely used tools of Mathematical Programming in modeling real-world problems. In many of these problems restrictions have to be considered which correspond to regions in which a placement of new locations is forbidden. We consider center and median problems where the forbidden set is a union of pairwise disjoint convex sets. As applications we discuss the assembly of printed circuit boards, obnoxious facility location and the location of emergency facilities. © 1995 John Wiley & Sons, Inc.  相似文献   
135.
136.
Technologically advanced aircraft rely on robust and responsive logistics systems to ensure a high state of operational readiness. This paper fills a critical gap in the literature for combat models by closely relating effectiveness of the logistics system to determinants of success in combat. We present a stochastic diffusion model of an aerial battle between Blue and Red forces. The number of aircraft of Blue forces aloft and ready to be aloft on combat missions is limited by the maximum number of assigned aircraft, the reliability of aircraft subsystems, and the logistic system's ability to repair and replenish those subsystems. Our parsimonious model can illustrate important trade‐offs between logistics decision variables and operational success.  相似文献   
137.
The optimal linear combination of control variates is well known when the controls are assumed to be unbiased. We derive here the optimal linear combination of controls in the situation where asymptotically negligible bias is present. The small-sample linear control which minimizes the mean square error (MSE) is derived. When the optimal asymptotic linear control is used rather than the optimal small-sample control, the degradation in MSE is c/n3, where n is the sample size and c is a known constant. This analysis is particulary relevant to the small-sample theory for control variates as applied to the steady-state estimation problem. Results for the method of multiple estimates are also given.  相似文献   
138.
The kitting problem in multiechelon assembly systems is to allocate on-hand stock and anticipated future deliveries to kits so that cost is minimized. This article structures the kitting problem and describes several preprocessing methods that are effective in refining the formulation. The model is resolved using an optimizing approach based on Lagrangian relaxation, which yields a separable problem that decomposes into a subproblem for each job. The resulting subproblems are resolved using a specialized dynamic programming algorithm, and computational efficiency is enhanced by dominance properties devised for that purpose. The Lagrangian problem is resolved effectively using subgradient optimization and a specialized branching method incorporated in the branch-and-bound procedure. Computational experience demonstrates that the specialized approach outperforms the general-purpose optimizer OSL. The new solution approach facilitates time-managed flow control, prescribing kitting decisions that promote cost-effective performance to schedule. © 1994 John Wiley & Sons. Inc.  相似文献   
139.
Assume the payoffs of a matrix game are concave in the index of the maximizing player. That player is shown to have an optimal strategy which uses at most two consecutive pure strategies, identifiable through approximate solution of a related continuous game. Generalizations are given, and the results are applied to a motivating hidden-target model due to Shapley. © 1994 John Wiley & Sons, Inc.  相似文献   
140.
A counterexample is given to demonstrate that previously proposed necessary conditions for the bilevel programming problem are not correct. An interpretation of the difficulty is given by appealing to a “theorem of alternative” result presented in the original work.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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