The 2-edge-connected subgraph polyhedron (Q2576774): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: PORTA / rank | |||
Normal rank | |||
Revision as of 01:30, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The 2-edge-connected subgraph polyhedron |
scientific article |
Statements
The 2-edge-connected subgraph polyhedron (English)
0 references
14 December 2005
0 references
network design
0 references
edge-connectivity
0 references
traveling salesman problem
0 references
polyhedra
0 references
