Fast Algorithms for Parametric Scheduling Come From Extensions to Parametric Maximum Flow (Q4950820): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/opre.47.5.744 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2117135110 / rank | |||
Normal rank | |||
Latest revision as of 23:55, 19 March 2024
scientific article; zbMATH DE number 1437235
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast Algorithms for Parametric Scheduling Come From Extensions to Parametric Maximum Flow |
scientific article; zbMATH DE number 1437235 |
Statements
Fast Algorithms for Parametric Scheduling Come From Extensions to Parametric Maximum Flow (English)
0 references
27 April 2000
0 references
scheduling
0 references
flow problem
0 references
