• Aucun résultat trouvé

Two Node-Disjoint Hop-Constrained Survivable Network Design and Polyhedra

N/A
N/A
Protected

Academic year: 2021

Partager "Two Node-Disjoint Hop-Constrained Survivable Network Design and Polyhedra"

Copied!
35
0
0

Texte intégral

Références

Documents relatifs

In the present paper the distance is obtained in a more general case which includes the previous ones; the study of the corresponding quotient-space will be

Il est aussi montré que la relaxation ne suffit pas pour décrire l'enveloppe convexe associée au 2ECSP même dans une classe restreinte comme celle des graphes série-parallèles..

like any kind of research in education, the findings to be reached in this study will be limited in time and population .The present work investigates the

i) We need two image charges, one for each one of the real charges producing the constant external electric field.. The first term is just the potential due to the external field

Our first branch-and-cut algorithm, bc-all, checks for violated Benders cuts (7) at every node of the tree, while it tests for violated inequality (8) only at integer nodes.. As

Table 4 presents the results obtained for the MCSIPND s problem for the real instances. We can remark that in general, the results based on the path formulation, obtained with

Assuming that the diffusion rate of the species is large enough, we prove that any optimal configuration is the characteristic function of a domain standing for the resources

The proposed models of recursive, nonrecursive, and regularization-based parallel specialized processors provide versatility in solving the problem of signal