Average saving effects in enumerative methods for solving knapsack problems

DOI10.1006/JCOM.1994.1005zbMath0798.90106OpenAlexW1976355077MaRDI QIDQ1319356

Karl Heinz 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)

Related Items (2)

Smoothed analysis of integer programming ⋮ Random knapsack in expected polynomial time

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