Solving Resource-Constrained Network Problems by Implicit Enumeration—Preemptive Case (Q5652427): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/opre.20.3.668 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4253186916 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 02:05, 20 March 2024
scientific article; zbMATH DE number 3382064
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving Resource-Constrained Network Problems by Implicit Enumeration—Preemptive Case |
scientific article; zbMATH DE number 3382064 |
Statements
Solving Resource-Constrained Network Problems by Implicit Enumeration—Preemptive Case (English)
0 references
1972
0 references
