An O(n log n)-algorithm for solving a special class of linear programs
From MaRDI portal
Publication:756930
DOI10.1007/BF02243226zbMATH Open0723.65038OpenAlexW2600749932MaRDI QIDQ756930FDOQ756930
Authors: 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
Recommendations
- An efficient algorithm for solving a special class of LP's
- An algorithm for solving a structured class of linear programming problems
- An \(O(n^ 2)\) simplex algorithm for a class of linear programs with tree structure
- scientific article; zbMATH DE number 4016589
- An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations
Numerical mathematical programming methods (65K05) Linear programming (90C05) Programming involving graphs or networks (90C35)
Cites Work
Cited In (8)
- Solving related two- and three-dimensional linear programming problems in logarithmic time
- A decision procedure for linear ``big O equations
- An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations
- An efficient algorithm for solving a special class of LP's
- An algorithm for solving a structured class of linear programming problems
- A Deterministic ${\operatorname{Poly}}(\log \log N)$-TimeN-Processor Algorithm for Linear Programming in Fixed Dimension
- A discrete EOQ problem is solvable in \(O(\log n)\) time
- An \(O(n^ 2)\) simplex algorithm for a class of linear programs with tree structure
This page was built for publication: An O(n log n)-algorithm for solving a special class of linear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q756930)
