Smoothed analysis of integer programming
From MaRDI portal
Publication:877191
DOI10.1007/s10107-006-0055-7zbMath1111.90077MaRDI QIDQ877191
Heiko Röglin, Berthold Vöcking
Publication date: 19 April 2007
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-006-0055-7
68Q25: Analysis of algorithms and problem complexity
90C10: Integer programming
90C27: Combinatorial optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Average saving effects in enumerative methods for solving knapsack problems
- An experimental study of random knapsack problems
- Smoothed analysis of algorithms
- Probabilistic Analysis of the Multidimensional Knapsack Problem
- Average-Case Analysis of Off-Line and On-Line Knapsack Problems
- Mathematical Foundations of Computer Science 2003
- Typical Properties of Winners and Losers [0.2ex in Discrete Optimization]
- Algorithms and Computation
- Algorithms and Computation
- Random knapsack in expected polynomial time