On the minimum-cost λ -edge-connected k-subgraph problem

Elham Sadeghi, Neng Fan

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

Abstract

In this paper, we propose several integer programming (IP) formulations to exactly solve the minimum-cost λ-edge-connected k-subgraph problem, or the (k, λ) -subgraph problem, based on its graph properties. Special cases of this problem include the well-known k-minimum spanning tree problem (if λ= 1), λ-edge-connected spanning subgraph problem (if k=

Original languageEnglish (US)
Pages (from-to)571-596
Number of pages26
JournalComputational Management Science
Volume13
Issue number4
DOIs
StatePublished - Oct 1 2016

Keywords

  • Edge-connected subgraph
  • Graph connectivity
  • Integer programming
  • Minimum spanning tree
  • Valid inequalities

ASJC Scopus subject areas

  • Management Information Systems
  • Information Systems

Access to Document

Fingerprint Dive into the research topics of 'On the minimum-cost λ -edge-connected k-subgraph problem'. Together they form a unique fingerprint.

Cite this