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: BIBM (2010)
Keyphrases
- integer programming
- finding optimal
- hard constraints
- control policy
- boolean networks
- dynamic programming
- linear programming
- soft constraints
- constraint programming
- reinforcement learning
- constraint satisfaction problems
- long run
- constraint satisfaction
- np hard
- cost function
- probabilistic model
- graph cuts
- logic programs
- efficient computation
- search space
- average cost
- multi criteria
- gene regulatory networks
- optimal policy
- state space
- infinite horizon
- bayesian networks
- biological systems
- feasible solution
- neural network
- optimal control
- decision makers
- linear program
- computational complexity
- multistage