An effective branch-and-price algorithm for the preemptive resource constrained project scheduling problem based on minimal interval order enumeration (Q319357): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ejor.2014.12.037 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2073568982 / rank | |||
Normal rank | |||
Revision as of 03:09, 20 March 2024
scientific article
| 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 |
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
