首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   441篇
  免费   10篇
  2023年   2篇
  2020年   5篇
  2019年   18篇
  2018年   11篇
  2017年   12篇
  2016年   17篇
  2015年   13篇
  2014年   16篇
  2013年   121篇
  2012年   4篇
  2011年   13篇
  2010年   7篇
  2009年   8篇
  2008年   8篇
  2007年   9篇
  2006年   5篇
  2005年   7篇
  2004年   5篇
  2003年   8篇
  2002年   9篇
  2001年   4篇
  2000年   2篇
  1999年   7篇
  1998年   5篇
  1997年   6篇
  1996年   6篇
  1995年   8篇
  1994年   10篇
  1993年   7篇
  1992年   10篇
  1991年   8篇
  1990年   6篇
  1989年   10篇
  1988年   9篇
  1987年   7篇
  1986年   6篇
  1985年   6篇
  1983年   3篇
  1981年   2篇
  1979年   3篇
  1976年   2篇
  1975年   2篇
  1974年   2篇
  1973年   3篇
  1972年   4篇
  1971年   2篇
  1970年   3篇
  1968年   3篇
  1967年   2篇
  1966年   1篇
排序方式: 共有451条查询结果,搜索用时 281 毫秒
11.
12.
13.
The two‐level problem studied in this article consists of optimizing the refueling costs of a fleet of locomotives over a railway network. The goal consists of determining: (1) the number of refueling trucks contracted for each yard (truck assignment problem denoted TAP) and (2) the refueling plan of each locomotive (fuel distribution problem denoted FDP). As the FDP can be solved efficiently with existing methods, the focus is put on the TAP only. In a first version of the problem (denoted (P1)), various linear costs (e.g., fuel, fixed cost associated with each refueling, weekly operating costs of trucks) have to be minimized while satisfying a set of constraints (e.g., limited capacities of the locomotives and the trucks). In contrast with the existing literature on this problem, two types of nonlinear cost components will also be considered, based on the following ideas: (1) if several trucks from the same fuel supplier are contracted for the same yard, the supplier is likely to propose discounted prices for that yard (Problem (P2)); (2) if a train stops too often on its route, a penalty is incurred, which represents the dissatisfaction of the clients (Problem (P3)). Even if exact methods based on a mixed integer linear program formulation are available for (P1), they are not appropriate anymore to tackle (P2) and (P3). Various methods are proposed for the TAP: a descent local search, a tabu search, and a learning tabu search (LTS). The latter is a new type of local search algorithm. It involves a learning process relying on a trail system, and it can be applied to any combinatorial optimization problem. Results are reported and discussed for a large set of instances (for (P1), (P2), and (P3)), and show the good performance of LTS. © 2014 Wiley Periodicals, Inc. 62:32–45, 2015  相似文献   
14.
15.
16.
17.
18.
This paper considers the production of two products with known demands over a finite set of periods. The production and inventory carrying costs for each product are assumed to be concave. We seek the minimum cost production schedule meeting all demands, without backlogging, assuming that at most one of the two products can be produced in any period. The optimization problem is first stated as a nonlinear programming problem, which allows the proof of a result permitting the search for the optimal policy to be restricted to those which produce a product only when its inventory level is zero. A dynamic programming formulation is given and the model is then formulated as a shortest route problem in a specially constructed network.  相似文献   
19.
A basic problem in scheduling involves the sequencing of a set of independent tasks at a single facility with the objective of minimizing mean tardiness. Although the problem is relatively simple, the determination of an optimal sequence remains a challenging combinatorial problem. A number of algorithms have been developed for finding solutions, and this paper reports a comparative evaluation of these procedures. Computer programs for five separate algorithms were written and all were run on a data base designed to highlight computational differences. Optimizing algorithms developed by Emmons and by Srinivasan appeared to be particularly efficient in the comparative study.  相似文献   
20.
The reliability of weapons in combat has been treated by Bhashyam in the context of a stochastic duel characterized by fixed ammunition supplies. negative exponentially distributed firing times and weapon lifetimes, and a fixed number of spare weapons for each duelist. The present paper takes a different approach by starting with the fundamental duel of Ancker and Williams, characterized by unlimited ammunition and by ordinary renewal firing times, and adding to it weapon lifetimes which can be functions of time or of round position in the firing sequence. Probabilities of winning and tieing are derived and it is shown that under certain conditions the weapon lifetimes are equivalent to random time and ammunition limits.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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