The Maximum Weight Connected Subgraph Problem

Eduardo Álvarez-Miranda (), Ivana Ljubić () and Petra Mutzel ()
Additional contact information
Eduardo Álvarez-Miranda: Università di Bologna, Dipartimento di Ingegneria dell’Energia Elettrica e dell’Informazione
Ivana Ljubić: Universität Wien, Institut für Statistik und Operations Research
Petra Mutzel: Technische Universität Dortmund, Fakultät für Informatik

A chapter in Facets of Combinatorial Optimization, 2013, pp 245-270 from Springer

Abstract: Abstract The Maximum (Node-) Weight Connected Subgraph Problem (MWCS) searches for a connected subgraph with maximum total weight in a node-weighted (di)graph. In this work we introduce a new integer linear programming formulation built on node variables only, which uses new constraints based on node-separators. We theoretically compare its strength to previously used MIP models in the literature and study the connected subgraph polytope associated with our new formulation. In our computational study we compare branch-and-cut implementations of the new model with two models recently proposed in the literature: one of them using the transformation into the Prize-Collecting Steiner Tree problem, and the other one working on the space of node variables only. The obtained results indicate that the new formulation outperforms the previous ones in terms of the running time and in terms of the stability with respect to variations of node weights.

Keywords: 2-connected Subgraph (CS); Prize-collecting Steiner Tree Problem; Node Weights; Maximum Total Weight; Nodal Variables (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-38189-8_11

Ordering information: This item can be ordered from
http://www.springer.com/9783642381898

DOI: 10.1007/978-3-642-38189-8_11

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().