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...

Full description

Saved in:

Bibliographic Details
Published in:	European journal of operational research Vol. 297; no. 1; pp. 27 - 39
Main Authors:	Zhou, Yi, Lin, Weibo, Hao, Jin-Kao, Xiao, Mingyu, Jin, Yan
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 16.02.2022 Elsevier
Subjects:	[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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!