Lagrangian relaxations for multiple network alignment
From MaRDI portal
Recommendations
Cites work
- A Lagrangian relaxation approach for the multiple sequence alignment problem
- Emergence of Scaling in Random Networks
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- Heuristics for the fixed cost median problem
- scientific article; zbMATH DE number 1839431 (Why is no real title available?)
- scientific article; zbMATH DE number 2110454 (Why is no real title available?)
- Natalie 2.0: sparse global network alignment as a special case of quadratic assignment
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
Cited in
(7)- Natalie 2.0: sparse global network alignment as a special case of quadratic assignment
- A Lagrangian Relaxation Approach for the Multiple Sequence Alignment Problem
- Scalable algorithms for multiple network alignment
- ELRUNA: elimination rule-based network alignment
- Maximum common subgraph based social network alignment method
- Simultaneous optimization of both node and edge conservation in network alignment via WAVE
- scientific article; zbMATH DE number 6304438 (Why is no real title available?)
This page was built for publication: Lagrangian relaxations for multiple network alignment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1741341)