On the \(k\) edge-disjoint 2-hop-constrained paths polytope (Q2480058): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Notes on polyhedra associated with hop-constrained paths / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the directed hop-constrained shortest path problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The 2-path network problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Faster Algorithm for Finding the Minimum Cut in a Directed Graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Two Edge-Disjoint Hop-Constrained Paths and Polyhedra / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3682240 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank | |||
Normal rank |
Latest revision as of 20:29, 27 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the \(k\) edge-disjoint 2-hop-constrained paths polytope |
scientific article |
Statements
On the \(k\) edge-disjoint 2-hop-constrained paths polytope (English)
0 references
28 March 2008
0 references
survivable network
0 references
edge-disjoint paths
0 references
hop-constraint
0 references
polyhedron
0 references
facet
0 references