Solving Project Scheduling Problems by Minimum Cut Computations (Q3114838): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: PSPLIB / rank | |||
Normal 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.49.3.330.12737 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2111185171 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 00:06, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving Project Scheduling Problems by Minimum Cut Computations |
scientific article |
Statements
Solving Project Scheduling Problems by Minimum Cut Computations (English)
0 references
19 February 2012
0 references
project scheduling
0 references
resource constraints
0 references
linear programming
0 references
