A strong flow-based formulation for the shortest path problem in digraphs with negative cycles (Q3184586): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1111/j.1475-3995.2008.00681.x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2020990638 / rank | |||
Normal rank | |||
Revision as of 22:22, 19 March 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
