A bicriterion call center problem through an evolved branch and bound algorithm (Q505103)
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 6676224
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A bicriterion call center problem through an evolved branch and bound algorithm |
scientific article; zbMATH DE number 6676224 |
Statements
A bicriterion call center problem through an evolved branch and bound algorithm (English)
0 references
19 January 2017
0 references
multicriteria optimization
0 references
efficient solution
0 references
branch and bound algorithm
0 references
clustering
0 references
call center
0 references
0 references
0.7396034002304077
0 references
0.7157374620437622
0 references
0.7126908898353577
0 references
0.7079196572303772
0 references
