Constraint programming approaches for finding conserved metabolic and genomic patterns
From MaRDI portal
Cites work
- A branch-and-cut algorithm for the minimum branch vertices spanning tree problem
- A mixed integer linear formulation for the minimum label spanning tree problem
- Algorithmic aspects of heterogeneous biological networks comparison
- An efficient mixed integer linear programming model for the minimum spanning tree problem
- Combined column-and-row-generation for the optimal communication spanning tree problem
- Emergence of Scaling in Random Networks
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- scientific article; zbMATH DE number 4162307 (Why is no real title available?)
- Improved approaches to solve the one-to-one skewgram problem
- Introduction to algorithms.
- Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: complexity, properties and formulations
- On exact solution approaches for the longest induced path problem
- Scale-free networks: a decade and beyond
- Using separation algorithms to generate mixed integer model reformulations
This page was built for publication: Constraint programming approaches for finding conserved metabolic and genomic patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6891385)