On dual based lower bounds for the sequential ordering problem with precedences and due dates (Q1417775)
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: On dual based lower bounds for the sequential ordering problem with precedences and due dates |
scientific article; zbMATH DE number 2021908
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On dual based lower bounds for the sequential ordering problem with precedences and due dates |
scientific article; zbMATH DE number 2021908 |
Statements
On dual based lower bounds for the sequential ordering problem with precedences and due dates (English)
0 references
6 January 2004
0 references
Hamiltonian path
0 references
sequential ordering problem
0 references
precedences
0 references
due dates
0 references
minimum arborescence
0 references
Lagrangian relaxation
0 references
permutation path
0 references
0.8836534
0 references
0.87167054
0 references
0.86626667
0 references
0.86577916
0 references
0.8577752
0 references
0 references
