全文获取类型
收费全文 | 208篇 |
免费 | 34篇 |
国内免费 | 5篇 |
出版年
2022年 | 3篇 |
2021年 | 1篇 |
2020年 | 5篇 |
2019年 | 5篇 |
2018年 | 1篇 |
2017年 | 4篇 |
2016年 | 6篇 |
2015年 | 6篇 |
2014年 | 13篇 |
2013年 | 11篇 |
2012年 | 14篇 |
2011年 | 7篇 |
2010年 | 19篇 |
2009年 | 16篇 |
2008年 | 17篇 |
2007年 | 19篇 |
2006年 | 18篇 |
2005年 | 10篇 |
2004年 | 16篇 |
2003年 | 8篇 |
2002年 | 5篇 |
2001年 | 9篇 |
2000年 | 6篇 |
1999年 | 4篇 |
1998年 | 2篇 |
1997年 | 1篇 |
1996年 | 6篇 |
1995年 | 5篇 |
1994年 | 2篇 |
1992年 | 2篇 |
1991年 | 2篇 |
1990年 | 2篇 |
1989年 | 2篇 |
排序方式: 共有247条查询结果,搜索用时 15 毫秒
181.
Standard approaches to classical inventory control problems treat satisfying a predefined demand level as a constraint. In many practical contexts, however, total demand is comprised of separate demands from different markets or customers. It is not always clear that constraining a producer to satisfy all markets is an optimal approach. Since the inventory‐related cost of an item depends on total demand volume, no clear method exists for determining a market's profitability a priori, based simply on per unit revenue and cost. Moreover, capacity constraints often limit a producer's ability to meet all demands. This paper presents models to address economic ordering decisions when a producer can choose whether to satisfy multiple markets. These models result in a set of nonlinear binary integer programming problems that, in the uncapacitated case, lend themselves to efficient solution due to their special structure. The capacitated versions can be cast as nonlinear knapsack problems, for which we propose a heuristic solution approach that is asymptotically optimal in the number of markets. The models generalize the classical EOQ and EPQ problems and lead to interesting optimization problems with intuitively appealing solution properties and interesting implications for inventory and pricing management. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004. 相似文献
182.
183.
更新美术教育思想 促进素质教育实施 总被引:1,自引:0,他引:1
美术教育是促进素质教育的一个很重要的方面。它对培养学生的创新意识和创造能力有着不可替代的作用。树立全新的美术教育思想 ,可促进素质教育深入开展 相似文献
184.
This paper examines the discrete equal‐capacity p‐median problem that seeks to locate p new facilities (medians) on a network, each having a given uniform capacity, in order to minimize the sum of distribution costs while satisfying the demand on the network. Such problems arise, for example, in local access and transport area telecommunication network design problems where any number of a set of p facility units can be constructed at the specified candidate sites (hence, the net capacity is an integer multiple of a given unit capacity). We develop various valid inequalities, a separation routine for generating cutting planes that are specific members of such inequalities, as well as an enhanced reformulation that constructs a partial convex hull representation that subsumes an entire class of valid inequalities via its linear programming relaxation. We also propose suitable heuristic schemes for this problem, based on sequentially rounding the continuous relaxation solutions obtained for the various equivalent formulations of the problem. Extensive computational results are provided to demonstrate the effectiveness of the proposed valid inequalities, enhanced formulations, and heuristic schemes. The results indicate that the proposed schemes for tightening the underlying relaxations play a significant role in enhancing the performance of both exact and heuristic solution methods for this class of problems. © 2000 John & Sons, Inc. Naval Research Logistics 47: 166–183, 2000. 相似文献
185.
This study considers the block relocation and loading problem in container terminals. The optimal loading sequence and relocation location are simultaneously decided on the basis of the desired ship‐bay and initial yard space configuration. An integer linear programming model is developed to minimize the number of relocations in the yard space on the basis of no shifts in the ship bay. The accuracy of the model is tested on small‐scale scenarios by using CPLEX. Considering the problem size in the real world, we present a rule‐based heuristic method that is combined with a mathematical model for the removal, loading, and relocation operations. The influence of rules on algorithm performance is also analyzed, and the heuristic algorithm is compared with different types of algorithms in the literature. The extensive numerical experiments show the efficiency of the proposed heuristic algorithm. 相似文献
186.
火灾统计失实问题的现状及对策 总被引:1,自引:0,他引:1
以四川省为例介绍火灾统计失实的情况 ,并分析火灾统计失实问题的原因 ,提出纠正火灾统计失实问题的工作意见。 相似文献
187.
The allocation of underwater sensors for tracking, localization, and surveillance purposes is a fundamental problem in anti-submarine warfare. Inexpensive passive receivers have been heavily utilized in recent years; however, modern submarines are increasingly quiet and difficult to detect with receivers alone. Recently, the idea of deploying noncollocated sources and receivers has emerged as a promising alternative to purely passive sensor fields and to traditional sonar fields composed of collocated sources and receivers. Such a multistatic sonar network carries a number of advantages, but it also brings increased system complexity resulting from its unusual coverage patterns. In this work, we study the problem of optimally positioning active multistatic sonar sources for a point coverage application where all receivers and points of interest are fixed and stationary. Using a definite range sensor model, we formulate exact methods and approximation algorithms for this problem and compare these algorithms via computational experiments. We also examine the performance of these algorithms on a discrete approximation of a continuous area coverage problem and find that they offer a significant improvement over two types of random sensor deployment. 相似文献
188.
This study investigates a clustered coverage orienteering problem (CCOP), which is a generalization of the classical orienteering problem. The problem is widely motivated by the emerging unmanned techniques (eg, unmanned surface vehicles and drones) applied to environmental monitoring. Specifically, the unmanned surface vehicles (USVs) are used to monitor reservoir water quality by collecting samples. In the CCOP, the water sampling sites (ie, the nodes) are grouped into clusters, and a minimum number of nodes must be visited in each cluster. With each node representing a certain coverage area of the water, the objective of the CCOP is to monitor as much as possible the total coverage area in one tour of the USV, considering that overlapping areas provide no additional information. An integer programming model is first formulated through a linearization procedure that captures the overlapping feature. A two-stage exact algorithm is proposed to obtain an optimal solution to the problem. The efficiency and effectiveness of the two-stage exact algorithm are demonstrated through experiments on randomly generated instances. The algorithm can effectively solve instances with up to 60 sampling sites. 相似文献
189.
房红颖 《中国人民武装警察部队学院学报》2010,26(6):74-76
结合公安派出所消防监督工作现状,深入分析了当前在落实派出所消防监督管理职责方面存在的突出问题,就进一步提高和加强基层公安派出所消防监督管理工作提出了具体意见和建议。 相似文献
190.
陈正杰 《中国人民武装警察部队学院学报》2010,26(5):49-52
贯彻落实新的《军队思想政治教育大纲》,部队基层必须着力解决重视不够、摆位不正的问题,转变与时代不相符的思想政治教育观念,创新和改进思想政治教育的内容和手段,提升思想政治教育队伍的综合素质,创新和完善思想政治教育机制,进一步优化思想政治教育环境。 相似文献