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

The ellipsoid algorithm using parallel cuts

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

DOI10.1007/BF01299543zbMath0802.90070OpenAlexW2005569165MaRDI QIDQ1315450

Michael J. Todd, Aiping Liao

Publication date: 12 December 1994

Published in: Computational Optimization and Applications (Search for Journal in Brave)

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


zbMATH Keywords

ellipsoid algorithmparallel cuts


Mathematics Subject Classification ID

Linear programming (90C05)




Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • The ellipsoid method and its consequences in combinatorial optimization
  • The Ellipsoid Method Generates Dual Variables
  • Polynomial algorithms in linear programming
  • Solving LP Problems via Weighted Centers
  • On Minimum Volume Ellipsoids Containing Part of a Given Ellipsoid
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1315450&oldid=13430079"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 12:57.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki