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

Algorithms for solving a separable problem of discrete optimization

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

DOI10.1016/0041-5553(90)90069-5zbMath0738.90057OpenAlexW1969888635MaRDI QIDQ4713238

S. I. Sergeev

Publication date: 25 June 1992

Published in: USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0041-5553(90)90069-5


zbMATH Keywords

nonlinear separable integer programming


Mathematics Subject Classification ID

Integer programming (90C10) Nonlinear programming (90C30) Application models in control theory (93C95) Discrete-time control/observation systems (93C55) Computational methods for problems pertaining to operations research and mathematical programming (90-08)








This page was built for publication: Algorithms for solving a separable problem of discrete optimization

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