An effective branch-and-price algorithm for the preemptive resource constrained project scheduling problem based on minimal interval order enumeration (Q319357)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6633513
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An effective branch-and-price algorithm for the preemptive resource constrained project scheduling problem based on minimal interval order enumeration |
scientific article; zbMATH DE number 6633513 |
Statements
An effective branch-and-price algorithm for the preemptive resource constrained project scheduling problem based on minimal interval order enumeration (English)
0 references
6 October 2016
0 references
project scheduling
0 references
interval order
0 references
column generation
0 references
constraint propagation
0 references
antichain
0 references
0 references
0 references
0 references
0 references
0 references
0.8452677726745605
0 references
0.8296973705291748
0 references
0.8242934942245483
0 references
0.8210782408714294
0 references
0.820834219455719
0 references
