شماره ركورد كنفرانس :
3753
عنوان مقاله :
On the integer programming formulation for k edge-disjoint L-hop-constrained paths (kHPP), for L=2, 3.
عنوان به زبان ديگر :
On the integer programming formulation for k edge-disjoint L-hop-constrained paths (kHPP), for L=2, 3.
پديدآورندگان :
Aghajan Behnam University of Zanjan , Ghaemi Mohammad Reza University of Zanjan
كليدواژه :
Integer programming , Edge , disjoint , Hop , constrained , polyhedron.
عنوان كنفرانس :
دومين كنفرانس ملي تركيبيات رمزنگاري و محاسبات
چكيده فارسي :
The k edge-disjoint L-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 L edges. We give an integer programming formulation for this problem.
چكيده لاتين :
The k edge-disjoint L-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 L edges. We give an integer programming formulation for this problem.
