scientific article; zbMATH DE number 4005976

zbMATH Open0619.90048MaRDI QIDQ3757684FDOQ3757684

Authors: P. B. Milanov, Valentin E. Brimkov 

Publication date: 1987

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 3876925
• scientific article; zbMATH DE number 710573
• New pseudopolynomial complexity bounds for the bounded and other integer knapsack related problems
• scientific article; zbMATH DE number 729909
• scientific article; zbMATH DE number 3852791

zbMATH Keywords

knapsack problemNP-completenessupper boundpolynomial timeasymptotic optimality

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10)

Cited In (29)

• Title not available (Why is that?)
• The inverse-parametric knapsack problem
• An $0 (n^3)$ worst case bounded special $LP$ knapsack $(0-1)$ with two constraints
• On the approximation of an optimal solution to the integer knapsack problem by optimal solutions to the integer knapsack problem with a restriction on the cardinality
• The knapsack problem with forfeits
• Technical Note—Some Very Easy Knapsack/Partition Problems
• A note on the extension complexity of the knapsack polytope
• Solving the knapsack problem via \(\mathbb Z\)-transform
• On the existence of compact $\varepsilon$-approximated formulations for knapsack in the original space
• Analysis of the knapsack problem using L-partition
• Note on the knapsack Markov chain.
• On pleasant but not completely pleasant knapsack problems
• Title not available (Why is that?)
• The constrained compartmentalised knapsack problem
• Title not available (Why is that?)
• Improved lower and upper bounds for the number of feasible solutions to a knapsaek problem
• Title not available (Why is that?)
• Upper and lower bound results on the convex hull of integer points in polyhedra
• The 1-Neighbour Knapsack Problem
• On the effectivity of gradient methods for cutting stock problems
• On equivalent knapsack problems
• Gradient elements of the knapsack polytope
• New pseudopolynomial complexity bounds for the bounded and other integer knapsack related problems
• Title not available (Why is that?)
• The knapsack problem with a minimum filling constraint
• Title not available (Why is that?)
• A Knapsack Secretary Problem with Applications
• Adjacency of the 0-1 knapsack problem
• Threshold arrangements and the knapsack problem

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 Q3757684)