Exact methods for solving the elementary shortest and longest path problems (Q512936): 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.1007/s10479-016-2116-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2273056006 / rank | |||
Normal rank | |||
Revision as of 00:10, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Exact methods for solving the elementary shortest and longest path problems |
scientific article |
Statements
Exact methods for solving the elementary shortest and longest path problems (English)
0 references
3 March 2017
0 references
elementary shortest path
0 references
elementary longest path
0 references
negative cycles
0 references
mixed integer programming
0 references
decomposition
0 references
