全文获取类型
收费全文 | 160篇 |
免费 | 6篇 |
国内免费 | 4篇 |
出版年
2023年 | 1篇 |
2021年 | 6篇 |
2020年 | 2篇 |
2019年 | 1篇 |
2018年 | 3篇 |
2017年 | 4篇 |
2016年 | 4篇 |
2015年 | 5篇 |
2014年 | 3篇 |
2013年 | 18篇 |
2012年 | 3篇 |
2011年 | 2篇 |
2010年 | 3篇 |
2009年 | 5篇 |
2008年 | 10篇 |
2007年 | 10篇 |
2006年 | 2篇 |
2005年 | 9篇 |
2004年 | 7篇 |
2003年 | 2篇 |
2002年 | 7篇 |
2001年 | 8篇 |
2000年 | 3篇 |
1999年 | 5篇 |
1998年 | 7篇 |
1997年 | 6篇 |
1996年 | 8篇 |
1995年 | 2篇 |
1994年 | 5篇 |
1993年 | 4篇 |
1992年 | 4篇 |
1989年 | 2篇 |
1985年 | 2篇 |
1983年 | 1篇 |
1982年 | 1篇 |
1978年 | 2篇 |
1976年 | 3篇 |
排序方式: 共有170条查询结果,搜索用时 31 毫秒
71.
Catania AC 《Journal of the experimental analysis of behavior》2002,77(3):327-345
During the years 1958-1962, the final years of support by the National Science Foundation for B. F. Skinner's Pigeon Lab in Memorial Hall at Harvard University, 20 or so pigeon experiments (plus some with other organisms) ran concurrently 7 days a week. The research style emphasized experimental analyses, exploratory procedures, and the parametric exploration of variables. This reminiscence describes some features of the laboratory, the context within which it operated, and the activities of some of those who participated in it. 相似文献
72.
73.
An evaluation of exact methods for the multiple subset maximum cardinality selection problem
下载免费PDF全文
![点击此处可从《The British journal of mathematical and statistical psychology》网站下载免费的PDF全文](/ch/ext_images/free.gif)
Michael J. Brusco Hans‐Friedrich Köhn Douglas Steinley 《The British journal of mathematical and statistical psychology》2016,69(2):194-213
The maximum cardinality subset selection problem requires finding the largest possible subset from a set of objects, such that one or more conditions are satisfied. An important extension of this problem is to extract multiple subsets, where the addition of one more object to a larger subset would always be preferred to increases in the size of one or more smaller subsets. We refer to this as the multiple subset maximum cardinality selection problem (MSMCSP). A recently published branch‐and‐bound algorithm solves the MSMCSP as a partitioning problem. Unfortunately, the computational requirement associated with the algorithm is often enormous, thus rendering the method infeasible from a practical standpoint. In this paper, we present an alternative approach that successively solves a series of binary integer linear programs to obtain a globally optimal solution to the MSMCSP. Computational comparisons of the methods using published similarity data for 45 food items reveal that the proposed sequential method is computationally far more efficient than the branch‐and‐bound approach. 相似文献
74.
Several programming models are introduced with the consideration of available unascertained information. In this case, the so‐called unascertained information is some numerical values whose ranges are known but their exact values are not. These models resolve several vital weaknesses of the traditional programming methods to a certain degree. Our study includes considerations of linear and non‐linear programming models with grey parameters, grey 0–1 programming, and satisfactory and quasi‐optimal solutions of grey linear programmings. Finally, some practical applications are given in order to test the applicability of our theory. Copyright © 1999 John Wiley & Sons, Ltd. 相似文献
75.
Art Warburton 《Journal of Multi-Criteria Decision Analysis》1998,7(6):330-339
This paper describes a new mathematical programming approach to sequential decision problems that have an underlying decision tree structure. The approach, based upon a characterization of strategies as extreme points of a 0–1 polytope called the ‘decision tree polytope’, is particularly suited to the direct examination of risk-return and other tradeoffs amongst strategies. However, it can also be used for conventional utility maximization if a utility function is available. Further, the approach requires no algorithmic development—it can be implemented using commercially available algebraic modeling software and can solve large problems. A related, and already known, approach can be used for some more general Markov decision problems. © 1998 John Wiley & Sons, Ltd. 相似文献
76.
Transfer pricing problems have been extensively researched by a number of scholars. It is well recognized that transfer pricing problems have a multiple-criteria (objectives) feature and can be formulated as a model of multiple-criteria linear programming. However, few methods have the capability of dealing with all possible optimal trade-offs of multiple criteria in optimal solutions of the models. In this paper a linear multiple-factor model is developed to provide managers with a more systematic and comprehensive scenario of all possible optimal transfer prices depending on both multiple criteria and multiple constraint levels. The trade-offs of all possible optimal transfer prices can be used as a basis for managers of a corporation to make a high-quality decision in selecting their transfer pricing systems for business competition. © 1998 John Wiley & Sons, Ltd. 相似文献
77.
R. RAMANATHAN 《Journal of Multi-Criteria Decision Analysis》1997,6(5):296-307
The main aim of this paper is to identify the opportunities of utilizing goal programming (GP) in the multiplicative analytic hierarchy process (MAHP). It starts with the issue of weight derivation from judgemental matrices. The use of GP for the weight derivation problem is not new, but GP is viewed in this paper from the perspective of augmenting the capabilities of the widely used row geometric mean method (RGMM) of the logarithmic least squares technique (LLST). Different possible approaches using GP are discussed. It is shown that the formulation of the GP problem can be easily modified to provide the same weights as those of the LLST. While this proposed GP technique is not superior to the RGMM in terms of computational ease or speed, it is quite useful in solving certain other problems of the MAHP, such as interval judgements and missing judgements, which cannot be readily solved by the RGMM. The proposed technique provides extensive scope for utilizing the vast literature on non-linear programming, say, for conducting sensitivity analysis. It also has the potential to be useful to more complicated issues of the MAHP, such as group decision making and interlevel dependence, hitherto little explored areas of the MAHP. © 1997 John Wiley & Sons, Ltd. 相似文献
78.
This paper shows that the satisficing trade-off method (STOM), one of the interactive multiobjective programming techniques, can be applied effectively to the formulation of livestock rations. Nutrient requirements are considered as soft constraints whose right-hand sides are flexible to some extent. This is easily done by regarding the values of the right-hand sides of the constraints as aspiration levels of the decision maker for objective functions. In this way a well-balanced solution can be obtained by STOM with automatic trade-off analysis. In STOM, moreover, because the objective functions and the constraint functions are interchangeable, decision makers are not required to consider the role of objective and constraint as fixed from the beginning. The authors’ experience is that the method makes ration formulation very easy, rapid and flexible. In addition, this paper shows how effectively STOM can be applied not only to diet planning but also to nutritional diagnosis. © 1997 by John Wiley & Sons, Ltd. J. Multi-Crit. Decis. Anal. 6 : 131–139 (1997) No. of Figures: 1. No. of Tables: 3. No. of References: 28. 相似文献
79.
80.
W.W. Cooper 《Journal of Multi-Criteria Decision Analysis》2005,13(1):3-11
Origins and uses of ‘goal programming’ and ‘data envelopment analysis’ (DEA) are identified and discussed. The purpose of this paper is not only to review some of the history of these developments, but also to show some of their uses (e.g. in statistical regression formulations) in order to suggest paths for possible further developments. Turning to how the two types of models relate to each other, the ‘additive model’ of DEA is shown to have the same structure as a goal programming model in which only ‘one‐sided deviations’ are permitted. A way for formally relating the two to each other is then provided. However, the objectives are differently oriented because goal programming is directed to future performances as part of the planning function whereas DEA is directed to evaluating past performances as part of the control function of management. Other possible ways of comparing and combining the two approaches are also noted including statistical regressions that utilize goal programming to ensure that the resulting estimates satisfy the multi‐criteria conditions that are often encountered in managerial applications. Both goal programming and DEA originated in actual applications that were successfully addressed. The research was then generalized and published. This leads to what is referred to as an ‘applications‐driven theory’ strategy for research that is also described in this paper. Copyright © 2006 John Wiley & Sons, Ltd. 相似文献