Pages that link to "Item:Q5166249"
From MaRDI portal
The following pages link to Imposing Connectivity Constraints in Forest Planning Models (Q5166249):
Displaying 11 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)
- A classification method based on a cloud of spheres (Q6491344) (← links)
