BRANCHING TECHNIQUE FOR A BI-OBJECTIVE TWO-STAGE ASSIGNMENT PROBLEM (Q5038210)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7594872
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | BRANCHING TECHNIQUE FOR A BI-OBJECTIVE TWO-STAGE ASSIGNMENT PROBLEM |
scientific article; zbMATH DE number 7594872 |
Statements
BRANCHING TECHNIQUE FOR A BI-OBJECTIVE TWO-STAGE ASSIGNMENT PROBLEM (English)
0 references
30 September 2022
0 references
bi-objective
0 references
assignment
0 references
efficient pair
0 references
time minimization
0 references
ranking
0 references
scanning
0 references
0 references
0 references
0.9150689
0 references
0.9005916
0 references
0.8817128
0 references
0.8802339
0 references
0.8699757
0 references
0.8663943
0 references
0.86484903
0 references
0.86417294
0 references
