An improved deterministic rescaling for linear programming algorithms
From MaRDI portal
Publication:2401165
DOI10.1007/978-3-319-59250-3_22zbMath1418.90152arXiv1612.04782OpenAlexW2567550261MaRDI QIDQ2401165
Rebecca Hoberg, Thomas Rothvoß
Publication date: 31 August 2017
Full work available at URL: https://arxiv.org/abs/1612.04782
Related Items (7)
Implementation of a projection and rescaling algorithm for second-order conic feasibility problems ⋮ Approximation and online algorithms for multidimensional bin packing: a survey ⋮ Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting) ⋮ Rescaling Algorithms for Linear Conic Feasibility ⋮ Geometric Rescaling Algorithms for Submodular Function Minimization ⋮ Computational performance of a projection and rescaling algorithm ⋮ Projection and Rescaling Algorithm for Finding Maximum Support Solutions to Polyhedral Conic Systems
This page was built for publication: An improved deterministic rescaling for linear programming algorithms