An \(O(n^ 2)\) simplex algorithm for a class of linear programs with tree structure

DOI10.1016/0377-2217(85)90034-7zbMath0588.90052OpenAlexW1995478410MaRDI QIDQ1073717

H. Schreck, Gottfried Tinhofer

Publication date: 1985

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(85)90034-7

zbMATH Keywords

simplex algorithmtree structure

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Linear programming (90C05)

Cites Work

• Algorithm 37. Algorithm for the solution of the 0-1 single Knapsack problem
• Rational solutions of the graphsack problem
• Optimal design of centralized computer networks
• Unnamed Item
• Unnamed Item

This page was built for publication: An \(O(n^ 2)\) simplex algorithm for a class of linear programs with tree structure