The 2-path network problem

31Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Given a graph with nonnegative edge weights and a set D of node pairs, the 2-path network problem requires a minimum weight set of edges such that the induced subgraph contains a path with one or two edges connecting each pair in D. The problem is A/P-hard. We present two integer programming models for the problem and study properties of associated polytopes, including cutting planes. Two approximation algorithms are suggested and analyzed. Some computational experience is reported. © 2004 Wiley Periodicals, Inc.

Cite

CITATION STYLE

APA

Dahl, G., & Johannessen, B. (2004). The 2-path network problem. Networks, 43(3), 190–199. https://doi.org/10.1002/net.20003

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free