全文获取类型
收费全文 | 748篇 |
免费 | 44篇 |
国内免费 | 8篇 |
专业分类
化学 | 18篇 |
力学 | 35篇 |
综合类 | 31篇 |
数学 | 639篇 |
物理学 | 77篇 |
出版年
2023年 | 6篇 |
2022年 | 11篇 |
2021年 | 11篇 |
2020年 | 8篇 |
2019年 | 8篇 |
2018年 | 16篇 |
2017年 | 20篇 |
2016年 | 28篇 |
2015年 | 19篇 |
2014年 | 64篇 |
2013年 | 53篇 |
2012年 | 40篇 |
2011年 | 35篇 |
2010年 | 45篇 |
2009年 | 60篇 |
2008年 | 51篇 |
2007年 | 61篇 |
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篇 |
1980年 | 1篇 |
1978年 | 1篇 |
1977年 | 2篇 |
1976年 | 1篇 |
1975年 | 1篇 |
1970年 | 1篇 |
1957年 | 1篇 |
排序方式: 共有800条查询结果,搜索用时 31 毫秒
51.
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. 相似文献
52.
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. 相似文献
53.
《佛山科学技术学院》2014,6(2):245-262
In this paper, we present a multi-objective linear fractional programming (MOLFP) approach for multi-objective linear fuzzy goal programming (MOLFGP) problem. Here, we consider a problem in which a set of pair of goals are optimized in ratio rather than optimizing them individually. In particular, we consider the optimization of profit to cash expenditure and crop production in various seasons to land utilization as a fractional objectives and used remaining goals in its original form. Further, the goals set in agricultural production planning are conflicting in nature; thus we use the concept of conflict and nonconflict between goals for computation of appropriate aspiration level. The method is illustrated on a problem of agricultural production system for comparison with Biswas and Pal [1] method to show its suitability. 相似文献
54.
调查方案设计是居民生活碳排放调查及数据分析的基础和保证.以大量文献和作者在居民生活碳排放调查中的实践经验为基础,立足调查方案的科学性和实践操作的可行性,以青海省为例,从居民生活碳排放调查的统计量选取、抽样框的构建、抽样方法的选择和样本量的确定、调查方案实施的详细步骤4方面综述性归纳了一套居民生活碳排放调查方案设计的方法,以期为居民生活碳排放研究提供参考. 相似文献
55.
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. 相似文献
56.
Alain Billionnet 《Applied Mathematical Modelling》2012,36(5):2213-2223
We consider a landscape divided into elementary cells, each of these cells containing some species to be protected. We search to select a set of cells to form a natural reserve in order to protect all the species present in the landscape. A species is considered protected if it is present in a certain number of cells of the reserve. There is an important spatial constraint concerning the set of selected cells: a species must be able to go from any cell to any cell without leaving the reserve. An integer linear programming model was proposed by Önal and Briers [2] for this reserve selection problem, but the size of the problems which can be handled by this model is limited: several hours of computation are required for solving instances with hundred of cells and hundred of species. Having proposed an improvement of this model which reduces appreciably the computation time, we propose another integer linear programming model, easy to carry out, which allows to obtain, in a few seconds of computation, optimal or near-optimal solutions for instances with hundred of cells and hundred of species. However, the computation time becomes prohibitive for instances with more than 200 cells and 100 species. But, this approach can be particularly useful to solve the problem, in an approximate way, by aggregation of cells as proposed by Önal and Briers [2]. 相似文献
57.
We consider a competitive version of the traditional aggregate production planning model with capacity constraints. In the general case, multiple products are produced by a few competing producers (oligopoly) with limited capacities. Production quantities, prices and consequently profits depend on production and allocation decisions of each producer. In addition, there is competition for the raw material whose supplies are limited, and where prices reflect these limitations. Such situations have recently occurred in several process industry settings including petro-refining, petrochemicals, basic chemicals, cement, fertilizers, pharmaceuticals, rubber, paper, food processing and metals. We use a successive “Bertrand–Cournot” framework to address this problem and to determine optimal production quantities, prices and profits at the producers and at the raw material supplier. Our analysis allows a new way to understand and evaluate the marginal value of additional capacity when there is competition for the market and raw materials. 相似文献
58.
《Optimization》2012,61(3):687-707
This paper proposes an optimization method for a national-level highway project planning based on a modified genetic algorithm. The proposed method adds to the existing methods by integrating various planning elements into a single system. A simulation model is used in order to determine the best investment strategy with regard to net present value, time deviation from the initial plan and discrepancy between available resources and investment costs by taking into account economical, social, traffic and political factors. The outcome is a project schedule with an optimized cash flow. The proposed method was tested using the example of the National Highway Programme in Slovenia. 相似文献
59.
We consider the design of multiple transit lines in a network and present a mixed integer formulation for this multiple-route
transit network design problem (MRTNDP). With the introduction of node labels, the formulation can exploit the route structure
and hence attains efficiency in obtaining a cost minimizing transit network design.
This revised version was published online in July 2006 with corrections to the Cover Date. 相似文献
60.
本依据教育专业规划的定量分析方法,讲述了规划一所中学的办学模型的数学手段,提出了需考虑的主要因素,介绍了这些因素的量化方法,所应用的数学模型。 相似文献