Imposing Connectivity Constraints in Forest Planning Models
From MaRDI portal
Publication:5166249
Recommendations
- A multiobjective model for forest planning with adjacency constraints
- Modeling forest core area with integer programming
- Forest management models and combinatorial algorithms: Analysis of state of the art
- Design and Implementation of an Interactive Optimization System for Telephone Network Planning
- Undirected forest constraints
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- A General Approximation Technique for Constrained Forest Problems
- scientific article; zbMATH DE number 742977
- Constrained dynamic tree networks
Cited in
(47)- 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
- Spatial optimization of multiple area land acquisition
- Branch-and-cut for the forest harvest scheduling subject to clearcut and core area constraints
- Long-term plantation and harvesting planning for industrial plantation forest areas
- Linear-size formulations for connected planar graph partitioning and political districting
- Connected max cut is polynomial for graphs without the excluded minor \(K_5\backslash e\)
- Exploring the tradeoffs among forest planning, roads and wildlife corridors: a new approach
- Computational approaches for zero forcing and related problems
- A branch-and-bound procedure for forest harvest scheduling problems addressing aspects of habitat availability
- Modeling forest core area with integer programming
- Learning in combinatorial optimization: what and how to explore
- A classification method based on a cloud of spheres
- The generalized reserve set covering problem with connectivity and buffer requirements
- 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
- Vertex covering with capacitated trees
- Optimal price zones of electricity markets: a mixed-integer multilevel model and global solution approaches
- On Fault-Tolerant Low-Diameter Clusters in Graphs
- A multi-objective districting problem applied to agricultural machinery maintenance service network
- Enriching Solutions to Combinatorial Problems via Solution Engineering
- Development of a threat index to manage timber production on flammable forest landscapes subject to spatial harvest constraints
- On the bond polytope
- Fifty years of operational research in forestry
- Political districting to minimize cut edges
- Design and Implementation of an Interactive Optimization System for Telephone Network Planning
- On imposing connectivity constraints in integer programs
- Network connectivity value
- Wildlife reserve design with connectivity and buffer requirements
- Modularity maximization to design contiguous policy zones for pandemic response
- Mixed integer linear programming formulation techniques
- Computing the largest bond and the maximum connected cut of a graph
- The unrooted set covering connected subgraph problem differentiating between HIV envelope sequences
- Optimal design of compact and functionally contiguous conservation management areas
- Mixed-integer programming techniques for the connected max-\(k\)-cut problem
- Solving the Distance-Based Critical Node Problem
- Parsimonious formulations for low-diameter clusters
- Congress seat allocation using mathematical optimization
- Solving Steiner trees: Recent advances, challenges, and perspectives
- Constraint-based electoral districting using a new compactness measure: an application to Portugal
- Polyhedral approach to weighted connected matchings in general graphs
- Optimal management of naturally regenerating uneven-aged forests
- Imposing contiguity constraints in political districting models
- Optimal connected subgraphs: Integer programming formulations and polyhedra
- Global optimization of multilevel electricity market models including network design and graph partitioning
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)
