Short paths for the simplex algorithm
Published in Digitalen Hochschulbibliothek Sachsen-Anhalt (Universitäts- und Landesbibliothek Sachsen-Anhalt) • Jan 1, 2025
NobleIDNI2P05W31R99S15
Authors:
Kirill Kukharenko
Abstract
The simplex algorithm is one of the most popular and widely used algorithms for solving linear programming problems. Although being very efficient in practice, no version of the simplex was ever proven to be a polynomial time algorithm from the theoretical prospective, in contrast to its main compet...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!