Finding Optimal Control Policy in Probabilistic Boolean Networks With Hard Constraints by Using Integer Programming and Dynamic Programming

doi 10.1109/bibm.2010.5706570
Full Text
Abstract

Available in full text

Date
Authors
Publisher

IEEE

Related search

Finding Optimal Control Policy in Probabilistic Boolean Networks With Hard Constraints by Using Integer Programming and Dynamic Programming

International Journal of Data Mining and Bioinformatics
Information SystemsGeneticsMolecular BiologyInformation SciencesBiochemistryLibrary
2013English

Optimal Instruction Scheduling Using Integer Programming

2000English

Optimal Control of Switched Continuous Systems Using Mixed-Integer Programming

IFAC Proceedings Volumes
2002English

Optimal Control and the Dynamic Programming Principle

2014English

clustering.sc.dp: Optimal Clustering With Sequential Constraint by Using Dynamic Programming

R Journal
UncertaintyNumerical AnalysisStatisticsProbability
2016English

Reconstructing Curvilinear Networks Using Path Classifiers and Integer Programming

IEEE Transactions on Pattern Analysis and Machine Intelligence
Pattern RecognitionApplied MathematicsComputer VisionMathematicsComputational TheoryArtificial IntelligenceSoftware
2016English

Dynamic Programming Approach for Discrete-Valued Time Discrete Optimal Control Problems With Dwell Time Constraints

IFIP Advances in Information and Communication Technology
Computer NetworksInformation SystemsManagementCommunications
2016English

On Handling Indicator Constraints in Mixed Integer Programming

Computational Optimization and Applications
ControlComputational MathematicsApplied MathematicsOptimization
2016English

An Adaptive Sequential Linear Programming Algorithm for Optimal Design Problems With Probabilistic Constraints

2005English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy