Extension of \(O(n \log n)\) filtering algorithms for the unary resource constraint to optional activities (Q850453)
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: Extension of \(O(n \log n)\) filtering algorithms for the unary resource constraint to optional activities |
scientific article; zbMATH DE number 5070682
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Extension of \(O(n \log n)\) filtering algorithms for the unary resource constraint to optional activities |
scientific article; zbMATH DE number 5070682 |
Statements
Extension of \(O(n \log n)\) filtering algorithms for the unary resource constraint to optional activities (English)
0 references
3 November 2006
0 references
global constraints
0 references
scheduling
0 references
unary resource
0 references
alternatives
0 references
