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

Elham Sadeghi; Neng Fan

doi:10.1007/s10287-016-0260-7

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

Elham Sadeghi, Neng Fan

Systems and Industrial Engineering

Research output: Contribution to journal › Article

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 language	English (US)
Pages (from-to)	571-596
Number of pages	26
Journal	Computational Management Science
Volume	13
Issue number	4
DOIs	https://doi.org/10.1007/s10287-016-0260-7
State	Published - 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

10.1007/s10287-016-0260-7

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

Cite this

Sadeghi, E., & Fan, N. (2016). On the minimum-cost λ -edge-connected k-subgraph problem. Computational Management Science, 13(4), 571-596. https://doi.org/10.1007/s10287-016-0260-7

@article{ea8af522b0d4415ebfe3e1d4d99cfbe6,

title = "On the minimum-cost λ -edge-connected k-subgraph problem",

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=",

keywords = "Edge-connected subgraph, Graph connectivity, Integer programming, Minimum spanning tree, Valid inequalities",

author = "Elham Sadeghi and Neng Fan",

year = "2016",

month = oct,

day = "1",

doi = "10.1007/s10287-016-0260-7",

language = "English (US)",

volume = "13",

pages = "571--596",

journal = "Computational Management Science",

issn = "1619-697X",

publisher = "Springer Verlag",

number = "4",

}

TY - JOUR

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

AU - Sadeghi, Elham

AU - Fan, Neng

PY - 2016/10/1

Y1 - 2016/10/1

N2 - 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=

AB - 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=

KW - Edge-connected subgraph

KW - Graph connectivity

KW - Integer programming

KW - Minimum spanning tree

KW - Valid inequalities

UR - http://www.scopus.com/inward/record.url?scp=84975270770&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84975270770&partnerID=8YFLogxK

U2 - 10.1007/s10287-016-0260-7

DO - 10.1007/s10287-016-0260-7

M3 - Article

AN - SCOPUS:84975270770

VL - 13

SP - 571

EP - 596

JO - Computational Management Science

JF - Computational Management Science

SN - 1619-697X

IS - 4

ER -