On estimates of the complexity of numerical characteristics of postoptimality analysis for discrete optimization problems

Author： Mikhailyuk V.  

Publisher： Springer Publishing Company

ISSN： 1060-0396

Source： Cybernetics and Systems Analysis, Vol.46, Iss.5, 2010-09, pp. : 807-812

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A Post-Optimality Analysis Algorithm for Multi-Objective Optimization

By Venkat Vandana   Jacobson Sheldon H.   Stori James A.  

Computational Optimization and Applications, Vol. 28, Iss. 3, 2004-09 ,pp. : 357-372

Springer Publishing Company

Access to resources Recommend Favorite

Multiheuristic approach to discrete optimization problems

By Melnikov B.  

Cybernetics and Systems Analysis, Vol. 42, Iss. 3, 2006-05 ,pp. : 335-341

Springer Publishing Company

Access to resources Recommend Favorite

Optimization Parallelizing for Discrete Programming Problems

By Sergienko I. V.   Shilo V. P.   Roshchin V. A.  

Cybernetics and Systems Analysis, Vol. 40, Iss. 2, 2004-03 ,pp. : 184-189

Springer Publishing Company

Access to resources Recommend Favorite

On Intrinsic Complexity of Nash Equilibrium Problems and Bilevel Optimization

By Dorsch D.   Jongen H.   Shikhman V.  

Journal of Optimization Theory and Applications, Vol. 159, Iss. 3, 2013-12 ,pp. : 606-634

Springer Publishing Company

Access to resources Recommend Favorite

On the complexity of some data analysis problems

By Kel'manov A.  

Computational Mathematics and Mathematical Physics, Vol. 50, Iss. 11, 2010-11 ,pp. : 1941-1947

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite