The node-edge weighted 2-edge connected subgraph problem: linear relaxation, facets and separation (Q2506819): Difference between revisions
From MaRDI portal
Normalize DOI. |
Created claim: DBLP publication ID (P1635): journals/disopt/BaiouC06, #quickstatements; #temporary_batch_1735672051997 |
||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/disopt/BaiouC06 / rank | |||
Normal rank | |||
Latest revision as of 20:09, 31 December 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
0 references
