Pages that link to "Item:Q5166249"

The following pages link to Imposing Connectivity Constraints in Forest Planning Models (Q5166249):

Displaying 42 items.

• The unrooted set covering connected subgraph problem differentiating between HIV envelope sequences (Q320748) (← links)
• Optimal design of compact and functionally contiguous conservation management areas (Q322808) (← links)
• Connected max cut is polynomial for graphs without the excluded minor \(K_5\backslash e\) (Q830923) (← links)
• Computational approaches for zero forcing and related problems (Q1631510) (← links)
• Visualizing proportions and dissimilarities by space-filling maps: a large neighborhood search approach (Q1652097) (← links)
• Achieving full connectivity of sites in the multiperiod reserve network design problem (Q1652228) (← links)
• A relax-and-cut framework for large-scale maximum weight connected subgraph problems (Q1652399) (← links)
• Branch-and-cut for the forest harvest scheduling subject to clearcut and core area constraints (Q1681301) (← links)
• On imposing connectivity constraints in integer programs (Q1683690) (← links)
• Optimal management of naturally regenerating uneven-aged forests (Q1752273) (← links)
• Global optimization of multilevel electricity market models including network design and graph partitioning (Q2010915) (← links)
• A multi-objective districting problem applied to agricultural machinery maintenance service network (Q2024004) (← links)
• The generalized reserve set covering problem with connectivity and buffer requirements (Q2029278) (← links)
• Long-term plantation and harvesting planning for industrial plantation forest areas (Q2033406) (← links)
• Political districting to minimize cut edges (Q2099493) (← links)
• Exploring the tradeoffs among forest planning, roads and wildlife corridors: a new approach (Q2119732) (← links)
• Modularity maximization to design contiguous policy zones for pandemic response (Q2171547) (← links)
• Parsimonious formulations for low-diameter clusters (Q2220903) (← links)
• Mixed-integer programming techniques for the connected max-\(k\)-cut problem (Q2246187) (← links)
• Congress seat allocation using mathematical optimization (Q2334468) (← links)
• Computing the largest bond and the maximum connected cut of a graph (Q2663713) (← links)
• LP-based dual bounds for the maximum quasi-clique problem (Q2664003) (← links)
• Downstream protection value: detecting critical zones for effective fuel-treatment under wildfire risk (Q2668685) (← links)
• Local search for constrained graph clustering in biological networks (Q2668745) (← links)
• Constraint-based electoral districting using a new compactness measure: an application to Portugal (Q2676289) (← links)
• Mixed Integer Linear Programming Formulation Techniques (Q2808240) (← links)
• Optimal price zones of electricity markets: a mixed-integer multilevel model and global solution approaches (Q4622891) (← links)
• On Fault-Tolerant Low-Diameter Clusters in Graphs (Q5060794) (← links)
• Imposing Contiguity Constraints in Political Districting Models (Q5080650) (← links)
• Solving the Distance-Based Critical Node Problem (Q5087707) (← links)
• Enriching Solutions to Combinatorial Problems via Solution Engineering (Q5139605) (← links)
• Learning in Combinatorial Optimization: What and How to Explore (Q5144784) (← links)
• Development of a threat index to manage timber production on flammable forest landscapes subject to spatial harvest constraints (Q5879658) (← links)
• Fifty years of operational research in forestry (Q6056891) (← links)
• On the bond polytope (Q6060889) (← links)
• Optimal connected subgraphs: Integer programming formulations and polyhedra (Q6064164) (← links)
• Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)
• Spatial optimization of multiple area land acquisition (Q6164366) (← links)
• Vertex covering with capacitated trees (Q6179715) (← links)
• Linear-size formulations for connected planar graph partitioning and political districting (Q6181361) (← links)
• Wildlife reserve design with connectivity and buffer requirements (Q6195027) (← links)
• A classification method based on a cloud of spheres (Q6491344) (← links)