全文获取类型
收费全文 | 569篇 |
免费 | 22篇 |
国内免费 | 1篇 |
专业分类
592篇 |
出版年
2021年 | 7篇 |
2019年 | 12篇 |
2018年 | 8篇 |
2017年 | 12篇 |
2016年 | 12篇 |
2015年 | 10篇 |
2014年 | 7篇 |
2013年 | 113篇 |
2012年 | 6篇 |
2011年 | 8篇 |
2010年 | 6篇 |
2009年 | 9篇 |
2008年 | 7篇 |
2007年 | 6篇 |
2006年 | 9篇 |
2005年 | 9篇 |
2004年 | 9篇 |
2003年 | 7篇 |
2000年 | 6篇 |
1999年 | 6篇 |
1997年 | 7篇 |
1996年 | 14篇 |
1995年 | 5篇 |
1994年 | 12篇 |
1993年 | 12篇 |
1992年 | 11篇 |
1991年 | 17篇 |
1989年 | 10篇 |
1988年 | 8篇 |
1987年 | 10篇 |
1986年 | 14篇 |
1985年 | 19篇 |
1984年 | 8篇 |
1983年 | 7篇 |
1982年 | 6篇 |
1981年 | 5篇 |
1980年 | 10篇 |
1979年 | 10篇 |
1978年 | 11篇 |
1977年 | 6篇 |
1976年 | 11篇 |
1975年 | 11篇 |
1974年 | 9篇 |
1973年 | 10篇 |
1972年 | 13篇 |
1971年 | 9篇 |
1970年 | 12篇 |
1969年 | 6篇 |
1968年 | 9篇 |
1967年 | 7篇 |
排序方式: 共有592条查询结果,搜索用时 15 毫秒
501.
This article develops a mathematical model and heuristic algorithm to design recreational boating mooring fields. The boating industry is important to the Florida economy, and boat storage is becoming a concern among those in the industry. The mooring field design problem is formulated to maximize the total number of boat feet moored in the mooring field. In the model, we allow two adjacent moorings to overlap, which introduces a risk that under certain conditions the boats on these moorings could contact each other. We identify the conditions when contact is possible and quantify the probability of contact. The mooring field design problem is formulated as a nonlinear mixed‐integer programming problem. To solve the problem, we decompose it into two separate models, a mooring radii assignment model and a mooring layout model, which are solved sequentially. The first is solved via exhaustive enumeration and the second via a depth‐first search algorithm. Two actual mooring fields are evaluated, and in both cases our model leads to better layouts than ones experts developed manually. The mooring field design model rationalizes the mooring field design and shows that in one case by increasing the risk from 0 to 1%, the mooring efficiency increases from 74.8% to 96.2%. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009 相似文献
502.
503.
504.
In this article an algorithm for computing upper and lower ? approximations of a (implicitly or explicitly) given convex function h defined on an interval of length T is developed. The approximations can be obtained under weak assumptions on h (in particular, no differentiability), and the error decreases quadratically with the number of iterations. To reach an absolute accuracy of ? the number of iterations is bounded by
505.
We examine the static sequencing problem of ordering the processing of jobs on a single machine so as to minimize the average weighted flow time. It is assumed that all jobs have zero ready times, and that the jobs are grouped into classes with the property that setup tasks are only required when processing switches from jobs of one class to jobs of another class. The time required for each setup task is given by the sum of a setdown time from the previous class and a setup time for the new class. We show that an algorithm presented in the literature for solving a special case of this problem gives suboptimal solutions. A number of properties of the optimal solution are derived, and their use in algorithms is evaluated. Computational results are presented for both a branch-and-bound procedure and a simpler depth-first search. 相似文献
506.
507.
A carrier battle group is operating in an area where it is subject to attack by enemy aircraft. It is anticipated that air raids will occur in large waves. The uncertain time between raids is available for the replenishment of supplies. We consider the problem of how best to schedule ammunition replenishment during this period. The theory of Gittins indices provides the technical background to the development of a range of models which yield a hierarchy of index-based heuristics for replenishment. One such heuristic is assessed computationally in a more realistic scenario than is explicitly allowed for by the models. 相似文献
508.
Mediators increase the effectiveness of negotiation processes. The art of mediation includes interpersonal skills, ability to convince, and proficiency in argumentation. The science of mediation represents an analytical approach to problem solving, a systematic analysis of the process, of players' positions, and of their goals, aspirations, and concessions. Analytical tools for mediation can be used by mediators, but these tools can also support negotiators in their analysis, verification of their positions, and choices. The knowledge of effective and safe alternatives, of sets of compromises, and the knowledge of the possible outcomes of concessions may be used to develop an effective strategy and to increase a negotiator's bargaining power. Models to analyze alternatives, to verify concessions made by the opponents, to determine effective alternatives, and to search for solutions that yield mutual gains, to aggregate opponents' proposals, to look for coalition members, and to simulate some of the actions of a mediator are discussed in the article. 相似文献
509.
510.