An Efficient Integer Programming Algorithm with Network Cuts for Solving Resource-Constrained Scheduling Problems (Q4178760): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Normalize DOI. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1287/mnsc.24.11.1163 / rank | |||
| 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/mnsc.24.11.1163 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2066190993 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1287/MNSC.24.11.1163 / rank | |||
Normal rank | |||
Latest revision as of 09:29, 29 December 2024
scientific article; zbMATH DE number 3614482
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Efficient Integer Programming Algorithm with Network Cuts for Solving Resource-Constrained Scheduling Problems |
scientific article; zbMATH DE number 3614482 |
Statements
An Efficient Integer Programming Algorithm with Network Cuts for Solving Resource-Constrained Scheduling Problems (English)
0 references
1978
0 references
Network Cuts
0 references
Integer Programmig Algorithm
0 references
Resource-Constrained Scheduling Problems
0 references
Implicit Enumeration
0 references
Computational
0 references
Efficiency
0 references
