Solving Resource-Constrained Network Problems by Implicit Enumeration—Nonpreemptive Case (Q5595978): 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.18.2.263 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2128896782 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 18:22, 19 March 2024
scientific article; zbMATH DE number 3314896
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving Resource-Constrained Network Problems by Implicit Enumeration—Nonpreemptive Case |
scientific article; zbMATH DE number 3314896 |
Statements
Solving Resource-Constrained Network Problems by Implicit Enumeration—Nonpreemptive Case (English)
0 references
1970
0 references
operations research
0 references
