全文获取类型
收费全文 | 311篇 |
免费 | 2篇 |
国内免费 | 3篇 |
专业分类
化学 | 6篇 |
数学 | 259篇 |
物理学 | 51篇 |
出版年
2023年 | 2篇 |
2022年 | 1篇 |
2021年 | 2篇 |
2020年 | 3篇 |
2019年 | 4篇 |
2018年 | 6篇 |
2017年 | 1篇 |
2015年 | 9篇 |
2014年 | 26篇 |
2013年 | 23篇 |
2012年 | 29篇 |
2011年 | 18篇 |
2010年 | 25篇 |
2009年 | 39篇 |
2008年 | 29篇 |
2007年 | 31篇 |
2006年 | 10篇 |
2005年 | 6篇 |
2004年 | 7篇 |
2003年 | 6篇 |
2002年 | 4篇 |
2001年 | 2篇 |
2000年 | 5篇 |
1999年 | 4篇 |
1998年 | 3篇 |
1997年 | 2篇 |
1996年 | 2篇 |
1995年 | 1篇 |
1994年 | 1篇 |
1993年 | 2篇 |
1992年 | 1篇 |
1989年 | 1篇 |
1988年 | 1篇 |
1987年 | 1篇 |
1985年 | 1篇 |
1984年 | 1篇 |
1983年 | 1篇 |
1982年 | 1篇 |
1979年 | 1篇 |
1978年 | 2篇 |
1977年 | 2篇 |
排序方式: 共有316条查询结果,搜索用时 18 毫秒
1.
随机交通均衡配流模型及其等价的变分不等式问题 总被引:7,自引:0,他引:7
本文讨论了交通网络系统的随机用户均衡原理的数学表述问题.在路段出行成本是流量的单调函数的较弱条件下,对具有固定需求和弹性需求的模式,首次证明了随机均衡配流模型可表示为一个变分不等式问题,同时也说明了该变分不等式问题与相应的互补问题以及一个凸规划问题之间的等价关系. 相似文献
2.
Li-ming Wu~ Zheng-liang Zhang~ Laboratoire de Mathématiques Appliquées.CNRS-UMR Université Blaise Pascal Aubière France 《应用数学学报(英文版)》2004,(3)
Using the method of Girsanov transformation,we establish the Talagrand's T_2-inequality for dif-fusion on the path space C([0,N],R~d) with respect to a uniform metric,with the constant independent of N.This improves the known results for the L~2-metric. 相似文献
3.
Peter Francis Guangming Zhang Karen Smilowitz 《European Journal of Operational Research》2007,180(3):1045-1059
This paper presents modeling and solution method improvements for the Multi-Resource Routing Problem (MRRP) with flexible tasks. The MRRP with flexible tasks is used to model routing and scheduling problems for intermodal drayage operations in which two resources (tractors and trailers) perform tasks to transport loaded and empty equipment. Tasks may be either well defined, in which both the origin and the destination of a movement are given, or flexible, in which the origin or the destination is chosen by the model. This paper proposes methods to effectively manage the number of options considered for flexible tasks (either feasible origins for a known destination or feasible destinations for a known origin). This modeling change generates sufficient options to allow for low-cost solutions while maintaining reasonable computational effort. We also propose a new solution method that uses randomized route generation. Computational results from test cases show that these changes improve the quality of solutions by at least 5% in the test cases as compared to methods from previous studies. 相似文献
4.
The purpose of this paper is to present a new primal extreme point algorithm for solving assignment problems which both circumvents and exploits degeneracy. The algorithm is based on the observation that the degeneracy difficulties of the simplex method result from the unnecessary inspection of alternative basis representations of the extreme points. This paper characterizes a subsetQ of all bases that are capable of leading to an optimal solution to the problem if one exists. Using this characterization, an extreme point algorithm is developed which considers only those bases inQ. Computational results disclose that the new algorithm is substantially more efficient than previously developed primal and primal-dual extreme point (simplex) methods for assignment problems. 相似文献
5.
A primal transportation algorithm is devised via post-optimization on the costs of a modified problem. The procedure involves altering the costs corresponding to the basic cells of the initial (primal feasible) solution so that it is dual feasible as well. The altered costs are then successively restored to their true values with appropriate changes in the optimal solution by the application of cell or area cost operators discussed elsewhere. The cell cost operator algorithm converges to optimum within (2T – 1) steps for primal nondegenerate transportation problems and [(2T + 1) min (m, n)] – 1 steps for primal degenerate transportation problems, whereT is the sum of the (integer) warehouse availabilities (also the sum of the (integer) market requirements) andm andn denote the number of warehouses and markets respectively. For the area cost operator algorithm the corresponding bounds on the number of steps areT and (T + 1) min (m, n) respectively.This report was prepared as part of the activities of the Management Sciences Research Group, Carnegie—Mellon University, under Contract N00014-67-A-0314-0007 NR 047-048 with the U.S. Office of Naval Research. 相似文献
6.
Deshabrata Roy Mahapatra Sankar Kumar Roy Mahendra Prasad Biswal 《Applied Mathematical Modelling》2013
In this paper a multi choice stochastic transportation problem is considered where the supply and demand parameters of the constraints follow extreme value distribution. Some of the cost coefficients of the objective function are multi-choice type. At first all the probabilistic constraints are transformed into deterministic constraints. Further using the binary variables, multi-choice type cost coefficients are handled. Then the transformed problem is considered as a deterministic multi-choice transportation problem. Finally, a numerical example is presented to illustrate the solution procedure. 相似文献
7.
Antonio Domnech 《Physica A》2009,388(21):4658-4668
Fractal and small-worlds scaling laws are applied to study the growth of urban railway transportation networks using total length and total population as observational parameters. In spite of the variety of populations and urban structures, the variation of the total length of the railway network with the total population of conurbations follows similar patterns for large and middle metropolis. Diachronous analysis of data for urban transportation networks suggests that there is second-order phase transition from small-worlds behaviour to fractal scaling during their early stages of development. 相似文献
8.
Li-mingWu Zheng-liangZhang 《应用数学学报(英文版)》2004,20(3):357-364
Using the method of Girsanov transformation, we establish the Talagrand‘s T2-inequality for diffusion on the path space C([0, N], R^d) with respect to a uniform metric, with the constant independent of N. This improves the known results for the L2-metric. 相似文献
9.
We study a hybrid transportation system referred to as mobility allowance shuttle transit (MAST) where vehicles may deviate from a fixed path consisting of a few mandatory checkpoints to serve demand distributed within a proper service area. In this paper we propose a mixed integer programming (MIP) formulation for the static scheduling problem of a MAST type system. Since the problem is NP-Hard, we develop sets of logic cuts, by using reasonable assumptions on passengers’ behavior. The purpose of these constraints is to speed up the search for optimality by removing inefficient solutions from the original feasible region. Experiments show the effectiveness of the developed inequalities, achieving a reduction up to 90% of the CPU solving time for some of the instances. 相似文献
10.
Gabriel Gutiérrez-Jarpa Guy Desaulniers Gilbert Laporte Vladimir Marianov 《European Journal of Operational Research》2010
In the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows, the set of customers is the union of delivery customers and pickup customers. A fleet of identical capacitated vehicles based at the depot must perform all deliveries and profitable pickups while respecting time windows. The objective is to minimize routing costs, minus the revenue associated with the pickups. Five variants of the problem are considered according to the order imposed on deliveries and pickups. An exact branch-and-price algorithm is developed for the problem. Computational results are reported for instances containing up to 100 customers. 相似文献