全文获取类型
收费全文 | 268篇 |
免费 | 76篇 |
国内免费 | 14篇 |
专业分类
化学 | 12篇 |
晶体学 | 1篇 |
力学 | 17篇 |
综合类 | 5篇 |
数学 | 217篇 |
物理学 | 106篇 |
出版年
2023年 | 2篇 |
2022年 | 12篇 |
2021年 | 5篇 |
2020年 | 13篇 |
2019年 | 5篇 |
2018年 | 12篇 |
2017年 | 5篇 |
2016年 | 8篇 |
2015年 | 11篇 |
2014年 | 20篇 |
2013年 | 23篇 |
2012年 | 22篇 |
2011年 | 21篇 |
2010年 | 18篇 |
2009年 | 26篇 |
2008年 | 19篇 |
2007年 | 24篇 |
2006年 | 16篇 |
2005年 | 9篇 |
2004年 | 12篇 |
2003年 | 17篇 |
2002年 | 12篇 |
2001年 | 4篇 |
2000年 | 4篇 |
1999年 | 2篇 |
1998年 | 8篇 |
1997年 | 5篇 |
1996年 | 3篇 |
1995年 | 1篇 |
1994年 | 2篇 |
1993年 | 3篇 |
1992年 | 1篇 |
1991年 | 3篇 |
1989年 | 2篇 |
1988年 | 1篇 |
1986年 | 3篇 |
1985年 | 2篇 |
1984年 | 2篇 |
排序方式: 共有358条查询结果,搜索用时 15 毫秒
71.
本文研究了区间图上可带负权的2-中位选址问题.根据目标函数的不同,可带负权的$p-$中位选址问题($p\geq 2$)可分为两类:即 MWD 和 WMD 模型;前者是所有顶点与服务该顶点的设施之间的最小权重距离之和,后者是所有顶点与相应设施之间的权重最小距离之和.在本篇论文中,我们讨论了区间图上可带负权2-中位选址问题的两类模型,并分别设计时间复杂度为$O(n^2)$的多项式时间算法. 相似文献
72.
为减小物资生产与配送不协调造成的成本及生产资源浪费,建立了考虑推动式生产调度的物资配送优化模型,并针对标准模拟退火算法受随机因素影响易陷入局部最优的缺点,设计带有回火与缓冷操作的改进模拟退火算法对模型求解,确定了优化的车辆配送路线以及物资生产计划。对比实验结果表明:相对于单纯的物资配送优化模型,考虑推动式生产调度的配送优化模型,能够有效减小物资滞留时间以及配送延误成本;相较于标准模拟退火算法,改进算法搜索到了更优解,且计算结果的标准差减小了93.42%,稳定性更好;同时,改进模拟退火算法具有较低的偏差率,在中小规模算例中求解质量较高,平均偏差率在0.5%以内。 相似文献
73.
In this paper we consider a stochastic facility location model in which the weights of demand points are not deterministic but independent random variables, and the distance between the facility and each demand point isA-distance. Our objective is to find a solution which minimizes the total cost criterion subject to a chance constraint on cost restriction. We show a solution method which solves the problem in polynomial order computational time. Finally the case of rectilinear distance, which is used in many facility location models, is discussed. 相似文献
74.
A waste pipeline, considered as an undesirable facility, is to be located in a coastal region. Two criteria are taken into account, the Euclidean distance from a given set of protected areas (coral reefs and sandbanks) and a utility function related to the pipe length, both to be maximized. The paper describes a methodology to obtain an efficient set of points where the extreme of a marine pipeline should be located. Since the formulation of the model is based on the zone Voronoi diagram, the computational complexity of the solving procedure is low. 相似文献
75.
This paper addresses the finite size 1-center placement problem on a rectangular plane in the presence of barriers. Barriers are regions in which both facility location and travel through are prohibited. The feasible region for facility placement is subdivided into cells along the lines of Larson and Sadiq [R.C. Larson, G. Sadiq, Facility locations with the Manhattan metric in the presence of barriers to travel, Operations Research 31 (4) (1983) 652–669]. To overcome complications induced by the center (minimax) objective, we analyze the resultant cells based on the cell corners. We study the problem when the facility orientation is known a priori. We obtain domination results when the facility is fully contained inside 1, 2 and 3-cornered cells. For full containment in a 4-cornered cell, we formulate the problem as a linear program. However, when the facility intersects gridlines, analytical representation of the distance functions becomes challenging. We study the difficulties of this case and formulate our problem as a linear or nonlinear program, depending on whether the feasible region is convex or nonconvex. An analysis of the solution complexity is presented along with an illustrative numerical example. 相似文献
76.
Solution methods for the bi-objective (cost-coverage) unconstrained facility location problem with an illustrative example 总被引:1,自引:0,他引:1
Juan G. Villegas Fernando Palacios Andrés L. Medaglia 《Annals of Operations Research》2006,147(1):109-141
The Colombian coffee supply network, managed by the Federación Nacional de Cafeteros de Colombia (Colombian National Coffee-Growers
Federation), requires slimming down operational costs while continuing to provide a high level of service in terms of coverage
to its affiliated coffee growers. We model this problem as a biobjective (cost-coverage) uncapacitated facility location problem
(BOUFLP). We designed and implemented three different algorithms for the BOUFLP that are able to obtain a good approximation
of the Pareto frontier. We designed an algorithm based on the Nondominated Sorting Genetic Algorithm; an algorithm based on
the Pareto Archive Evolution Strategy; and an algorithm based on mathematical programming. We developed a random problem generator
for testing and comparison using as reference the Colombian coffee supply network with 29 depots and 47 purchasing centers.
We compared the algorithms based on the quality of the approximation to the Pareto frontier using a nondominated space metric
inspired on Zitzler and Thiele's. We used the mathematical programming-based algorithm to identify unique tradeoff opportunities
for the reconfiguration of the Colombian coffee supply network. Finally, we illustrate an extension of the mathematical programming-based
algorithm to perform scenario analysis for a set of uncapacitated location problems found in the literature. 相似文献
77.
Pietro Belotti Martine Labbé Francesco Maffioli Malick M. Ndiaye 《4OR: A Quarterly Journal of Operations Research》2007,5(4):299-314
The obnoxious p-median (OpM) problem is the repulsive counterpart of the ore known attractive p-median problem. Given a set I of cities and a set J of possible locations for obnoxious plants, a p-cardinality subset Q of J is sought, such that the sum of the distances between each city of I and the nearest obnoxious site in Q is maximised. We formulate (OpM) as a {0,1} linear programming problem and propose three families of valid inequalities whose separation problem is polynomial.
We describe a branch-and-cut approach based on these inequalities and apply it to a set of instances found in the location
literature. The computational results presented show the effectiveness of these inequalities for (OpM).
The work of the first author has been partially supported by the Coordinated Project C.A.M.P.O. and that of the third author
by a short mobility grant, both of the Italian National Research Council. 相似文献
78.
A location is sought within some convex region of the plane for the central site of some public service to a finite number
of demand points. The parametric maxcovering problem consists in finding for eachR>0 the point from which the total weight of the demand points within distanceR is maximal. The parametric minimal quantile problem asks for each percentage α the point minimising the distance necessary
for covering demand points of total weight at least α. We investigate the properties of these two closely related problems
and derive polynomial algorithms to solve them both in case of either (possibly inflated) Euclidean or polyhedral distances.
The research of the first author is partially supported by Grant PB96-1416-C02-02 of Ministerio de Educación y Cultura, Spain. 相似文献
79.
本文主要考虑如下实际问题:假设选址决策者需要建设p个设施,但是由于资金等等的影响,实际建设时会被要求先建设q个设施,其次再建设p-q个设施(设p>q),同时要求,在建设p-q个设施的时候,已经建设好的q个设施不被删除。本文建立了一个两阶段优化问题,问题的输出是两个待修建的设施的集合Fq,Fp,|Fp|=p,|Fq|=q,且Fq是Fp的子集,问题的目标是最小化这两个设施集合的费用同对应的最优费用的比值的最大值。本文给出一个近似比为9的近似算法,并对一些特殊的情况进行了讨论。所得结论对实际的选址决策具有理论意义,同时也完善已有相关研究结果。 相似文献
80.
Recently, several successful applications of strong cutting plane methods to combinatorial optimization problems have renewed interest in cutting plane methods, and polyhedral characterizations, of integer programming problems. In this paper, we investigate the polyhedral structure of the capacitated plant location problem. Our purpose is to identify facets and valid inequalities for a wide range of capacitated fixed charge problems that contain this prototype problem as a substructure.The first part of the paper introduces a family of facets for a version of the capacitated plant location problem with a constant capacity for all plants. These facet inequalities depend on the capacity and thus differ fundamentally from the valid inequalities for the uncapacited version of the problem.We also introduce a second formulation for a model with indivisible customer demand and show that it is equivalent to a vertex packing problem on a derived graph. We identify facets and valid inequalities for this version of the problem by applying known results for the vertex packing polytope.This research was partially supported by Grant # ECS-8316224 from the National Science Foundation's Program in Systems Theory and Operations Research. 相似文献