Skip to Main Content
Keywords: Network flow problem
Close
Follow your search
Access your saved searches in your account

Would you like to receive an alert when new items match your search?
Close Modal
Sort by
Journal Articles
Journal of Forest Economics (2015) 21 (4): 250–268.
Published: 01 December 2015
... of the capacitated network flow problem based on an integer programming (IP) approach with two sets of inter-dependent decisions. One set of decisions involves finding a feasible k-tree path network through segment linkages (routing flow) at a minimum variable cost, while another attends to the schedule...

or Create an Account

Close Modal
Close Modal