A Branch-and-Cut Procedure for the Multimode Resource-Constrained Project-Scheduling Problem (Q2892296): Difference between revisions
From MaRDI portal
Changed an Item |
Normalize DOI. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1287/ijoc.1040.0121 / rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/ijoc.1040.0121 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2117837254 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1287/IJOC.1040.0121 / rank | |||
Normal rank | |||
Latest revision as of 04:38, 20 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Branch-and-Cut Procedure for the Multimode Resource-Constrained Project-Scheduling Problem |
scientific article |
Statements
A Branch-and-Cut Procedure for the Multimode Resource-Constrained Project-Scheduling Problem (English)
0 references
18 June 2012
0 references
project scheduling
0 references
multiple resources
0 references
integer linear programming
0 references
branch and cut
0 references
