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

scientific article; zbMATH DE number 808811

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

zbMath0841.90097MaRDI QIDQ4852860

Nikolaj Nikolaevich Kuzyurin

Publication date: 17 March 1996


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

polynomial-time algorithmsmultidimensional knapsack problem


Mathematics Subject Classification ID

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


Related Items (4)

Polynomial algorithms for finding the asymptotically optimum plan of the multiindex axial assignment problem ⋮ Generalization of the subset sum problem and cubic forms ⋮ Estimation of the number of iterations in integer programming algorithms using the regular partitions method ⋮ Asymptotic optimality of a transport-problem plan constructed by the minimum-element method




This page was built for publication:

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