A Relax-and-Cut framework for large-scale maximum weight connected subgraph problems
Year of publication: |
November 2017
|
---|---|
Authors: | Álvarez-Miranda, Eduardo ; Sinnl, Markus |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 87.2017, p. 63-82
|
Subject: | Maximum weight connected subgraph problem | Lagrangian pelaxation | Bioinformatics |
-
The Generalized Reserve Set Covering Problem with Connectivity and Buffer Requirements
Álvarez-Miranda, Eduardo, (2021)
-
Hybrid Wrapper/Filter Gene Selection Using an Ensemble of Classifiers and PSO Algorithm
Boucheham, Anouar, (2017)
-
Liu, Yi, (2017)
- More ...
-
A note on computational aspects of the Steiner traveling salesman problem
Álvarez-Miranda, Eduardo, (2018)
-
Lagrangian and branch-and-cut approaches for upgrading spanning tree problems
Álvarez-Miranda, Eduardo, (2017)
-
Solving minimum-cost shared arborescence problems
Álvarez-Miranda, Eduardo, (2017)
- More ...