Solving Totally Unimodular LPs with the Shadow Vertex Algorithm
From MaRDI portal
Publication:2954993
DOI10.4230/LIPIcs.STACS.2015.171zbMath1355.68114arXiv1412.5381OpenAlexW2963440986MaRDI QIDQ2954993
Heiko Röglin, Anna Großwendt, Tobias Brunsch
Publication date: 24 January 2017
Full work available at URL: https://arxiv.org/abs/1412.5381
Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Linear programming (90C05)
Related Items (3)
Geometric random edge ⋮ The smoothed complexity of Frank-Wolfe methods via conditioning of random matrices and polytopes ⋮ A Friendly Smoothed Analysis of the Simplex Method
This page was built for publication: Solving Totally Unimodular LPs with the Shadow Vertex Algorithm
