全文获取类型
收费全文 | 173篇 |
免费 | 5篇 |
专业分类
178篇 |
出版年
2019年 | 5篇 |
2018年 | 8篇 |
2017年 | 3篇 |
2016年 | 3篇 |
2015年 | 4篇 |
2014年 | 5篇 |
2013年 | 32篇 |
2012年 | 3篇 |
2011年 | 2篇 |
2010年 | 1篇 |
2009年 | 4篇 |
2005年 | 1篇 |
2004年 | 2篇 |
2003年 | 6篇 |
2002年 | 2篇 |
2001年 | 2篇 |
2000年 | 4篇 |
1999年 | 1篇 |
1998年 | 1篇 |
1997年 | 3篇 |
1996年 | 1篇 |
1995年 | 2篇 |
1994年 | 2篇 |
1993年 | 4篇 |
1992年 | 2篇 |
1991年 | 3篇 |
1990年 | 4篇 |
1989年 | 4篇 |
1988年 | 7篇 |
1987年 | 4篇 |
1986年 | 5篇 |
1985年 | 2篇 |
1984年 | 2篇 |
1983年 | 3篇 |
1981年 | 1篇 |
1980年 | 2篇 |
1979年 | 3篇 |
1978年 | 1篇 |
1977年 | 1篇 |
1976年 | 3篇 |
1975年 | 2篇 |
1974年 | 6篇 |
1973年 | 2篇 |
1972年 | 4篇 |
1971年 | 4篇 |
1970年 | 3篇 |
1969年 | 4篇 |
1968年 | 3篇 |
1966年 | 1篇 |
1948年 | 1篇 |
排序方式: 共有178条查询结果,搜索用时 0 毫秒
51.
We consider a generalization of the well‐known generalized assignment problem (GAP) over discrete time periods encompassed within a finite planning horizon. The resulting model, MultiGAP, addresses the assignment of tasks to agents within each time period, with the attendant single‐period assignment costs and agent‐capacity constraint requirements, in conjunction with transition costs arising between any two consecutive periods in which a task is reassigned to a different agent. As is the case for its single‐period antecedent, MultiGAP offers a robust tool for modeling a wide range of capacity planning problems occurring within supply chain management. We provide two formulations for MultiGAP and establish that the second (alternative) formulation provides a tighter bound. We define a Lagrangian relaxation‐based heuristic as well as a branch‐and‐bound algorithm for MultiGAP. Computational experience with the heuristic and branch‐and‐bound algorithm on over 2500 test problems is reported. The Lagrangian heuristic consistently generates high‐quality and in many cases near‐optimal solutions. The branch‐and‐bound algorithm is also seen to constitute an effective means for solving to optimality MultiGAP problems of reasonable size. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012 相似文献
52.
The machine scheduling literature does not consider the issue of tool change. The parallel literature on tool management addresses this issue but assumes that the change is due only to part mix. In practice, however, a tool change is caused most frequently by tool wear. That is why we consider here the problem of scheduling a set of jobs on a single CNC machine where the cutting tool is subject to wear; our objective is to minimize the total completion time. We first describe the problem and discuss its peculiarities. After briefly reviewing available theoretical results, we then go on to provide a mixed 0–1 linear programming model for the exact solution of the problem; this is useful in solving problem instances with up to 20 jobs and has been used in our computational study. As our main contribution, we next propose a number of heuristic algorithms based on simple dispatch rules and generic search. We then discuss the results of a computational study where the performance of the various heuristics is tested; we note that the well‐known SPT rule remains good when the tool change time is small but deteriorates as this time increases and further that the proposed algorithms promise significant improvement over the SPT rule. © 2002 Wiley Periodicals, Inc. Naval Research Logistics, 2003 相似文献
53.
Marjolein B.A. van Asselt 《Contemporary Security Policy》2018,39(4):590-600
While security points to a deliberate harming of humans and/or the environment, safety refers to unintended damage. In this view point, I will analyse how the distinction between safety and security matters in the practice of accident investigation and I will argue that the division between the fields is problematic for the assessment of security-related safety risks. Drawing on the case of the our accident investigation into the downing of flight MH17 above Ukraine in 2014, I highlight key dilemmas the Dutch Safety Board dealt with. 相似文献
54.
We consider the problem of efficiently scheduling deliveries by an uncapacitated courier from a central location under online arrivals. We consider both adversary‐controlled and Poisson arrival processes. In the adversarial setting we provide a randomized (3βΔ/2δ ? 1) ‐competitive algorithm, where β is the approximation ratio of the traveling salesman problem, δ is the minimum distance between the central location and any customer, and Δ is the length of the optimal traveling salesman tour overall customer locations and the central location. We provide instances showing that this analysis is tight. We also prove a 1 + 0.271Δ/δ lower‐bound on the competitive ratio of any algorithm in this setting. In the Poisson setting, we relax our assumption of deterministic travel times by assuming that travel times are distributed with a mean equal to the excursion length. We prove that optimal policies in this setting follow a threshold structure and describe this structure. For the half‐line metric space we bound the performance of the randomized algorithm in the Poisson setting, and show through numerical experiments that the performance of the algorithm is often much better than this bound. 相似文献
55.
In this article, we study the stochastic version of the so-called bottleneck assignment problem. Our primary objective is to maximize the probability that the bottleneck value satisfies a specified target. Under general stochastic assumptions, we show that the solution in this case is easily obtained by solving a linear assignment problem. We next examine the situation where the target is to be minimized, given that the probability of satisfying the target exceeds a specified threshold. Finally, we address extensions to the original problem where a second objective is also considered. 相似文献
56.
57.
The rise of China has been fuelled by a massive military modernisation programme relying, in large part, on the acquisition of foreign military equipment. The question of how the world’s major powers define their arms transfer policies towards China is therefore crucially important. This article makes two original contributions. First, drawing on neoclassical realism, it proposes an explanatory framework integrating international and domestic factors to explain variations in major powers’ arms transfers. Second, based on a large body of elite interviews and diplomatic cables, it offers the first comprehensive comparison of American, British, French and Russian arms transfer policies towards China since the end of the Cold War. 相似文献
58.
Consider the conditional covering problem on an undirected graph, where each node represents a site that must be covered by a facility, and facilities may only be established at these nodes. Each facility can cover all sites that lie within some common covering radius, except the site at which it is located. Although this problem is difficult to solve on general graphs, there exist special structures on which the problem is easily solvable. In this paper, we consider the special case in which the graph is a simple path. For the case in which facility location costs do not vary based on the site, we derive characteristics of the problem that lead to a linear‐time shortest path algorithm for solving the problem. When the facility location costs vary according to the site, we provide a more complex, but still polynomial‐time, dynamic programming algorithm to find the optimal solution. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
59.
The problem of finding minimal disconnecting sets for multi-commodity directed networks may be solved using an arc-path formulation and Gomory's all-integer integer programming algorithm. However, the number of network constraints may be astronomical for even moderately sized networks. This paper develops a finite algorithm similar to Gomory's, but requiring no more than m rows in the tableau, where m is the number of arcs in the network. 相似文献
60.
This paper considers the problem of computing, by iterative methods, optimal policies for Markov decision processes. The policies computed are optimal for all sufficiently small interest rates. 相似文献