Smoothed Analysis of Integer Programming

DOI10.1007/11496915_21MaRDI QIDQ3596340zbMATH OpenOpenAlexFDO

Authors Heiko Röglin, Berthold Vöcking

Publication date 30 August 2007

Published in Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11496915_21

Mathematics Subject Classification ID

Integer programming (90C10)

Recommendations

• Smoothed analysis of integer programming
• Smoothed analysis of termination of linear programming algorithms
• Smoothed analysis of condition numbers and complexity implications for linear programming
• scientific article; zbMATH DE number 2119754
• Smoothed analysis of algorithms

Cited in

(6)

• On the tractability of shortest path problems in weighted edge-coloured graphs
• Smoothed analysis of binary search trees
• Typical properties of winners and losers in discrete optimization
• Typical Properties of Winners and Losers [0.2ex] in Discrete Optimization
• Fundamentals of Computation Theory
• Smoothed analysis of integer programming

This page was built for publication: Smoothed Analysis of Integer Programming

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