全文获取类型
收费全文 | 222篇 |
免费 | 7篇 |
国内免费 | 1篇 |
出版年
2021年 | 2篇 |
2019年 | 10篇 |
2018年 | 7篇 |
2017年 | 5篇 |
2016年 | 4篇 |
2014年 | 6篇 |
2013年 | 42篇 |
2012年 | 3篇 |
2011年 | 1篇 |
2010年 | 6篇 |
2007年 | 6篇 |
2006年 | 2篇 |
2005年 | 6篇 |
2004年 | 4篇 |
2003年 | 1篇 |
2002年 | 7篇 |
2001年 | 1篇 |
2000年 | 2篇 |
1999年 | 4篇 |
1998年 | 7篇 |
1997年 | 7篇 |
1996年 | 3篇 |
1995年 | 2篇 |
1994年 | 7篇 |
1993年 | 6篇 |
1991年 | 3篇 |
1990年 | 3篇 |
1989年 | 2篇 |
1986年 | 4篇 |
1985年 | 6篇 |
1984年 | 1篇 |
1983年 | 2篇 |
1982年 | 5篇 |
1981年 | 5篇 |
1980年 | 3篇 |
1979年 | 4篇 |
1978年 | 4篇 |
1977年 | 3篇 |
1976年 | 3篇 |
1975年 | 3篇 |
1974年 | 3篇 |
1973年 | 4篇 |
1972年 | 3篇 |
1971年 | 1篇 |
1969年 | 2篇 |
1968年 | 5篇 |
1967年 | 2篇 |
1966年 | 3篇 |
1949年 | 1篇 |
1948年 | 2篇 |
排序方式: 共有230条查询结果,搜索用时 15 毫秒
171.
The warehouse problem with deterministic production cost, selling prices, and demand was introduced in the 1950s and there is a renewed interest recently due to its applications in energy storage and arbitrage. In this paper, we consider two extensions of the warehouse problem and develop efficient computational algorithms for finding their optimal solutions. First, we consider a model where the firm can invest in capacity expansion projects for the warehouse while simultaneously making production and sales decisions in each period. We show that this problem can be solved with a computational complexity that is linear in the product of the length of the planning horizon and the number of capacity expansion projects. We then consider a problem in which the firm can invest to improve production cost efficiency while simultaneously making production and sales decisions in each period. The resulting optimization problem is non‐convex with integer decision variables. We show that, under some mild conditions on the cost data, the problem can be solved in linear computational time. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 367–373, 2016 相似文献
172.
We study a multi‐item capacitated lot‐sizing problem with setup times and pricing (CLSTP) over a finite and discrete planning horizon. In this class of problems, the demand for each independent item in each time period is affected by pricing decisions. The corresponding demands are then satisfied through production in a single capacitated facility or from inventory, and the goal is to set prices and determine a production plan that maximizes total profit. In contrast with many traditional lot‐sizing problems with fixed demands, we cannot, without loss of generality, restrict ourselves to instances without initial inventories, which greatly complicates the analysis of the CLSTP. We develop two alternative Dantzig–Wolfe decomposition formulations of the problem, and propose to solve their relaxations using column generation and the overall problem using branch‐and‐price. The associated pricing problem is studied under both dynamic and static pricing strategies. Through a computational study, we analyze both the efficacy of our algorithms and the benefits of allowing item prices to vary over time. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
173.
This article introduces the Doubly Stochastic Sequential Assignment Problem (DSSAP), an extension of the Sequential Stochastic Assignment Problem (SSAP), where sequentially arriving tasks are assigned to workers with random success rates. A given number of tasks arrive sequentially, each with a random value coming from a known distribution. On a task arrival, it must be assigned to one of the available workers, each with a random success rate coming from a known distribution. Optimal assignment policies are proposed for DSSAP under various assumptions on the random success rates. The optimal assignment algorithm for the general case of DSSAP, where workers have distinct success rate distribution, has an exponential running time. An approximation algorithm that achieves a fraction of the maximum total expected reward in a polynomial time is proposed. The results are illustrated by several numerical experiments. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 124–137, 2016 相似文献
174.
In an accumulation game, a HIDER attempts to accumulate a certain number of objects or a certain quantity of material before a certain time, and a SEEKER attempts to prevent this. In a continuous accumulation game the HIDER can pile material either at locations $1, 2, …, n, or over a region in space. The HIDER will win (payoff 1) it if accumulates N units of material before a given time, and the goal of the SEEKER will win (payoff 0) otherwise. We assume the HIDER can place continuous material such as fuel at discrete locations i = 1, 2, …, n, and the game is played in discrete time. At each time k > 0 the HIDER acquires h units of material and can distribute it among all of the locations. At the same time, k, the SEEKER can search a certain number s < n of the locations, and will confiscate (or destroy) all material found. After explicitly describing what we mean by a continuous accumulation game on discrete locations, we prove a theorem that gives a condition under which the HIDER can always win by using a uniform distribution at each stage of the game. When this condition does not hold, special cases and examples show that the resulting game becomes complicated even when played only for a single stage. We reduce the single stage game to an optimization problem, and also obtain some partial results on its solution. We also consider accumulation games where the locations are arranged in either a circle or in a line segment and the SEEKER must search a series of adjacent locations. © 2002 John Wiley & Sons, Inc. Naval Research Logistics, 49: 60–77, 2002; DOI 10.1002/nav.1048 相似文献
175.
176.
177.
When rational choice theory is applied to the study of terrorism, it is important that attention be given to the derived principles of constrained utility maximization. Particularly useful is the Slutsky equation, which rigorously analyzes the quantity response in one activity to a price change in another. By directing attention to assumptions and/or information about compensated cross price elasticities, expenditure shares, and income elasticities, the Slutsky equation can provide critical guidance in both theoretical and empirical analysis. 相似文献
178.
HÅKAN FRIMAN 《African Security Review》2013,22(3):62-77
The armed conflict in the DRC has been characterised by appalling, widespread and systematic human rights violations. It varies from civil war to a war between national armies. Much of the conflict falls between these two categories due to the involvement of foreign troops in civil strife, as well as foreign rebel groups fighting their home government's troops but on Congolese soil. The most pressing need is to cease hostilities and address the humanitarian situation in the country. Questions of justice and accountability, and issues relating to the rule of law will have to be addressed soon in order to achieve a durable peace in the country and in the region. Since there are links between different conflicts in the region, a broader solution should preferably be found. However, this would further complicate an already difficult proposition. Efforts limited to the DRC would be more feasible and could lead to similar measures in other conflict ridden countries in the region. This essay therefore discusses the available processes for justice. 相似文献
179.
180.