THE LEXICO-BOUNDED FLOW ALGORITHM FOR SOLVING THE MINIMUM COST PROJECT SCHEDULING PROBLEM WITH AN ADDITIONAL LINEAR CONSTRAINT (Q3220333)
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: THE LEXICO-BOUNDED FLOW ALGORITHM FOR SOLVING THE MINIMUM COST PROJECT SCHEDULING PROBLEM WITH AN ADDITIONAL LINEAR CONSTRAINT |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | THE LEXICO-BOUNDED FLOW ALGORITHM FOR SOLVING THE MINIMUM COST PROJECT SCHEDULING PROBLEM WITH AN ADDITIONAL LINEAR CONSTRAINT |
scientific article |
Statements
THE LEXICO-BOUNDED FLOW ALGORITHM FOR SOLVING THE MINIMUM COST PROJECT SCHEDULING PROBLEM WITH AN ADDITIONAL LINEAR CONSTRAINT (English)
0 references
1984
0 references
parametrized right-hand side
0 references
minimum cost project scheduling problem
0 references
additional linear constraint
0 references
lexico-shortest route algorithm
0 references
0.8828012
0 references
0.8620402
0 references
0.8599234
0 references
0.85835844
0 references
0.85792327
0 references
0.8538255
0 references
