Smoothed analysis of integer programming
type: Item
instance of: scholarly article
title: Smoothed analysis of integer programming
zbMATH Open document ID: 1111.90077
author: Heiko Röglin
author: Berthold Vöcking
published in: Mathematical Programming. Series A. Series B
publication date: 2007-04-19T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 5145051
zbMATH Keywords: Probabilistic analysis
zbMATH Keywords: Integer programming
MaRDI profile type: Publication
full work available at URL: s10107-006-0055-7
OpenAlex ID: W2170959740
cites work: Algorithms and Computation
cites work: Mathematical Foundations of Computer Science 2003
cites work: Q5501294
cites work: Random knapsack in expected polynomial time
cites work: An experimental study of random knapsack problems
cites work: Typical Properties of Winners and Losers [0.2ex] in Discrete Optimization
cites work: Average saving effects in enumerative methods for solving knapsack problems
cites work: Probabilistic Analysis of the Multidimensional Knapsack Problem
cites work: Q4198056
cites work: Average-Case Analysis of Off-Line and On-Line Knapsack Problems
cites work: Smoothed analysis of algorithms
DOI: 10.1007/S10107-006-0055-7
description: scientific article; zbMATH DE number 5145051