Finding optimal control policy in probabilistic Boolean Networks with hard constraints by using integer programming and dynamic programming.
Xi ChenTatsuya AkutsuTakeyuki TamuraWai-Ki ChingPublished in: Int. J. Data Min. Bioinform. (2013)
Keyphrases
- integer programming
- finding optimal
- hard constraints
- control policy
- boolean networks
- dynamic programming
- linear programming
- soft constraints
- constraint satisfaction problems
- constraint programming
- reinforcement learning
- long run
- np hard
- constraint satisfaction
- cost function
- average cost
- efficient computation
- logic programs
- graph cuts
- gene regulatory networks
- bayesian networks
- multi criteria
- biological systems
- linear program
- optimal policy
- infinite horizon
- probabilistic model
- knapsack problem
- optimal control
- constraint propagation
- state space
- search space
- genetic algorithm
- feasible solution
- optimal solution
- computational complexity
- penalty function
- graphical models
- multistage