首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   196篇
  免费   0篇
  196篇
  2023年   2篇
  2019年   2篇
  2018年   2篇
  2017年   5篇
  2016年   3篇
  2015年   2篇
  2014年   2篇
  2013年   46篇
  2011年   1篇
  2009年   3篇
  2008年   4篇
  2007年   2篇
  2006年   1篇
  2004年   4篇
  2003年   2篇
  2002年   6篇
  2001年   2篇
  2000年   2篇
  1999年   3篇
  1998年   3篇
  1997年   4篇
  1996年   3篇
  1995年   6篇
  1994年   5篇
  1993年   4篇
  1992年   5篇
  1991年   6篇
  1990年   5篇
  1989年   2篇
  1988年   3篇
  1987年   7篇
  1986年   4篇
  1985年   5篇
  1984年   2篇
  1983年   3篇
  1982年   4篇
  1981年   3篇
  1980年   3篇
  1978年   1篇
  1977年   1篇
  1976年   2篇
  1975年   2篇
  1974年   4篇
  1973年   3篇
  1972年   2篇
  1971年   1篇
  1970年   1篇
  1969年   3篇
  1968年   1篇
  1967年   2篇
排序方式: 共有196条查询结果,搜索用时 0 毫秒
81.
82.
83.
This article addresses bottleneck linear programming problems and in particular capacitated and constrained bottleneck transportation problems. A pseudopricing procedure based on the poly-ω procedure is used to facilitate the primal simplex procedure. This process allows the recent computational developments such as the Extended Threaded Index Method to be applied to bottleneck transportation problems. The impact on problem solution times is illustrated by computational testing and comparison with other current methods.  相似文献   
84.
We consider the problem of simultaneously locating any number of facilities in three-dimensional Euclidean space. The criterion to be satisfied is that of minimizing the total cost of some activity between the facilities to be located and any number of fixed locations. Any amount of activity may be present between any pair of the facilities themselves. The total cost is assumed to be a linear function of the inter-facility and facility-to-fixed locations distances. Since the total cost function for this problem is convex, a unique optimal solution exists. Certain discontinuities are shown to exist in the derivatives of the total cost function which previously has prevented the successful use of gradient computing methods for locating optimal solutions. This article demonstrates the use of a created function which possesses all the necessary properties for ensuring the convergence of first order gradient techniques and is itself uniformly convergent to the actual objective function. Use of the fitted function and the dual problem in the case of constrained problems enables solutions to be determined within any predetermined degree of accuracy. Some computation results are given for both constrained and unconstrained problems.  相似文献   
85.
A Study of War by Quincy Wright, Second edition. Chicago: University of Chicago Press, 1965, 1,637 pp.  相似文献   
86.
    
The assignment of personnel to teams is a fundamental managerial function typically involving several objectives and a variety of idiosyncratic practical constraints. Despite the prevalence of this task in practice, the process is seldom approached as an optimization problem over the reported preferences of all agents. This is due in part to the underlying computational complexity that occurs when intra-team interpersonal interactions are taken into consideration, and also due to game-theoretic considerations, when those taking part in the process are self-interested agents. Variants of this fundamental decision problem arise in a number of settings, including, for example, human resources and project management, military platooning, ride sharing, data clustering, and in assigning students to group projects. In this article, we study an analytical approach to “team formation” focused on the interplay between two of the most common objectives considered in the related literature: economic efficiency (i.e., the maximization of social welfare) and game-theoretic stability (e.g., finding a core solution when one exists). With a weighted objective across these two goals, the problem is modeled as a bi-level binary optimization problem, and transformed into a single-level, exponentially sized binary integer program. We then devise a branch-cut-and-price algorithm and demonstrate its efficacy through an extensive set of simulations, with favorable comparisons to other algorithms from the literature.  相似文献   
87.
88.
89.
90.
Postmodern terrorism presents a significant challenge to global security and law enforcement institutions. Non-state actors operating across international borders, engaged in an apparent global insurgency of extremism that transects the traditional boundaries of crime and war, pose significant challenges to both intelligence and law enforcement agencies. These networked global insurgents blend political and religious fanaticism with criminal enterprises to challenge the rule of law and pose an epochal shift in the structures and relations among states. Negotiating this epochal shift requires traditional organs of national security (the diplomatic, military and intelligence services) to forge new partnerships with police and public safety organizations at the state and local (sub-national), as well as transnational levels. Significant operational, policy and cultural challenges must be overcome to forge an effective multi-lateral global network to counter global terrorism and insurgency.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号