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 this page instead for the normal view: 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
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
