Erratum: A Sharp Upper Bound for the Expected Number of Shadow Vertices in LP-Polyhedra Under Orthogonal Projection on Two-Dimensional Planes

DOI10.1287/MOOR.24.4.925zbMath0977.90020OpenAlexW4240142617MaRDI QIDQ2757618

Karl Heinz Borgwardt

Publication date: 26 November 2001

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.24.4.925

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05) Random convex sets and integral geometry (aspects of convex geometry) (52A22)

Related Items (5)

Interior-point methods: Worst case and average case analysis of a phase-I algorithm and a termination procedure. ⋮ A Friendly Smoothed Analysis of the Simplex Method ⋮ The average number of pivot steps of the simplex-algorithm based on a generalized rotation-symmetry-model ⋮ On the probabilistic complexity of finding an approximate solution for linear programming ⋮ Moser's shadow problem

This page was built for publication: Erratum: A Sharp Upper Bound for the Expected Number of Shadow Vertices in LP-Polyhedra Under Orthogonal Projection on Two-Dimensional Planes