Bilevel integer programming on a Boolean network for discovering critical genetic alterations in cancer development and therapy
From MaRDI portal
(Redirected from Publication:2116889)
Recommendations
- Algorithms for Inference, Analysis and Control of Boolean Networks
- Algorithms for analysis, inference, and control of Boolean networks
- An integer programming approach to optimal control problems in context-sensitive probabilistic Boolean networks
- Control of Boolean networks: hardness results and algorithms for tree structured networks
- CONTROL OF STATIONARY BEHAVIOR IN PROBABILISTIC BOOLEAN NETWORKS BY MEANS OF STRUCTURAL INTERVENTION
Cites work
- scientific article; zbMATH DE number 1303613 (Why is no real title available?)
- A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation
- A new general-purpose algorithm for mixed-integer bilevel linear programs
- A survey on mixed-integer programming techniques in bilevel optimization
- Algorithms and applications for a class of bilevel MILPs
- An enhanced branch-and-bound algorithm for bilevel integer linear programming
- An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions
- Dynamically consistent reduction of logical regulatory graphs
- Enhanced exact algorithms for discrete bilevel linear problems
- Integer Linear Programming in Computational and Systems Biology
- Intersection cuts for bilevel optimization
- Learning Boolean logic models of signaling networks with ASP
- Links between linear bilevel and mixed 0-1 programming problems
- Logic and integer programming
- Mapping multivalued onto Boolean dynamics
- Minimal intervention strategies in logical signaling networks with ASP
- Modeling, inference and optimization of regulatory networks based on time series data
- Number of fixed points and disjoint cycles in monotone Boolean networks
- On the use of intersection cuts for bilevel optimization
- Reduction of Boolean network models
- The Mixed Integer Linear Bilevel Programming Problem
- The Watermelon Algorithm for The Bilevel Integer Linear Programming Problem
Cited in
(4)- Abduction based drug target discovery using Boolean control network
- Approximation algorithms for connected maximum coverage problem for the discovery of mutated driver pathways in cancer
- Tackling universal properties of minimal trap spaces of Boolean networks
- Computational complexity of minimal trap spaces in Boolean networks
This page was built for publication: Bilevel integer programming on a Boolean network for discovering critical genetic alterations in cancer development and therapy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2116889)
