An O(n log n)-algorithm for solving a special class of linear programs

DOI10.1007/BF02243226zbMath0723.65038OpenAlexW2600749932MaRDI QIDQ756930

Wolfgang W. Bein, Peter Brucker

Publication date: 1989

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02243226

zbMATH Keywords

treelinear programmingnetwork flows

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Linear programming (90C05)

Cites Work

• An efficient algorithm for solving a special class of LP's
• An algorithm for solving a structured class of linear programming problems
• Self-adjusting binary search trees
• Unnamed Item

This page was built for publication: An O(n log n)-algorithm for solving a special class of linear programs