Partitioning a graph into balanced connected classes : formulations, separation and experiments
Year of publication: |
2021
|
---|---|
Authors: | Miyazawa, Flávio Keidi ; Moura, Phablo F. S. ; Ota, Matheus J. ; Wakabayashi, Yoshiko |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 293.2021, 3 (16.9.), p. 826-836
|
Subject: | Balanced partition | Branch-and-cut | Connected partition | Integer programming | Separation algorithm | Ganzzahlige Optimierung | Graphentheorie | Graph theory | Mathematische Optimierung | Mathematical programming |
-
Maximizing engagement in large-scale social networks
Kroger, Samuel, (2024)
-
A wide branching strategy for the graph coloring problem
Morrison, David Robert, (2014)
-
A minmax regret version of the time-dependent shortest path problem
Conde, Eduardo, (2018)
- More ...
-
Strong inequalities and a branch-and-price algorithm for the convex recoloring problem
Campêlo, Manoel, (2022)
-
Smart energy pricing for demand‐side management in renewable energy smart grids
Borges, Yulle G. F., (2019)
-
The integrated lot-sizing and cutting stock problem under demand uncertainty
Curcio, Eduardo, (2023)
- More ...