全文获取类型
收费全文 | 724篇 |
免费 | 13篇 |
出版年
2021年 | 7篇 |
2020年 | 7篇 |
2019年 | 9篇 |
2017年 | 17篇 |
2016年 | 17篇 |
2015年 | 14篇 |
2014年 | 9篇 |
2013年 | 111篇 |
2012年 | 23篇 |
2011年 | 30篇 |
2010年 | 22篇 |
2009年 | 18篇 |
2008年 | 31篇 |
2007年 | 14篇 |
2006年 | 18篇 |
2005年 | 12篇 |
2004年 | 10篇 |
2003年 | 6篇 |
2002年 | 5篇 |
1999年 | 6篇 |
1998年 | 8篇 |
1997年 | 7篇 |
1996年 | 9篇 |
1995年 | 7篇 |
1994年 | 11篇 |
1993年 | 13篇 |
1992年 | 11篇 |
1991年 | 18篇 |
1989年 | 17篇 |
1988年 | 6篇 |
1987年 | 17篇 |
1986年 | 19篇 |
1985年 | 19篇 |
1983年 | 8篇 |
1982年 | 6篇 |
1981年 | 9篇 |
1980年 | 12篇 |
1979年 | 13篇 |
1978年 | 7篇 |
1977年 | 11篇 |
1976年 | 10篇 |
1975年 | 8篇 |
1974年 | 7篇 |
1972年 | 19篇 |
1971年 | 8篇 |
1970年 | 10篇 |
1969年 | 13篇 |
1968年 | 11篇 |
1967年 | 6篇 |
1966年 | 6篇 |
排序方式: 共有737条查询结果,搜索用时 15 毫秒
171.
This paper discusses a mixed integer programming method for solving the Facilities Location Problem with capacities on the facilities. The algorithm uses a Decomposition technique to solve the dual of the associated continuous problem in each branch-bound iteration. The method was designed to produce the global optimum solution for problems with up to 100 facilities and 1,000 customers. Computational experience and a complete example are also presented in the appendix. 相似文献
172.
This paper presents a linear programming model of a fleet of vessels which is required to transport quantities of cargo, such as coal, iron ore, limestone, and salt from certain producing ports to specific destination ports. This model has been implemented and is currently being used both for planning purposes and as an aid in scheduling the trips to be made by each vessel. 相似文献
173.
174.
Grace L. Yang 《海军后勤学研究》1985,32(1):45-51
Renewal theory is used to study the effectiveness of a class of continuous sampling plans first introduced by Dodge. This approach provides a simple way of viewing and computing the long-run Average Outgoing Quality (AOQ) and its maximum AOQL. More importantly, it is used to study the average outgoing quality in a short production run through an approximation formula AOQ*(t). Formulas for AOQ and AOQ*(t) are provided. By simulation, it is found that AOQ*(t) is sufficiently accurate in situations corresponding to actual practice. 相似文献
175.
The objective of this article is to describe heuristic solutions to the problem of modeling inventories at each node of a large network in the context of a computer simulation model of that network. The heuristic solutions are compared with the mathematical solution which is too unwieldy for use in a simulation model. The Weibull cumulative distribution is used as an approximation for the heuristic models. We question whether the good performance of the Weibull is coincidence or perhaps mathematically justifiable. 相似文献
176.
177.
Tobias Brueggemann Johann L. Hurink Tjark Vredeveld Gerhard J. Woeginger 《海军后勤学研究》2011,58(8):795-803
We investigate the quality of local search heuristics for the scheduling problem of minimizing the makespan on identical parallel machines. We study exponential size neighborhoods (whose size grows exponentially with the input length) that can be searched in polynomial time, and we derive worst‐case approximation guarantees for the local optima of such neighborhoods. The so‐called split neighborhood splits a feasible schedule into two layers, and then recombines the two layers by finding a perfect matching. We show that the makespan of every local optimum for split is at most a factor of 2 away from the globally optimal makespan. We then combine the split neighborhood with two neighborhoods from the literature. The combination of split with the jump neighborhood only marginally improves the approximation guarantee, whereas the combination with the lexicographic‐jump neighborhood decreases the approximation guarantee from 2 to 3/2. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
178.
179.
左手材料的介电常数和磁导率都为负值,电场、磁场和波矢量在左手材料中表现为左手螺旋关系,相速与群速方向相反。根据传输线理论分析了波入射到分层媒质上的表面反射系数,计算了随入射波频率、涂层厚度变化情况下的左、右手材料的反射率;基于非均匀有理B样条参数曲面模拟目标的几何外形,采用物理光学法计算了涂敷左手材料目标的雷达散射截面... 相似文献
180.
Many logistics systems operate in a decentralized way, while most optimization models assume a centralized planner. One example of a decentralized system is in some sea cargo companies: sales agents, who share ship capacity on a network, independently accept cargo from their location and contribute to the revenue of the system. The central headquarters does not directly control the agents' decisions but can influence them through system design and incentives. In this paper, we model the firm's problem to determine the best capacity allocation to the agents such that system revenue is maximized. In the special case of a single‐route, we formulate the problem as a mixed integer program incorporating the optimal agent behavior. For the NP‐hard multiple‐route case, we propose several heuristics for the problem. Computational experiments show that the decentralized system generally performs worse when network capacity is tight and that the heuristics perform reasonably well. We show that the decentralized system may perform arbitrarily worse than the centralized system when the number of locations goes to infinity, although the choice of sales incentive impacts the performance. We develop an upper bound for the decentralized system, where the bound gives insight on the performance of the heuristics in large systems. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献