On the k edge-disjoint 2-hop-constrained paths polytope

Authors:
Geir Dahl;David Huygens;A. Ridha Mahjoub;Pierre Pesneau
Affiliations:
University of Oslo, Centre of Mathematics for Applications, P.O. Box 1053, Blindern, NO-0316 Oslo, Norway;Department of Computer Science, Université Libre de Bruxelles, Boulevard du Triomphe CP 210/01, B-1050 Bruxelles, Belgium;LIMOS, CNRS, UMR 6158, Université Blaise Pascal Clermont II, Complexe Scientifique des Cézeaux, F-63177 Aubière Cedex, France;IAG/POMS, Université Catholique de Louvain, Place des Doyens, 1, B-1348 Louvain-la-Neuve, Belgium
Venue:
Operations Research Letters
Year:
2006

Citing 6
Cited 5

Polyhedral combinatorics

Optimization
A faster algorithm for finding the minimum cut in a directed graph

SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
Two Edge-Disjoint Hop-Constrained Paths and Polyhedra

SIAM Journal on Discrete Mathematics
The 2-path network problem

Networks
Notes on polyhedra associated with hop-constrained paths

Operations Research Letters
On the directed hop-constrained shortest path problem

Operations Research Letters

Approximability of 3- and 4-hop bounded disjoint paths problems

IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
The k edge-disjoint 3-hop-constrained paths polytope

Discrete Optimization
Benders Decomposition for the Hop-Constrained Survivable Network Design Problem

INFORMS Journal on Computing
Characterization of facets of the hop constrained chain polytope via dynamic programming

Discrete Applied Mathematics
Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

The k edge-disjoint 2-hop-constrained paths problem consists in finding a minimum cost subgraph such that between two given nodes s and t there exist at least k edge-disjoint paths of at most 2 edges. We give an integer programming formulation for this problem and characterize the associated polytope.