全文获取类型
收费全文 | 240篇 |
免费 | 10篇 |
出版年
2020年 | 3篇 |
2019年 | 13篇 |
2018年 | 9篇 |
2017年 | 4篇 |
2016年 | 8篇 |
2015年 | 7篇 |
2014年 | 7篇 |
2013年 | 75篇 |
2011年 | 8篇 |
2010年 | 2篇 |
2009年 | 3篇 |
2008年 | 4篇 |
2007年 | 7篇 |
2006年 | 2篇 |
2005年 | 5篇 |
2004年 | 2篇 |
2003年 | 3篇 |
2002年 | 4篇 |
2001年 | 3篇 |
1999年 | 5篇 |
1998年 | 1篇 |
1997年 | 3篇 |
1996年 | 3篇 |
1995年 | 3篇 |
1994年 | 6篇 |
1993年 | 3篇 |
1992年 | 4篇 |
1991年 | 3篇 |
1990年 | 3篇 |
1989年 | 4篇 |
1988年 | 4篇 |
1987年 | 4篇 |
1986年 | 1篇 |
1985年 | 2篇 |
1984年 | 1篇 |
1983年 | 3篇 |
1981年 | 1篇 |
1979年 | 2篇 |
1978年 | 1篇 |
1976年 | 1篇 |
1975年 | 2篇 |
1974年 | 1篇 |
1973年 | 3篇 |
1972年 | 4篇 |
1971年 | 2篇 |
1970年 | 3篇 |
1969年 | 1篇 |
1968年 | 2篇 |
1967年 | 1篇 |
1966年 | 1篇 |
排序方式: 共有250条查询结果,搜索用时 15 毫秒
221.
222.
223.
An optimization model which is frequently used to assist decision makers in the areas of resource scheduling, planning, and distribution is the minimum cost multiperiod network flow problem. This model describes network structure decision-making problems over time. Such problems arise in the areas of production/distribution systems, economic planning, communication systems, material handling systems, traffic systems, railway systems, building evacuation systems, energy systems, as well as in many others. Although existing network solution techniques are efficient, there are still limitations to the size of problems that can be solved. To date, only a few researchers have taken the multiperiod structure into consideration in devising efficient solution methods. Standard network codes are usually used because of their availability and perceived efficiency. In this paper we discuss the development, implementation, and computational testing of a new technique, the forward network simplex method, for solving linear, minimum cost, multiperiod network flow problems. The forward network simplex method is a forward algorithm which exploits the natural decomposition of multiperiod network problems by limiting its pivoting activity. A forward algorithm is an approach to solving dynamic problems by solving successively longer finite subproblems, terminating when a stopping rule can be invoked or a decision horizon found. Such procedures are available for a large number of special structure models. Here we describe the specialization of the forward simplex method of Aronson, Morton, and Thompson to solving multiperiod network network flow problems. Computational results indicate that both the solution time and pivot count are linear in the number of periods. For standard network optimization codes, which do not exploit the multiperiod structure, the pivot count is linear in the number of periods; however, the solution time is quadratic. 相似文献
224.
Cathy Downes Christopher Dandeker Paddy Griffith David Edgerton F. H. Toase Davina Miller 《Defense & Security Analysis》1990,6(1):103-112
National Security Concepts of States: New Zealand. By Kennedy Graham. Taylor & Francis, London (1989), ISBN 0-8448-1614-0, £27.00
Power and Prestige in the British Army. By R.G. L. von Zugbach. Gower, Aldershot (1988), ISBN 0-566-05561-9, £22.50
The American Civil War and the Origins of Modern Warfare—Ideas, Organization, and Field Command. By Edward Hagerman. Indiana University Press, Bloomington, IN (1988), ISBN 0-253-30546-2, $37.50 (£23.29)
British Seapower and Procurement between the Wars: a Reappraisal of Rearmament. By G. A. H. Gordon. Macmillan, London (1988), ISBN 0-333-42332-1. £29.50
Armies in Low-intensity Conflict: a Comparative Analysis. Edited by David A. Charters and Maurice Tugwell. Brassey's Defence Publishers, London (1989), ISBN 0-08-036253-2, £25.00 ($45.00); Deadly Paradigms: the Failure of U.S. Counterinsurgency Policy. By Michael Shafer, Leicester University Press, Leicester (1988), ISBN 0-7185-1311-8, £28.00
British Defence Policy Striking the Right Balance. By J. Baylis. Macmillan, London (1989), ISBN 0-333-49133-5, £29.50 or £9.99 相似文献
Power and Prestige in the British Army. By R.G. L. von Zugbach. Gower, Aldershot (1988), ISBN 0-566-05561-9, £22.50
The American Civil War and the Origins of Modern Warfare—Ideas, Organization, and Field Command. By Edward Hagerman. Indiana University Press, Bloomington, IN (1988), ISBN 0-253-30546-2, $37.50 (£23.29)
British Seapower and Procurement between the Wars: a Reappraisal of Rearmament. By G. A. H. Gordon. Macmillan, London (1988), ISBN 0-333-42332-1. £29.50
Armies in Low-intensity Conflict: a Comparative Analysis. Edited by David A. Charters and Maurice Tugwell. Brassey's Defence Publishers, London (1989), ISBN 0-08-036253-2, £25.00 ($45.00); Deadly Paradigms: the Failure of U.S. Counterinsurgency Policy. By Michael Shafer, Leicester University Press, Leicester (1988), ISBN 0-7185-1311-8, £28.00
British Defence Policy Striking the Right Balance. By J. Baylis. Macmillan, London (1989), ISBN 0-333-49133-5, £29.50 or £9.99 相似文献
225.
226.
David C. Dellinger 《海军后勤学研究》1971,18(3):357-378
A linear programming application for the selection of aircraft for a tactical airlift fleet is described. 相似文献
227.
David I. Steinberg 《海军后勤学研究》1970,17(2):217-235
The fixed charge problem is a nonlinear programming problem of practical interest in business and industry. Yet, until now no computationally feasible exact method of solution for large problems had been developed. In this paper an exact algorithm is presented which is computationally feasible for large problems. The algorithm is based upon a branch and bound approach, with the additional feature that the amount of computer storage required remains constant throughout (for a problem of any given size). Also presented are three suboptimal heuristic algorithms which are of interest because, although they do not guarantee that the true optimal solution will be found, they usually yield very good solutions and are extremely rapid techniques. Computational results are described for several of the heuristic methods and for the branch and bound algorithm. 相似文献
228.
The discounted return associated with a finite state Markov chain X1, X2… is given by g(X1)+ αg(X2) + α2g(X3) + …, where g(x) represents the immediate return from state x. Knowing the transition matrix of the chain, it is desired to compute the expected discounted return (present worth) given the initial state. This type of problem arises in inventory theory, dynamic programming, and elsewhere. Usually the solution is approximated by solving the system of linear equations characterizing the expected return. These equations can be solved by a variety of well-known methods. This paper describes yet another method, which is a slight modification of the classical iterative scheme. The method gives sequences of upper and lower bounds which converge mono-tonely to the solution. Hence, the method is relatively free of error control problems. Computational experiments were conducted which suggest that for problems with a large number of states, the method is quite efficient. The amount of computation required to obtain the solution increases much slower with an increase in the number of states, N, than with the conventional methods. In fact, computational time is more nearly proportional to N2, than to N3. 相似文献
229.
The problem of minimizing mean flow time of two parallel processors is discussed. Prior results are briefly reviewed. A dynamic programming algorithm is presented which minimizes mean flow time for a set of n preordered jobs on two nonequivalent parallel processors. The algorithm is illustrated with an example problem. The computational experience is presented which illustrates the efficiency of the algorithm. 相似文献
230.
To solve linear fixed charge problems with Murty's vertex ranking algorithm, one uses a simplex algorithm and a procedure to determine the vertices adjacent to a given vertex. In solving fixed charge transportation problems, the simplex algorithm simplifies to the stepping-stone algorithm. To find adjacent vertices on transportation polytopes, we present a procedure which is a simplification of a more general procedure for arbitrary polytopes. 相似文献