Finding optimal control policy in probabilistic Boolean Networks with hard constraints by using integer programming and dynamic programming

Author： Chen Xi

Publisher： Inderscience Publishers

ISSN： 1748-5673

Source： International Journal of Data Mining and Bioinformatics, Vol.7, Iss.3, 2013-04, pp. : 321-343

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 MIXED INTEGER DYNAMIC PROGRAMMING APPROACH TO A CLASS OF OPTIMAL CONTROL PROBLEMS IN HYBRID SYSTEMS

By Hadj-Alouane Nejib Ben Yeddes Moez Hadj-Alouane Atidel Lin Feng

Cybernetics and Systems, Vol. 37, Iss. 5, 2006-08 ,pp. : 481-504

Taylor & Francis Ltd

Access to resources Recommend Favorite

An Integer Programming Algorithm for Routing Optimization in IP Networks

By Bley Andreas

Algorithmica, Vol. 60, Iss. 1, 2011-05 ,pp. : 21-45

Springer Publishing Company

Access to resources Recommend Favorite

Optimal Base Station Positioning and Channel Assignment for 3G Mobile Networks by Integer Programming

By Mathar R. Schmeink M.

Annals of Operations Research, Vol. 107, Iss. 1-4, 2001-10 ,pp. : 225-236

Springer Publishing Company

Access to resources Recommend Favorite

Verification of bounded Petri nets using integer programming

By Khomenko Victor Koutny Maciej

Formal Methods in System Design, Vol. 30, Iss. 2, 2007-04 ,pp. : 143-176

Springer Publishing Company

Access to resources Recommend Favorite

CLIP3: Cover learning using integer programming

By Cios Krzysztof J Wedding Daniel K Liu Ning

Kybernetes: The International Journal of Systems & Cybernetics, Vol. 26, Iss. 5, 1997-05 ,pp. : 513-536

Emerald Group Publishing Ltd

Access to resources Recommend Favorite