SOME VERY EASY KNAPSACK PARTITION PROBLEMS

被引：2

|

作者：

ORLIN, JB

机构：

来源：

OPERATIONS RESEARCH | 1985年 / 33卷 / 05期

关键词：

D O I：

10.1287/opre.33.5.1154

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

收藏

页码：1154 / 1160

页数：7

相关论文

共 50 条

[1] Some extended knapsack problems involving job partition between two parties
Gu Y.
Chen Q.
Applied Mathematics-A Journal of Chinese Universities, 2007, 22 (3) : 366 - 370
[2] SOME EXTENDED KNAPSACK PROBLEMS INVOLVING JOB PARTITION BETWEEN TWO PARTIES
Gu Yanhong~1 Chen Quanle~2 1 Department of Applied Mathematics
Applied Mathematics:A Journal of Chinese Universities(Series B), 2007, (03) : 366 - 370
[3] Hard knapsack problems that are easy for local search
Ghosh, D
Chakravarti, N
ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 1999, 16 (02) : 165 - 172
[4] Some Easy and Some Not so Easy Geometric Optimization Problems
Woeginger, Gerhard J.
APPROXIMATION AND ONLINE ALGORITHMS (WAOA 2018), 2018, 11312 : 3 - 18
[5] Exact algorithm for concave knapsack problems: Linear underestimation and partition method
Sun, XL
Wang, FL
Li, D
JOURNAL OF GLOBAL OPTIMIZATION, 2005, 33 (01) : 15 - 30
[6] Exact Algorithm for Concave Knapsack Problems: Linear Underestimation and Partition Method
X. L. Sun
F. L. Wang
D. Li
Journal of Global Optimization, 2005, 33 : 15 - 30
[7] On the complexity of some partition problems
Andreeva, LN
Oranov, AM
JOURNAL OF COMPUTER AND SYSTEMS SCIENCES INTERNATIONAL, 1997, 36 (02) : 269 - 271
[8] Hard problems that quickly become very easy
Martin, Barnaby
Paulusma, Daniel
Smith, Siani
INFORMATION PROCESSING LETTERS, 2022, 174
[9] A TREE-SEARCH APPROACH TO THE M-PARTITION AND KNAPSACK-PROBLEMS
ALBANO, A
ORSINI, R
COMPUTER JOURNAL, 1980, 23 (03): : 256 - 261
[10] SOME THEORETICAL PROBLEMS IN PARTITION CHROMATOGRAPHY
丁景羣
朱葆琳
Science China Mathematics, 1963, (12) : 1829 - 1844

← 1 2 3 4 5 →