Abstract
Abstract The problem of finding habitat connections in forest planning can be modeled as a Steiner network problem. Although exact solutions exist for solving Steiner network problems, no methods that can be solved in polynomial time are known. A network modeling procedure for habitat connections is discussed and a heuristic algorithm is presented which is suitable for solving large scale Steiner networks. For. Sci. 38(1):203-207.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
