An exact algorithm for the Minimum Gap Graph Partitioning Problem
| Year of publication: |
2025
|
|---|---|
| Authors: | Bruglieri, Maurizio ; Consiglio, Gianluca ; Cordone, Roberto |
| Published in: |
Computers & operations research : an international journal. - Amsterdam [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 1499736-8. - Vol. 184.2025, Art.-No. 107224, p. 1-12
|
| Subject: | Branch-and-bound | Graph partitioning | Lagrangian relaxation | Reduction procedures | Set covering | Graphentheorie | Graph theory | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm | Branch-and-Bound | Branch and Bound |
-
Guimarães, Dilson Almeida, (2020)
-
Exact solution approaches for the Multi-period Degree Constrained Minimum Spanning Tree Problem
Chagas, Rosklin Juliano, (2018)
-
Pamuk, Bahadır, (2025)
- More ...
-
Metaheuristics for the Minimum Gap Graph Partitioning Problem
Bruglieri, Maurizio, (2021)
-
A RELAX-AND-CUT ALGORITHM FOR THE KNAPSACK NODE WEIGHTED STEINER TREE PROBLEM
CORDONE, ROBERTO, (2008)
-
Cordone, Roberto, (2018)
- More ...