A strong flow-based formulation for the shortest path problem in digraphs with negative cycles (Q3184586): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A lifting procedure for asymmetric traveling salesman polytope and a large new class of facets / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On a routing problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A note on two problems in connexion with graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4928164 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A lower bound for the shortest Hamiltonean path in directed graphs / rank | |||
Normal rank | |||
Latest revision as of 01:33, 2 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A strong flow-based formulation for the shortest path problem in digraphs with negative cycles |
scientific article |
Statements
A strong flow-based formulation for the shortest path problem in digraphs with negative cycles (English)
0 references
21 October 2009
0 references
linear programming
0 references
digraphs
0 references
shortest path
0 references
0 references
