The node-edge weighted 2-edge connected subgraph problem : linear relaxation, facets and separation
Year of publication: |
2003
|
---|---|
Authors: | Baïou, Mourad ; Correa, José Rafael |
Institutions: | HAL |
Subject: | Optimisation combinatoire | La connexité dans les graphes | Polyèdres |
-
Tlilane, Lydia, (2014)
-
The N-echelon Location routing problem: concepts and methods for tactical and operational planning
Gonzalez-Feliu, Jesus, (2009)
-
Messaoud, Elhassania, (2013)
- More ...
-
A linear programming approach to increasing the weight of all minimum spanning trees
Baïou, Mourad, (2005)
-
Baïou, Mourad, (2002)
-
On the p-media polytope of special class of graphs
Baïou, Mourad, (2005)
- More ...