An effective branch-and-bound algorithm for the maximum s-bundle problem

•We exploit the properties of the maximum s-bundle problem.•A branch-and-bound algorithm is proposed for the maximum s-bundle problem.•We study novel multi-branching techniques.•Numerical results show the benefit of the new algorithm compared to existing ones. An s-bundle (where s is a positive inte...

Celý popis

Podrobná bibliografia

Vydané v:	European journal of operational research Ročník 297; číslo 1; s. 27 - 39
Hlavní autori:	Zhou, Yi, Lin, Weibo, Hao, Jin-Kao, Xiao, Mingyu, Jin, Yan
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 16.02.2022 Elsevier
Predmet:	[formula omitted]-Bundle Branch and bound Clique relaxation Combinatorial optimization Computer Science Graph theory Clique relaxation Graph theory Branch and bound Combinatorial optimization s-Bundle
ISSN:	0377-2217, 1872-6860
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!