Lagrangian relaxations for multiple network alignment

DOI10.1007/s10618-017-0505-2zbMath1412.90029OpenAlexW2601638040MaRDI QIDQ1741341

Eric Malmi, Sanjay Chawla, Aristides Gionis

Publication date: 3 May 2019

Published in: Data Mining and Knowledge Discovery (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10618-017-0505-2

zbMATH Keywords

Lagrangian relaxationsocial networksfacility locationgenealogical treesmultiple network alignment

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Related Items (1)

Scalable Algorithms for Multiple Network Alignment

Uses Software

• Natalie
• IsoRank
• IsoRankN
• NetCoffee
• SMETANA

Cites Work

• Unnamed Item
• Unnamed Item
• A Lagrangian relaxation approach for the multiple sequence alignment problem
• Natalie 2.0: sparse global network alignment as a special case of quadratic assignment
• Emergence of Scaling in Random Networks
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Heuristics for the fixed cost median problem
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms

This page was built for publication: Lagrangian relaxations for multiple network alignment