A strong flow-based formulation for the shortest path problem in digraphs with negative cycles (Q3184586): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: GLPK / rank | |||
Normal rank | |||
Revision as of 11:48, 29 February 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
