A cumulative not-first/not-last filtering algorithm in \(O(n^2 \log(n))\) (Q2393571)
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: A cumulative not-first/not-last filtering algorithm in O(n^2 (n)) |
scientific article; zbMATH DE number 6196653
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A cumulative not-first/not-last filtering algorithm in \(O(n^2 \log(n))\) |
scientific article; zbMATH DE number 6196653 |
Statements
A cumulative not-first/not-last filtering algorithm in \(O(n^2 \log(n))\) (English)
0 references
8 August 2013
0 references
constraint-based scheduling
0 references
global constraints
0 references
not-first/not-last
0 references
cumulative resources
0 references
cumulative \(\theta\)-tree
0 references
energy envelope
0 references
0.8819253
0 references
0.8198562
0 references
0.81550163
0 references
0.80612624
0 references
0.7972608
0 references
