Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

An algorithm that is polynomial on the average in integer linear programming

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

zbMATH Open0876.90069MaRDI QIDQ1363304

N. N. Kuzyurin

Publication date: 1 December 1997

Published in: Doklady Mathematics (Search for Journal in Brave)




zbMATH Keywords

integer linear programming


Mathematics Subject Classification ID

Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Dynamic programming (90C39)



Related Items (1)

Average number of iterations of some polynomial interior-point -- algorithms for linear programming






This page was built for publication: An algorithm that is polynomial on the average in integer linear programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1363304)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1363304&oldid=13498771"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 31 January 2024, at 15:34.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki