An effective branch-and-bound algorithm for the maximum s-bundle problem
Year of publication: |
2022
|
---|---|
Authors: | Zhou, Yi ; Lin, Weibo ; Hao, Jin-Kao ; Xiao, Mingyu ; Jin, Yan |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 297.2022, 1 (16.2.), p. 27-39
|
Subject: | Branch and bound | Combinatorial optimization | Graph theory | Clique relaxation | s-Bundle | Branch-and-Bound | Branch and Bound | Graphentheorie | Mathematische Optimierung | Mathematical programming | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm |
-
A branch-and-bound algorithm for the knapsack problem with conflict graph
Bettinelli, Andrea, (2017)
-
Exact solution approaches for the Multi-period Degree Constrained Minimum Spanning Tree Problem
Chagas, Rosklin Juliano, (2018)
-
GuimarĂ£es, Dilson Almeida, (2020)
- More ...
-
Computing maximum k-defective cliques in massive graphs
Chen, Xiaoyu, (2021)
-
Computing lower bounds for minimum sum coloring and optimum cost chromatic partition
Lin, Weibo, (2019)
-
Finding small feedback arc sets on large graphs
Xiong, Ziliang, (2024)
- More ...