全文获取类型
收费全文 | 136篇 |
免费 | 14篇 |
国内免费 | 3篇 |
专业分类
化学 | 3篇 |
力学 | 2篇 |
数学 | 125篇 |
物理学 | 23篇 |
出版年
2023年 | 1篇 |
2022年 | 2篇 |
2021年 | 5篇 |
2020年 | 3篇 |
2019年 | 1篇 |
2018年 | 4篇 |
2016年 | 1篇 |
2014年 | 15篇 |
2013年 | 11篇 |
2012年 | 11篇 |
2011年 | 9篇 |
2010年 | 10篇 |
2009年 | 16篇 |
2008年 | 10篇 |
2007年 | 23篇 |
2006年 | 5篇 |
2005年 | 2篇 |
2004年 | 3篇 |
2003年 | 2篇 |
2002年 | 2篇 |
1998年 | 2篇 |
1997年 | 3篇 |
1996年 | 2篇 |
1995年 | 1篇 |
1994年 | 1篇 |
1992年 | 2篇 |
1986年 | 1篇 |
1981年 | 3篇 |
1980年 | 1篇 |
1974年 | 1篇 |
排序方式: 共有153条查询结果,搜索用时 0 毫秒
11.
A multiobjective combinatorial optimization (MOCO) formulation for the following location-routing problem in healthcare management is given: For a mobile healthcare facility, a closed tour with stops selected from a given set of population nodes has to be found. Tours are evaluated according to three criteria: (i) An economic efficiency criterion related to the tour length, (ii) the criterion of average distances to the nearest tour stops corresponding to p-median location problem formulations, and (iii) a coverage criterion measuring the percentage of the population unable to reach a tour stop within a predefined maximum distance. Three algorithms to compute approximations to the set of Pareto-efficient solutions of the described MOCO problem are developed. The first uses the P-ACO technique, and the second and the third use the VEGA and the MOGA variant of multiobjective genetic algorithms, respectively. Computational experiments for the Thiès region in Senegal were carried out to evaluate the three approaches on real-world problem instances. 相似文献
12.
In this paper we consider the problem of locating one new facility with respect to a given set of existing facilities in the plane and in the presence of convex polyhedral barriers. It is assumed that a barrier is a region where neither facility location nor travelling are permitted. The resulting non-convex optimization problem can be reduced to a finite series of convex subproblems, which can be solved by the Weiszfeld algorithm in case of the Weber objective function and Euclidean distances. A solution method is presented that, by iteratively executing a genetic algorithm for the selection of subproblems, quickly finds a solution of the global problem. Visibility arguments are used to reduce the number of subproblems that need to be considered, and numerical examples are presented. 相似文献
13.
José Fernández Blas Pelegrı´n Frank Plastria Boglárka Tóth 《European Journal of Operational Research》2007
A chain wants to set up a single new facility in a planar market where similar facilities of competitors, and possibly of its own chain, are already present. Fixed demand points split their demand probabilistically over all facilities in the market proportionally with their attraction to each facility, determined by the different perceived qualities of the facilities and the distances to them, through a gravitational or logit type model. Both the location and the quality (design) of the new facility are to be found so as to maximise the profit obtained for the chain. Several types of constraints and costs are considered. 相似文献
14.
15.
This paper presents a mixed-integer programming formulation to find optimal solutions for the block layout problem with unequal departmental areas arranged in flexible bays. The nonlinear department area constraints are modeled in a continuous plane without using any surrogate constraints. The formulation is extensively tested on problems from the literature. 相似文献
16.
Mohit Tawarmalani Shabbir Ahmed Nikolaos V. Sahinidis 《Journal of Global Optimization》2002,24(4):385-416
We develop eight different mixed-integer convex programming reformulations of 0-1 hyperbolic programs. We obtain analytical results on the relative tightness of these formulations and propose a branch and bound algorithm for 0-1 hyperbolic programs. The main feature of the algorithm is that it reformulates the problem at every node of the search tree. We demonstrate that this algorithm has a superior convergence behavior than directly solving the relaxation derived at the root node. The algorithm is used to solve a discrete p-choice facility location problem for locating ten restaurants in the city of Edmonton.The research was supported in part by NSF awards DMII 95-02722 and BES 98-73586 to NVS. 相似文献
17.
We consider a location problem where the distribution of the existing facilities is described by a probability distribution
and the transportation cost is given by a combination of transportation cost in a network and continuous distance. The motivation
is that in many cases transportation cost is partly given by the cost of travel in a transportation network whereas the access
to the network and the travel from the exit of the network to the new facility is given by a continuous distance.
相似文献
18.
This note describes the nature of optimal solutions for the spherical Steiner-Weber location problem for the case of unit weights and either 3 or 4 demand points (requireing 4 demand points to lie in an open hemisphere). Geometrically appealing results which are necessary conditions for optimum solutions and spherical analogs of known planar results are obtained. 相似文献
19.
This paper presents two facility location models for the problem of determining how to optimally serve the requirements for communication circuits between the United States and various European and Middle Eastern countries. Given a projection of future requirements, the problem is to plan for the economic growth of a communications network to satisfy these requirements. Both satellite and submarine cable facilities may be used. The objective is to find an optimal placement of cables (type, location, and timing) and the routing of individual circuits between demand points (over both satellites and cables) such that the total discounted cost over a T-period horizon is minimized. This problem is cast as a multiperiod, capacitated facility location problem. Two mathematical models differing in their provisions for network reliability are presented. Solution approaches are outlined and compared by means of computational experience. Use of the models both in planning the growth of the network and in the economic evaluation of different cable technologies is also discussed. 相似文献
20.
We present an exact approach for solving the -interdiction median problem with fortification. Our approach consists of solving a greedy heuristic and a set cover problem iteratively that guarantees to find an optimal solution upon termination. The greedy heuristic obtains a feasible solution to the problem, and the set cover problem is solved to verify optimality of the solution and to provide a direction for improvement if not optimal. We demonstrate the performance of the algorithm in a computational study. 相似文献