Login / Signup
The node-edge weighted 2-edge connected subgraph problem: Linear relaxation, facets and separation.
Mourad Baïou
José R. Correa
Published in:
Discret. Optim. (2006)
Keyphrases
</>
edge weights
weighted graph
knapsack problem
search algorithm
np complete
undirected graph