A note on hop-constrained walk polytopes. (Q703241): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The perfectly matchable subgraph polytope of a bipartite graph / rank | |||
Normal rank | |||
| 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: Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints / rank | |||
Normal rank | |||
Revision as of 16:05, 7 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on hop-constrained walk polytopes. |
scientific article |
Statements
A note on hop-constrained walk polytopes. (English)
0 references
11 January 2005
0 references
Complete description
0 references
Hop-constraints
0 references
Walk
0 references
Extended formulation
0 references
