The node-edge weighted 2-edge connected subgraph problem: linear relaxation, facets and separation (Q2506819): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 03:00, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The node-edge weighted 2-edge connected subgraph problem: linear relaxation, facets and separation |
scientific article |
Statements
The node-edge weighted 2-edge connected subgraph problem: linear relaxation, facets and separation (English)
0 references
10 October 2006
0 references
combinatorial optimization
0 references
polyhedral combinatorics
0 references
graph connectivity
0 references
