A competitive branch-and-bound algorithm for the simple assembly line balancing problem (Q4497013)
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 competitive branch-and-bound algorithm for the simple assembly line balancing problem |
scientific article; zbMATH DE number 1493711
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A competitive branch-and-bound algorithm for the simple assembly line balancing problem |
scientific article; zbMATH DE number 1493711 |
Statements
A competitive branch-and-bound algorithm for the simple assembly line balancing problem (English)
0 references
21 August 2000
0 references
0.8934162259101868
0 references
0.8893846869468689
0 references
0.8877497911453247
0 references
