全文获取类型
收费全文 | 755篇 |
免费 | 44篇 |
国内免费 | 8篇 |
专业分类
化学 | 18篇 |
力学 | 38篇 |
综合类 | 31篇 |
数学 | 643篇 |
物理学 | 77篇 |
出版年
2024年 | 2篇 |
2023年 | 7篇 |
2022年 | 11篇 |
2021年 | 11篇 |
2020年 | 8篇 |
2019年 | 8篇 |
2018年 | 16篇 |
2017年 | 21篇 |
2016年 | 28篇 |
2015年 | 19篇 |
2014年 | 64篇 |
2013年 | 53篇 |
2012年 | 40篇 |
2011年 | 35篇 |
2010年 | 45篇 |
2009年 | 60篇 |
2008年 | 51篇 |
2007年 | 64篇 |
2006年 | 24篇 |
2005年 | 24篇 |
2004年 | 14篇 |
2003年 | 16篇 |
2002年 | 17篇 |
2001年 | 16篇 |
2000年 | 20篇 |
1999年 | 13篇 |
1998年 | 8篇 |
1997年 | 7篇 |
1996年 | 9篇 |
1995年 | 13篇 |
1994年 | 6篇 |
1993年 | 3篇 |
1992年 | 7篇 |
1991年 | 3篇 |
1990年 | 2篇 |
1989年 | 2篇 |
1988年 | 11篇 |
1987年 | 2篇 |
1986年 | 2篇 |
1985年 | 17篇 |
1984年 | 7篇 |
1983年 | 3篇 |
1982年 | 5篇 |
1981年 | 4篇 |
1978年 | 2篇 |
1977年 | 2篇 |
1976年 | 1篇 |
1975年 | 1篇 |
1970年 | 1篇 |
1957年 | 1篇 |
排序方式: 共有807条查询结果,搜索用时 15 毫秒
41.
MODELING HARVEST SCHEDULING IN MULTIFUNCTIONAL PLANNING OF FORESTS FOR LONGTERM WATER YIELD OPTIMIZATION 下载免费PDF全文
HAYATI ZENGIN ÜNAL ASAN SINAN DESTAN MURAT ENGIN ÜNAL AHMET YEŞIL PETE BETTINGER AHMET SALIH DEĞERMENCI 《Natural Resource Modeling》2015,28(1):59-85
In this study, wood production and hydrologic functions of forests were accommodated within a planning procedure for separate working circles (areas dedicated to certain forest functions) that were delineated according to an Ecosystem‐Based Functional Planning approach. Mixed integer goal programming was used as the optimization technique. The timing and scheduling of a maintenance cutting (partial harvest) was the decision variable in the modeling effort, and an original formulation was developed as a multiobjective planning procedure. Four sample planning strategies were developed and model outputs were evaluated according to these strategies. Spatial characteristics of stands were considered, and used to prohibit the regeneration of adjacent stands during the same time period. Because of the positive relationship between qualified water production and standing timber volume in the forest, the model attempts to maximize qualified water production levels by increasing standing volume stocks in the forest through the delay of regeneration activities. 相似文献
42.
本文主要研究E-凸函数的若干性质,引入E-凸多目标规划的定义,建立E-凸多目标规划的Mond-Weir型对偶问题,并在E.凸条件假设下,证明E-凸多目标规划的弱对偶性、直接对偶性及逆对偶性. 相似文献
43.
This paper develops a fuzzy multi-period production planning and sourcing problem with credibility objective, in which a manufacturer has a number of plants or subcontractors. According to the credibility service levels set by customers in advance, the manufacturer has to satisfy different product demands. In the proposed production problem, production cost, inventory cost and product demands are uncertain and characterized by fuzzy variables. The problem is to determine when and how many products are manufactured so as to maximize the credibility of the fuzzy costs not exceeding a given allowable invested capital, and this credibility can be regarded as the investment risk criteria in fuzzy decision systems. In the case when the fuzzy parameters are mutually independent gamma distributions, we can turn the service level constraints into their equivalent deterministic forms. However, in this situation the exact analytical expression for the credibility objective is unavailable, thus conventional optimization algorithms cannot be used to solve our production planning problems. To overcome this obstacle, we adopt an approximation scheme to compute the credibility objective, and deal with the convergence about the computational method. Furthermore, we develop two heuristic solution methods. The first is a combination of the approximation method and a particle swarm optimization (PSO) algorithm, and the second is a hybrid algorithm by integrating the approximation method, a neural network (NN), and the PSO algorithm. Finally, we consider one 6-product source, 6-period production planning problem, and compare the effectiveness of two algorithms via numerical experiments. 相似文献
44.
Competitiveness in global markets requires the ongoing identification and full utilization of improvement potential. To cut costs by means of process optimization, logistics service providers need to focus on efficient planning — not only for external but also for internal transports. This contribution will demonstrate that significant reductions in internal transports at one of the Deutsche Post World Net’s main parcel sorting centers can be achieved by applying the robust solution of a modified three-dimensional linear assignment model. 相似文献
45.
A survey of berth allocation and quay crane scheduling problems in container terminals 总被引:2,自引:0,他引:2
Due to the variety of technical equipments and terminal layouts, research has produced a multitude of optimization models for seaside operations planning in container terminals. To provide a support in modeling problem characteristics and in suggesting applicable algorithms this paper reviews the relevant literature. For this purpose new classification schemes for berth allocation problems and quay crane scheduling problems are developed. Particular focus is put on integrated solution approaches which receive increasing importance for the terminal management. 相似文献
46.
In a recent paper, Chen and Ji [Chen, K., Ji, P., 2007. A mixed integer programming model for advanced planning and scheduling (APS). European Journal of Operational Research 181, 515–522] develop a mixed integer programming model for advanced planning and scheduling problem that considers capacity constraints and precedence relations between the operations. The orders require processing of several operations on eligible machines. The model presented in the above paper works for the case where each operation can be processed on only one machine. However, machine eligibility means that only a subset of machines are capable of processing a job and this subset may include more than one machine. We provide a general model for advanced planning and scheduling problems with machine eligibility. Our model can be used for problems where there are alternative machines that an operation can be assigned to. 相似文献
47.
Tommy Clausen Allan Nordlunde Hjorth Morten Nielsen David Pisinger 《European Journal of Operational Research》2010
In this paper we address the problem of assigning seats in a train for a group of people traveling together. We consider two variants of the problem. One is a special case of two-dimensional knapsack where we consider the train as having fixed size and the objective is to maximize the utilization of the seats in the train. The second is a special case of two-dimensional bin packing where all requests must be accommodated while trying to minimize the number of passenger cars needed. For both variants of the problem we present a number of bounds and develop exact algorithms. Computational results are presented for various instances based on realistic data, and from the packing literature adapted to the problems addressed. 相似文献
48.
This paper introduces a blocking model and closed-form expression of two workers traveling with walk speed m (m = integer) in a no-passing circular-passage system of n stations and assuming n = m + 2, 2m + 2, …. We develop a Discrete-Timed Markov Chain (DTMC) model to capture the workers’ changes of walk, pick, and blocked states, and quantify the throughput loss from blocking congestion by deriving a steady state probability in a closed-form expression. We validate the model with a simulation study. Additional simulation comparisons show that the proposed throughput model gives a good approximation of a general-sized system of n stations (i.e., n > 2), a practical walk speed system of real number m (i.e., m ? 1), and a bucket brigade order picking application. 相似文献
49.
Francesca Guerriero Giovanna Miglionico Filomena Olivito 《European Journal of Operational Research》2014
The paper addresses restaurant revenue management from both a strategic and an operational point of view. Strategic decisions in restaurants are mainly related to defining the most profitable combination of tables that will constitute the restaurant. We propose new formulations of the so-called “Tables Mix Problem” by taking into account several features of the real setting. We compare the proposed models in a computational study showing that restaurants, with the capacity of managing tables as renewable resources and of combining different-sized tables, can improve expected revenue performances. Operational decisions are mainly concerned with the more profitable assignment of tables to customers. Indeed, the “Parties Mix Problem” consists of deciding on accepting or denying a booking request from different groups of customers, with the aim of maximizing the total expected revenue. A dynamic formulation of the “Parties Mix Problem” is presented together with a linear programming approximation, whose solutions can be used to define capacity control policies based on booking limits and bid prices. Computational results compare the proposed policies and show that they lead to higher revenues than the traditional strategies used to support decision makers. 相似文献
50.
Lanah Evers Ana Isabel Barros Herman Monsuur Albert Wagelmans 《European Journal of Operational Research》2014
In this paper we simultaneously consider three extensions to the standard Orienteering Problem (OP) to model characteristics that are of practical relevance in planning reconnaissance missions of Unmanned Aerial Vehicles (UAVs). First, travel and recording times are uncertain. Secondly, the information about each target can only be obtained within a predefined time window. Due to the travel and recording time uncertainty, it is also uncertain whether a target can be reached before the end of its time window. Finally, we consider the appearance of new targets during the flight, so-called time-sensitive targets, which need to be visited immediately if possible. We tackle this online stochastic UAV mission planning problem with time windows and time-sensitive targets using a re-planning approach. To this end, we introduce the Maximum Coverage Stochastic Orienteering Problem with Time Windows (MCS-OPTW). It aims at constructing a tour with maximum expected profit of targets that were already known before the flight. Secondly, it directs the planned tour to predefined areas where time-sensitive targets are expected to appear. We have developed a fast heuristic that can be used to re-plan the tour, each time before leaving a target. In our computational experiments we illustrate the benefits of the MCS-OPTW planning approach with respect to balancing the two objectives: the expected profits of foreseen targets, and expected percentage of time-sensitive targets reached on time. We compare it to a deterministic planning approach and show how it deals with uncertainty in travel and recording times and the appearance of time-sensitive targets. 相似文献