Smoothed analysis of integer programming
- 5 January 2007
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 110 (1) , 21-56
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- An experimental study of random knapsack problemsAlgorithmica, 2006
- Typical Properties of Winners and Losers [0.2ex] in Discrete OptimizationSIAM Journal on Computing, 2006
- Decision Making Based on Approximate and Smoothed Pareto CurvesLecture Notes in Computer Science, 2005
- Smoothed Analysis of Binary Search TreesLecture Notes in Computer Science, 2005
- Random knapsack in expected polynomial timeJournal of Computer and System Sciences, 2004
- Smoothed analysis of algorithmsJournal of the ACM, 2004
- Smoothed Analysis of Three Combinatorial Problems2003
- Average-Case Analysis of Off-Line and On-Line Knapsack ProblemsJournal of Algorithms, 1998
- Average Saving Effects in Enumerative Methods for Solving Knapsack ProblemsJournal of Complexity, 1994
- Probabilistic Analysis of the Multidimensional Knapsack ProblemMathematics of Operations Research, 1989