首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   11篇
  免费   2篇
管理学   3篇
人口学   1篇
理论方法论   4篇
社会学   5篇
  2022年   1篇
  2021年   1篇
  2019年   2篇
  2017年   2篇
  2016年   1篇
  2013年   1篇
  2012年   1篇
  2000年   1篇
  1998年   1篇
  1996年   1篇
  1995年   1篇
排序方式: 共有13条查询结果,搜索用时 0 毫秒
11.
12.
The author investigates emerging developments of social indicators through the experience of a health planning initiative begun in 1986 under the coordination of the World Health Organization (Europe). By 1993 over 400 municipalities in first world countries had voluntarily committed themselves to participation. The paper results from interviews and reviews of some participants' programs and materials, with significant reliance upon material from Canada and the coordinating WHO office. The author divides indicator development into political and technical components, stressing the former. He makes nine principal conclusions relating to indicators' success: (1) three stages of indicator development are understanding, consensus and commitment; (2) indicators must be grounded in target population's reality; (3) indicators are historical artifacts; (4) programs must be in place that make indicator need apparent; (5) process is product; (6) new skills must be supplied; (7) indicators are client-driven; (8) good process protects indicators' integrity from inappropriate influence; and (9) quality is a culturally-derived value defying aggregation.  相似文献   
13.

The 0-1 cubic knapsack problem (CKP), a generalization of the classical 0-1 quadratic knapsack problem, is an extremely challenging NP-hard combinatorial optimization problem. An effective exact solution strategy for the CKP is to reformulate the nonlinear problem into an equivalent linear form that can then be solved using a standard mixed-integer programming solver. We consider a classical linearization method and propose a variant of a more recent technique for linearizing 0-1 cubic programs applied to the CKP. Using a variable reordering strategy, we show how to improve the strength of the linear programming relaxation of our proposed reformulation, which ultimately leads to reduced overall solution times. In addition, we develop a simple heuristic method for obtaining good-quality CKP solutions that can be used to provide a warm start to the solver. Computational tests demonstrate the effectiveness of both our variable reordering strategy and heuristic method.

  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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