A branch \(\&\) bound algorithm for the open-shop problem (Q1363739)
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 branch \& bound algorithm for the open-shop problem |
scientific article; zbMATH DE number 1047165
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch \(\&\) bound algorithm for the open-shop problem |
scientific article; zbMATH DE number 1047165 |
Statements
A branch \(\&\) bound algorithm for the open-shop problem (English)
0 references
24 February 1998
0 references
branch-and-bound
0 references
open-shop problem
0 references
disjunctive graph
0 references
0.90769386
0 references
0.90521103
0 references
0.9044136
0 references
0.9041492
0 references
0.9030309
0 references
0.8973612
0 references
0.8955716
0 references
0.8930463
0 references
0.8929655
0 references
0.8925265
0 references
