A branch \(\&\) bound algorithm for the open-shop problem (Q1363739): Difference between revisions
From MaRDI portal
Latest revision as of 09:53, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A branch \(\&\) bound algorithm for the open-shop problem |
scientific article |
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