scientific article; zbMATH DE number 4041263

MaRDI QIDQ3779741zbMATH OpenFDO

Authors Hajime Machida

Publication date 1987

zbMATH Keywords

complexityknapsack problemlower boundplane partitionssubset sum problemthree list problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99) Integer programming (90C10)

Recommendations

• scientific article; zbMATH DE number 4023019
• Least-cost partition algorithms
• An alternative to Ben-Or's lower bound for the knapsack problem complexity
• Upper and lower bounds for the complexity of the branch and bound method for the knapsack problem
• scientific article; zbMATH DE number 4031399

Cited in

(7)

• An $0 (n^3)$ worst case bounded special $LP$ knapsack $(0-1)$ with two constraints
• An alternative to Ben-Or's lower bound for the knapsack problem complexity
• scientific article; zbMATH DE number 4023019 (Why is no real title available?)
• A SHORT NOTE ON THE REDUCIBILITY OF THE COLLAPSING KNAPSACK PROBLEM
• scientific article; zbMATH DE number 3999287 (Why is no real title available?)
• scientific article; zbMATH DE number 2010046 (Why is no real title available?)
• Comment on 'Some computational results on real 0-1 knapsack problems'

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3779741)