The time-dependent shortest pair of disjoint paths problem: Complexity, models, and algorithms (Q4540052): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| label / en | label / en | ||
The time-dependent shortest pair of disjoint paths problem: Complexity, models, and algorithms | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199807)31:4<259::aid-net6>3.0.co;2-c / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1998302192 / rank | |||
Normal rank | |||
| Property / title | |||
The time-dependent shortest pair of disjoint paths problem: Complexity, models, and algorithms (English) | |||
| Property / title: The time-dependent shortest pair of disjoint paths problem: Complexity, models, and algorithms (English) / rank | |||
Normal rank | |||
Latest revision as of 10:06, 30 July 2024
scientific article; zbMATH DE number 1769302
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The time-dependent shortest pair of disjoint paths problem: Complexity, models, and algorithms |
scientific article; zbMATH DE number 1769302 |
Statements
21 July 2002
0 references
The time-dependent shortest pair of disjoint paths problem: Complexity, models, and algorithms (English)
0 references
