Imposing Connectivity Constraints in Forest Planning Models
From MaRDI portal
Publication:5166249
DOI10.1287/opre.2013.1183zbMath1291.90341OpenAlexW2150408365MaRDI QIDQ5166249
Rodolfo Carvajal, Juan Pablo Vielma, Marcos Goycoolea, Miguel Fragoso Constantino, Andrés P. Weintraub
Publication date: 26 June 2014
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/88144
Related Items
Development of a threat index to manage timber production on flammable forest landscapes subject to spatial harvest constraints ⋮ Exploring the tradeoffs among forest planning, roads and wildlife corridors: a new approach ⋮ Connected max cut is polynomial for graphs without the excluded minor \(K_5\backslash e\) ⋮ Computational approaches for zero forcing and related problems ⋮ On Fault-Tolerant Low-Diameter Clusters in Graphs ⋮ The unrooted set covering connected subgraph problem differentiating between HIV envelope sequences ⋮ Optimal design of compact and functionally contiguous conservation management areas ⋮ Visualizing proportions and dissimilarities by space-filling maps: a large neighborhood search approach ⋮ Achieving full connectivity of sites in the multiperiod reserve network design problem ⋮ A relax-and-cut framework for large-scale maximum weight connected subgraph problems ⋮ Imposing Contiguity Constraints in Political Districting Models ⋮ Modularity maximization to design contiguous policy zones for pandemic response ⋮ Computing the largest bond and the maximum connected cut of a graph ⋮ LP-based dual bounds for the maximum quasi-clique problem ⋮ Solving the Distance-Based Critical Node Problem ⋮ Downstream protection value: detecting critical zones for effective fuel-treatment under wildfire risk ⋮ Local search for constrained graph clustering in biological networks ⋮ Branch-and-cut for the forest harvest scheduling subject to clearcut and core area constraints ⋮ On imposing connectivity constraints in integer programs ⋮ Constraint-based electoral districting using a new compactness measure: an application to Portugal ⋮ Fifty years of operational research in forestry ⋮ On the bond polytope ⋮ Optimal connected subgraphs: Integer programming formulations and polyhedra ⋮ Solving Steiner trees: Recent advances, challenges, and perspectives ⋮ Spatial optimization of multiple area land acquisition ⋮ Vertex covering with capacitated trees ⋮ Linear-size formulations for connected planar graph partitioning and political districting ⋮ Wildlife reserve design with connectivity and buffer requirements ⋮ Optimal price zones of electricity markets: a mixed-integer multilevel model and global solution approaches ⋮ Parsimonious formulations for low-diameter clusters ⋮ Enriching Solutions to Combinatorial Problems via Solution Engineering ⋮ Learning in Combinatorial Optimization: What and How to Explore ⋮ Mixed-integer programming techniques for the connected max-\(k\)-cut problem ⋮ Optimal management of naturally regenerating uneven-aged forests ⋮ Global optimization of multilevel electricity market models including network design and graph partitioning ⋮ A multi-objective districting problem applied to agricultural machinery maintenance service network ⋮ The generalized reserve set covering problem with connectivity and buffer requirements ⋮ Long-term plantation and harvesting planning for industrial plantation forest areas ⋮ Mixed Integer Linear Programming Formulation Techniques ⋮ Congress seat allocation using mathematical optimization ⋮ Political districting to minimize cut edges
