Imposing Connectivity Constraints in Forest Planning Models

Cited In (44)

Parsimonious formulations for low-diameter clusters
Connected max cut is polynomial for graphs without the excluded minor \(K_5\backslash e\)
Computing the largest bond and the maximum connected cut of a graph
Solving the Distance-Based Critical Node Problem
Long-term plantation and harvesting planning for industrial plantation forest areas
Mixed-integer programming techniques for the connected max-\(k\)-cut problem
Exploring the tradeoffs among forest planning, roads and wildlife corridors: a new approach
Branch-and-cut for the forest harvest scheduling subject to clearcut and core area constraints
On imposing connectivity constraints in integer programs
Optimal management of naturally regenerating uneven-aged forests
Spatial optimization of multiple area land acquisition
Vertex covering with capacitated trees
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
Fifty years of operational research in forestry
Congress seat allocation using mathematical optimization
Linear-size formulations for connected planar graph partitioning and political districting
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
Visualizing proportions and dissimilarities by space-filling maps: a large neighborhood search approach
Design and Implementation of an Interactive Optimization System for Telephone Network Planning
Development of a threat index to manage timber production on flammable forest landscapes subject to spatial harvest constraints
Mixed integer linear programming formulation techniques
The unrooted set covering connected subgraph problem differentiating between HIV envelope sequences
Optimal design of compact and functionally contiguous conservation management areas
Polyhedral approach to weighted connected matchings in general graphs
Computational approaches for zero forcing and related problems
Wildlife reserve design with connectivity and buffer requirements
Solving Steiner trees: Recent advances, challenges, and perspectives
LP-based dual bounds for the maximum quasi-clique problem
Downstream protection value: detecting critical zones for effective fuel-treatment under wildfire risk
Local search for constrained graph clustering in biological networks
Optimal connected subgraphs: Integer programming formulations and polyhedra
Modularity maximization to design contiguous policy zones for pandemic response
Constraint-based electoral districting using a new compactness measure: an application to Portugal
A classification method based on a cloud of spheres
On Fault-Tolerant Low-Diameter Clusters in Graphs
Learning in Combinatorial Optimization: What and How to Explore
Optimal price zones of electricity markets: a mixed-integer multilevel model and global solution approaches
Enriching Solutions to Combinatorial Problems via Solution Engineering
Imposing Contiguity Constraints in Political Districting Models
On the bond polytope
Political districting to minimize cut edges

   Recommendations

This page was built for publication: Imposing Connectivity Constraints in Forest Planning Models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5166249)