全文获取类型
收费全文 | 150篇 |
免费 | 2篇 |
国内免费 | 1篇 |
专业分类
管理学 | 75篇 |
人口学 | 1篇 |
丛书文集 | 3篇 |
综合类 | 45篇 |
统计学 | 29篇 |
出版年
2024年 | 1篇 |
2022年 | 6篇 |
2021年 | 3篇 |
2020年 | 2篇 |
2019年 | 1篇 |
2017年 | 6篇 |
2016年 | 6篇 |
2015年 | 6篇 |
2014年 | 7篇 |
2013年 | 14篇 |
2012年 | 8篇 |
2011年 | 7篇 |
2010年 | 4篇 |
2009年 | 8篇 |
2008年 | 8篇 |
2007年 | 6篇 |
2006年 | 5篇 |
2005年 | 8篇 |
2004年 | 9篇 |
2003年 | 7篇 |
2002年 | 7篇 |
2001年 | 3篇 |
2000年 | 7篇 |
1998年 | 2篇 |
1997年 | 4篇 |
1995年 | 2篇 |
1994年 | 1篇 |
1993年 | 1篇 |
1992年 | 1篇 |
1991年 | 1篇 |
1989年 | 1篇 |
1985年 | 1篇 |
排序方式: 共有153条查询结果,搜索用时 46 毫秒
101.
The problem of optimum allocation in stratified sampling and its solution is well known in sampling literature for univariate populations (see Cochran, 1977; Sukhatme et al., 1984). In multivariate populations where more than one characteristics are to be studied on every selected unit of the population the problem of finding an optimum allocation becomes more complex due to conflicting behaviour of characteristics. Various authors such as Dalenius (1953, 1957), Ghosh (1958), Yates (1960), Aoyama (1963), Gren (1964, 1966), Folks and Antle (1965), Hartley (1965), Kokan and Khan (1967), Chatterjee (1972), Ahsan and Khan (1977, 1982), Chromy (1987), Wywial (1988), Bethel (1989), Kreienbrock (1993), Jahan et al. (1994), Khan et al. (1997), Khan et al. (2003), Ahsan et al. (2005), Díaz-García and Ulloa (2006, 2008), Ahsan et al. (2009) etc. used different compromise criteria to work out a compromise allocation that is optimum for all characteristics in some sense. Almost all the previous authors used some function of the sampling variances of the estimators of various characteristics to be measured as an objective that is to be minimized for a fixed cost given as a linear function of sample allocations. Because the variances are not unit free it is more logical to consider the minimization of some function of squared coefficient of variations as an objective. Previously this concept was used by Kozok (2006). Furthermore, investigators have to approach the sampled units in order to get the observations. This involves some travel cost. Usually this cost is neglected while constructing a cost function. This travel cost may be significant in some surveys. For example if the strata consist of some geographically difficult-to-approach areas. The authors problem of optimum allocation in multivariate stratified sampling is discussed with an objective to minimize simultaneously the coefficients of variation of the estimators of various characteristics under a cost constraint that includes the measurement as well as travel cost. The formulated problem of obtaining an optimum compromise allocation turns out to be a multiobjective all-integer nonlinear programming problem. Three different approaches are considered: the value function approach, ∈ –constraint method, and Distance–based method, to obtain compromise allocations. The cost function considered also includes the travel cost within stratum to reach the selected units. Additional restrictions are placed on the sample sizes to avoid oversampling and ensure the availability of the estimates of the strata variances. Numerical examples are also presented to illustrate the computational details of the proposed methods. 相似文献
102.
给出了一种在具有单字节乘除机器指令的单片机上进行任意字节整数开方的快速算法。与传统的算法相比,它完全避免了除法的迭代,从而开方速度提高了大约一倍左右。 相似文献
103.
A discrete location problem is formulated for the design of a postal service network. The cost objective of this problem includes a nonlinear concave component. A parametric integer programming algorithm is developed to find an approximate solution to the problem. The algorithm reduces the problem into a sequence of p-median problems and deals with the nonlinear cost by a node-replacement scheme. Preliminary computational results are presented. 相似文献
104.
基于实物期权的项目组合投资决策研究 总被引:5,自引:3,他引:5
基于项目投资决策的可延迟性特征,将实物期权的决策灵活性思想引入到企业的投资组合决策中,建立了基于实物期权的0-1整数规划模型.模型以项目的期权价值最大化作为投资组合项目选择的标准,通过项目组合投资时机的灵活安排,实现了项目组合的总投资价值最大化. 相似文献
105.
106.
p代指选择问前小句,q代指是非问后小句,“p q”代表“选择问 是非问”构成的选择问句。文章试图对“p q”选择问句存在的纠结加以论述。指出:连接词是“还是”时,两小句偏向合取态势,有时也用蕴含“还是”的“或者”,两小句倾向于是复句的分句。当两个句子呈析取态势时,偏向用“或者”,几乎不用“还是”,两小句倾向于是句群的组成部分。复句和句群之间大多可以转换,并有着不同的主观视点和不同的心理特征。 相似文献
107.
一类可分离非线性混合整规划的填充函数解法 总被引:1,自引:1,他引:0
讨论了把一类可分离非线性混合整规划问题转化为解一系列非线性规划 ,整数规划 ,再构造填充函数求解的方法 ,在理论上解决了这类非线性混合整规划问题 相似文献
108.
Supplier selection is a multi-criteria problem which includes both tangible and intangible factors. In these problems if suppliers have capacity or other different constraints two problems will exist: which suppliers are the best and how much should be purchased from each selected supplier? In this paper an integrated approach of analytic network process (ANP) and multi-objective mixed integer linear programming (MOMILP) is proposed. This integrated approach considers both tangible and intangible factors in choosing the best suppliers and defines the optimum quantities among selected suppliers to maximize the total value of purchasing (TVP), and to minimize the total cost and total defect rate and to balance the total cost among periods. The priorities are calculated for each supplier by using ANP. Four different plastic molding firms working with a refrigerator plant are evaluated according to 14 criteria that are involved in the four clusters: benefits, opportunities, costs and risks (BOCR). The priorities of suppliers will also be used as the parameters of the first objective function. This multi-objective and multi-period real-life problem is solved by using previous techniques and a reservation level driven Tchebycheff procedure (RLTP). Finally the most preferred nondominated solutions are determined by considering the decision maker's (DM's) preferences and the results obtained by these techniques are compared. 相似文献
109.
Markus Behle 《Journal of Combinatorial Optimization》2008,16(2):107-118
Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure
of these problems raises the following tasks: count or enumerate the feasible solutions and find an optimal solution according
to a given linear objective function. All these tasks can be accomplished using binary decision diagrams (BDDs), a very popular
and effective datastructure in computational logics and hardware verification.
We present a novel approach for these tasks which consists of an output-sensitive algorithm for building a BDD for a linear constraint (a so-called threshold BDD) and a parallel AND operation on threshold BDDs. In particular our algorithm is capable of solving knapsack problems, subset sum problems
and multidimensional knapsack problems.
BDDs are represented as a directed acyclic graph. The size of a BDD is the number of nodes of its graph. It heavily depends
on the chosen variable ordering. Finding the optimal variable ordering is an NP-hard problem. We derive a 0/1 IP for finding
an optimal variable ordering of a threshold BDD. This 0/1 IP formulation provides the basis for the computation of the variable
ordering spectrum of a threshold function.
We introduce our new tool azove 2.0 as an enhancement to azove 1.1 which is a tool for counting and enumerating 0/1 points. Computational results on benchmarks from the literature show the
strength of our new method. 相似文献
110.
在城市群交通一体化迅速发展的大背景下,本文针对城际铁路的运输能力计算问题提出一种与之相适应的计算模型。首先,文章在分析城际铁路运营特点基础上,基于整数线性规划建立计算模型,该模型利用平均最小间隔时间法中将两列相邻的列车组合为运行列车组作为运行图结构单元的思想来计算列车占用运行图总时间,并以最大化运行列车组总数为目标函数,以规定列车占用运行图总时间的有效时间范围为约束条件。最后,文章通过京津城际实际数据算例,验证了文章所提计算模型相较于传统计算方法更切合城际铁路运营实际。该模型大幅简化了城际铁路线路运输能力的计算步骤,提高了计算效率,能够助力于改善城际铁路运输能力及其运营服务水平。 相似文献