Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Einige Erläuterungen zum Khacian-Verfahren

From MaRDI portal
Publication:3920987
Jump to:navigation, search

DOI10.1007/BF01919279zbMath0467.90044OpenAlexW2050801440MaRDI QIDQ3920987

No author found.

Publication date: 1981

Published in: Zeitschrift für Operations Research (Search for Journal in Brave)

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


zbMATH Keywords

convergenceellipsoid algorithmdualitypolynomial-time algorithmcomputational aspectsKhachiyan algorithm


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Linear programming (90C05)


Related Items (2)

Complexity investigations on the ellipsoid algorithm ⋮ Khachiyan's Algorithmus



Cites Work

  • A new linear programming algorithm - better or worse than the simplex method?
  • Unnamed Item
  • Unnamed Item


This page was built for publication: Einige Erläuterungen zum Khacian-Verfahren

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3920987&oldid=17591287"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 5 February 2024, at 22:34.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki