Exact and heuristic solution approaches for the Generalized Independent Set Problem
Year of publication: |
2024
|
---|---|
Authors: | Zheng, Mingming ; Hao, Jin-Kao ; Wu, Qinghua |
Published in: |
Computers & operations research : an international journal. - Amsterdam [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 1499736-8. - Vol. 164.2024, Art.-No. 106561, p. 1-21
|
Subject: | Adaptive local search | Branch and bound | Heuristic | The generalized independent set problem | Heuristik | Heuristics | Theorie | Theory | Branch-and-Bound | Branch and Bound | Mathematische Optimierung | Mathematical programming |
-
A branch, bound, and remember algorithm for the simple disassembly line balancing problem
Li, Jinlin, (2019)
-
Solving the RCPSP efficiently at modest memory requirements
Sprecher, Arno, (1996)
-
Ozturk, Onur, (2017)
- More ...
-
Exact and Heuristic Solution Approaches for the Generalized Independent Set Problem
Zheng, Mingming, (2023)
-
A review on algorithms for maximum clique problems
Wu, Qinghua, (2015)
-
A hybrid metaheuristic method for the Maximum Diversity Problem
Wu, Qinghua, (2013)
- More ...