An improved flow-based formulation and reduction principles for the minimum connectivity inference problem

DOI10.1080/02331934.2018.1465944zbMath1429.90086OpenAlexW2800207446MaRDI QIDQ5197998

Guntram Scheithauer, Muhammad Abid Dar, Andreas Fischer, John Martinovic

Publication date: 2 October 2019

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2018.1465944

zbMATH Keywords

reduction rulesmixed integer linear programming modelminimum connectivity inferencesubset interconnection design

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Combinatorial optimization (90C27)

Related Items (2)

A Computational Study of Reduction Techniques for the Minimum Connectivity Inference Problem ⋮ Integer linear programming formulations for the minimum connectivity inference problem and model reduction principles

Uses Software

• Algorithm 447

Cites Work

• Unnamed Item
• On the approximability and hardness of minimum topic connected overlay and its special instances
• Solving the minimum label spanning tree problem by mathematical programming techniques
• An optimization problem on graphs
• On complexity of subset interconnection designs
• Connectivity Inference in Mass Spectrometry Based Structure Determination
• Polynomial-Time Data Reduction for the Subset Interconnection Design Problem
• Matroids and Subset Interconnection Design
• Two algorithms for the subset interconnection design problem
• Inferring Social Networks from Outbreaks
• Constructing scalable overlays for pub-sub with many topics
• Algorithms and Implementation for Interconnection Graph Problem

This page was built for publication: An improved flow-based formulation and reduction principles for the minimum connectivity inference problem