A geometric branch-and-bound algorithm for the service bundle design problem (Q2160490)
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 geometric branch-and-bound algorithm for the service bundle design problem |
scientific article; zbMATH DE number 7567017
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A geometric branch-and-bound algorithm for the service bundle design problem |
scientific article; zbMATH DE number 7567017 |
Statements
A geometric branch-and-bound algorithm for the service bundle design problem (English)
0 references
3 August 2022
0 references
scheduling
0 references
service design
0 references
geometric branch-and-bound algorithm
0 references
0-1 sum-of-ratios problem
0 references
0 references
0 references
0 references
0 references
0 references
0 references
