A geometric branch-and-bound algorithm for the service bundle design problem
Year of publication: |
2022
|
---|---|
Authors: | Li, Yifu ; Qi, Xiangtong |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 303.2022, 3 (16.12.), p. 1044-1056
|
Subject: | 0-1 Sum-of-ratios problem | Geometric branch-and-bound algorithm | Scheduling | Service design | Theorie | Theory | Branch-and-Bound | Branch and Bound | Leistungsbündel | Bundling strategy | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm | Operations Research | Operations research |
-
A new branch-and-bound algorithm for the maximum edge-weighted clique problem
San Segundo, Pablo, (2019)
-
An efficient branch and bound algorithm for smoothing the workloads on simple assembly lines
Hazır, Öncü, (2021)
-
A Geometric Branch-and-Bound Algorithm for the Service Bundle Design Problem
Li, Yifu, (2022)
- More ...
-
A theory of interior peaks : activity sequencing and selection for service design
Li, Yifu, (2022)
-
A Theory of Interior Peaks : Activity Sequencing and Selection for Service Design
Li, Yifu, (2020)
-
A Geometric Branch-and-Bound Algorithm for the Service Bundle Design Problem
Li, Yifu, (2022)
- More ...