Average saving effects in enumerative methods for solving knapsack problems

DOI10.1006/JCOM.1994.1005MaRDI QIDQ1319356zbMATH OpenOpenAlexFDO

Authors K. H. Borgwardt, Jürgen Brzank

Publication date 12 April 1994

Published in Journal of Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jcom.1994.1005

zbMATH Keywords

probabilistic analysisbinary knapsack

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Boolean programming (90C09)

Recommendations

• scientific article; zbMATH DE number 3904330
• Probabilistic Analysis of the Multidimensional Knapsack Problem
• scientific article; zbMATH DE number 3878679
• Random knapsack in expected polynomial time
• scientific article; zbMATH DE number 3852791

Cited in

(5)

• Random knapsack in expected polynomial time
• Generating functions in the knapsack problem
• Algorithms – ESA 2004
• Smoothed analysis of integer programming
• Combinatorial properties of the bounded knapsack problem

This page was built for publication: Average saving effects in enumerative methods for solving knapsack problems

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