全文获取类型
收费全文 | 509篇 |
免费 | 98篇 |
国内免费 | 24篇 |
出版年
2024年 | 1篇 |
2023年 | 3篇 |
2022年 | 3篇 |
2021年 | 14篇 |
2020年 | 13篇 |
2019年 | 9篇 |
2018年 | 6篇 |
2017年 | 10篇 |
2016年 | 16篇 |
2015年 | 28篇 |
2014年 | 23篇 |
2013年 | 73篇 |
2012年 | 24篇 |
2011年 | 23篇 |
2010年 | 43篇 |
2009年 | 32篇 |
2008年 | 44篇 |
2007年 | 34篇 |
2006年 | 30篇 |
2005年 | 30篇 |
2004年 | 24篇 |
2003年 | 17篇 |
2002年 | 25篇 |
2001年 | 22篇 |
2000年 | 13篇 |
1999年 | 20篇 |
1998年 | 6篇 |
1997年 | 3篇 |
1996年 | 1篇 |
1995年 | 5篇 |
1994年 | 5篇 |
1993年 | 3篇 |
1992年 | 4篇 |
1991年 | 1篇 |
1990年 | 4篇 |
1989年 | 2篇 |
1988年 | 1篇 |
1987年 | 3篇 |
1986年 | 2篇 |
1985年 | 2篇 |
1983年 | 1篇 |
1982年 | 1篇 |
1981年 | 1篇 |
1979年 | 1篇 |
1978年 | 3篇 |
1973年 | 1篇 |
1967年 | 1篇 |
排序方式: 共有631条查询结果,搜索用时 109 毫秒
531.
Recent supply‐chain models that study competition among capacity‐constrained producers omit the possibility of producers strategically setting wholesale prices to create uncertainty with regards to (i.e., to obfuscate) their production capacities. To shed some light on this possibility, we study strategic obfuscation in a supply‐chain model comprised of two competing producers and a retailer, where one of the producers faces a privately‐known capacity constraint. We show that capacity obfuscation can strictly increase the obfuscating producer's profit, therefore, presenting a clear incentive for such practices. Moreover, we identify conditions under which both producers' profits increase. In effect, obfuscation enables producers to tacitly collude and charge higher wholesale prices by moderating competition between producers. The retailer, in contrast, suffers a loss in profit, raises retail prices, while overall channel profits decrease. We show that the extent of capacity obfuscation is limited by its cost and by a strategic retailer's incentive to facilitate a deterrence. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 244–267, 2014 相似文献
532.
如何快速提升教育质量,是武警“合训”院校教育当前所面临的一个重要课题。对此,必须将“严格选拔标准,为提升教育质量奠定基础;加强理想信念教育,筑牢学员扎根警营的意识;以任务为牵引,打牢学员履职尽责的军事素质基础;采取多种方法,激发学员学习的内在动力;突出领导管理能力培养,夯实学员的领导管理基础”等,作为“合训”学员培养的根本着力点。 相似文献
533.
534.
We consider a class of facility location problems with a time dimension, which requires assigning every customer to a supply facility in each of a finite number of periods. Each facility must meet all assigned customer demand in every period at a minimum cost via its production and inventory decisions. We provide exact branch‐and‐price algorithms for this class of problems and several important variants. The corresponding pricing problem takes the form of an interesting class of production planning and order selection problems. This problem class requires selecting a set of orders that maximizes profit, defined as the revenue from selected orders minus production‐planning‐related costs incurred in fulfilling the selected orders. We provide polynomial‐time dynamic programming algorithms for this class of pricing problems, as well as for generalizations thereof. Computational testing indicates the advantage of our branch‐and‐price algorithm over various approaches that use commercial software packages. These tests also highlight the significant cost savings possible from integrating location with production and inventory decisions and demonstrate that the problem is rather insensitive to forecast errors associated with the demand streams. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
535.
We study a supply chain in which a manufacturer relies on a salesperson to sell the products to the consumers. The sales outcome is determined by a random market condition and the salesperson's service level, both of which are privately observed by the salesperson. Apart from them, there are two types of resellers: a knowledgeable reseller observes the market condition, whereas a diligent reseller can monitor the service level. While delegating to a reseller enhances information acquisition, it may also result in double marginalization and inefficiency. We identify several operating regimes in which double marginalization can be eliminated via simple contracts and establish the benefit of monitoring the salesperson over monitoring the market. Our dominance result is not prone to our model characteristics regarding the complementarity of market condition and sales effort, the relative importance of adverse selection and moral hazard, and the contract form. We then generalize our model and re‐establish the dominance result in the presence of reseller's risk aversion or private monitoring expertise. We also quantify the performance gaps among different selling schemes under various scenarios. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
536.
当前,我国大力发展高速铁路(以下简称高铁)建设,这为武警部队提高快速远程机动能力提供了新的机遇。部队的快速远程机动能力,是有效完成国家赋予的安全保卫、防卫作战及抢险救灾等多样化任务的重要前提。从高铁的发展特点及武警部队利用高铁进行快速远程机动的必要性,以及需把握的问题进行了分析探讨,旨在促使高铁在武警部队远程机动中发挥有效的作用,提高部队完成职能使命的能力。 相似文献
537.
538.
研究了硼砂对磷酸镁水泥凝结时间与抗压强度的影响,分析了硼砂对水泥性能影响的微观作用机制.研究发现:随着硼砂对MgO质量分数增加,磷酸镁水泥凝结时间延长,其早期抗压强度迅速降低,后期抗压强度所受影响相对较小;磷酸镁水泥应用于快速修补及抢修抢建时,硼砂质量为氧化镁质量的5%~10%为宜;硼砂对磷酸镁水泥水化产物的早期生成量... 相似文献
539.
The quay crane scheduling problem consists of determining a sequence of unloading and loading movements for cranes assigned to a vessel in order to minimize the vessel completion time as well as the crane idle times. Idle times originate from interferences between cranes since these roll on the same rails and a minimum safety distance must be maintained between them. The productivity of container terminals is often measured in terms of the time necessary to load and unload vessels by quay cranes, which are the most important and expensive equipment used in ports. We formulate the quay crane scheduling problem as a vehicle routing problem with side constraints, including precedence relationships between vertices. For small size instances our formulation can be solved by CPLEX. For larger ones we have developed a branch‐and‐cut algorithm incorporating several families of valid inequalities, which exploit the precedence constraints between vertices. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
540.