The Efficiency of an Algorithm of Integer Programming: A Probabilistic Analysis

DOI10.2307/2042390zbMath0456.90054OpenAlexW4247951352MaRDI QIDQ3905066

Vladimir Lifschitz

Publication date: 1980

Full work available at URL: https://doi.org/10.2307/2042390

zbMATH Keywords

probabilistic analysisalgorithmic analysisaverage computing timeestimation of computation timesimple knapsack algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Boolean programming (90C09)

Related Items (3)

To Vladimir Lifschitz on His 65th Birthday ⋮ The number of increasing subsequences of the random permutation ⋮ A note on the complexity of a partition algorithm

Cites Work

• Estimating the Efficiency of Backtrack Programs
• Computing Partitions with Applications to the Knapsack Problem
• Unnamed Item

This page was built for publication: The Efficiency of an Algorithm of Integer Programming: A Probabilistic Analysis