The Generalized Reserve Set Covering Problem with Connectivity and Buffer Requirements
Year of publication: |
2021
|
---|---|
Authors: | Álvarez-Miranda, Eduardo ; Goycoolea, Marcos ; Ljubić, Ivana ; Sinnl, Markus |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 289.2021, 3 (16.3.), p. 1013-1029
|
Subject: | Combinatorial optimization | Maximum weight connected subgraph problem | Wildlife reserv design | Reserve set covering problem | Branch-and-cut | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Branch-and-Bound | Branch and Bound |
-
Zhang, Yurong, (2025)
-
Morrison, David Robert, (2014)
-
Lower bounds for a bin packing problem with linear usage cost
Braune, Roland, (2019)
- More ...
-
Solving minimum-cost shared arborescence problems
Álvarez-Miranda, Eduardo, (2017)
-
A note on computational aspects of the Steiner traveling salesman problem
Álvarez-Miranda, Eduardo, (2018)
-
A Relax-and-Cut framework for large-scale maximum weight connected subgraph problems
Álvarez-Miranda, Eduardo, (2017)
- More ...