A class of heuristics for the constrained forest problem
From MaRDI portal
Publication:2581555
Recommendations
- Another greedy heuristic for the constrained forest problem
- Complexity and approximation of the constrained forest problem
- A General Approximation Technique for Constrained Forest Problems
- scientific article; zbMATH DE number 742977
- A heuristic algorithm for the mini-max spanning forest problem
- A greedy heuristic for a minimum-weight forest problem
- A \(\frac{3}{2}\) approximation for a constrained forest problem
- scientific article; zbMATH DE number 1439455
- A Heuristic System to Solve Mixed Integér Forest Planning Models
- A branch-and-bound algorithm for the mini-max spanning forest problem
Cites work
Cited in
(11)- A heuristic algorithm for the mini-max spanning forest problem
- A greedy heuristic for a minimum-weight forest problem
- Two heuristics for the rainbow spanning forest problem
- A 3/2-approximation algorithm for some minimum-cost graph problems
- A \(\frac{3}{2}\) approximation for a constrained forest problem
- Stochastic maximum weight forest problem
- scientific article; zbMATH DE number 742977 (Why is no real title available?)
- Complexity and approximation of the constrained forest problem
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Another greedy heuristic for the constrained forest problem
- Undirected forest constraints
This page was built for publication: A class of heuristics for the constrained forest problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2581555)