Strong inequalities and a branch-and-price algorithm for the convex recoloring problem
Year of publication: |
2022
|
---|---|
Authors: | Campêlo, Manoel ; Freire, Alexandre S. ; Moura, Phablo F. S. ; Soares, Joel C. |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 303.2022, 1 (16.11.), p. 54-65
|
Subject: | Branch-and-price | Convex recoloring | Integer programming | Phylogenetic tree | Polyhedral study | Theorie | Theory | Ganzzahlige Optimierung | Mathematische Optimierung | Mathematical programming |
-
Partial objective inequalities for the multi-item capacitated lot-sizing problem
Büyüktahtakın, İ. Esra, (2018)
-
Extreme ray feasibility cuts for unit commitment with uncertainty
Li, Chao, (2021)
-
The Hamiltonian p-median problem : polyhedral results and branch-and-cut algorithms
Barbato, Michele, (2024)
- More ...
-
Heuristics for the connected assignment problem in arrays
Campêlo, Manoel, (2019)
-
Partitioning a graph into balanced connected classes : formulations, separation and experiments
Miyazawa, Flávio Keidi, (2021)
-
An integer linear programming approach for bilinear integer programming
Freire, Alexandre S., (2012)
- More ...