A Problem of Forest Harvesting and Road Building Solved Through Model Strengthening and Lagrangean Relaxation

References

• Barahona F., Weintraub A., Epstein R. Habitat dispersion in forest planning and the stable set problem. Oper. Res. (1992) 40(S1):S14–S21Link, Google Scholar
• Bienstock D., Günlük O. Capacitated network design-Polyhedral structure and computations. INFORMS J. Comput. (1996) 8:243–259Link, Google Scholar
• Chajakis E., Guignard M., Ryu C. Lagrangean bounds and heuristics for integrated resource planning in forestry. Proc. International Symposium Systems Analysis Management Decisions Forestry. (1994) Valdivia, Chile:350–363Google Scholar
• Guignard M., Ryu C., Spielberg K. Model tightening for integrated timber harvest and transportation planning. Proc. International Symposium Systems Analysis Management Decisions Forestry. (1994) Valdivia, Chile:364–369Google Scholar
• Guignard M., Ryu C., Spielberg K. Model tightening for integrated timber harvest and transportation planning. Eur. J. Oper. Res. (1998) 111:448–460Crossref, Google Scholar
• Held M., Karp R. M. The traveling salesman problem, and minimum spanning trees. Oper. Res. (1970) 18:1138–1162Link, Google Scholar
• Held M., Karp R. M. The traveling salesman problem, and minimum spanning trees, part II. Math. Programming (1971) 1:6–25Crossref, Google Scholar
• Held M., Wolfe P., Crowder H. Validation of subgradient optimization. Math. Programming (1974) 6:62–88Crossref, Google Scholar
• Jones J. G., Hyde III J. F. C., Meacham M. L. Four analytical approaches for integrating land management and transportation planning on forest lands. (1986) . Research paper INT—361, U.S. Department of Agriculture, Forest Service, Intermountain Research Station, Ogden, UTGoogle Scholar
• Kirby M. W., Hager W., Wong P. Simultaneous planning of wildland transportation alternatives. TIMS Studies in the Management Sciences (1986) 21:371–387Google Scholar
• Kirby M. W., Wong P., Hager W. A., Huddleston M. E.Guide to the Integrated Resources Planning Model (1980) (USDA Management Sciences Staff, Berkeley, CA) Google Scholar
• Magnanti T. L., Mirchandani P., Vachani R. Modeling and solving the two-facility capacitated network loading problem. Math. Programming (1995) 44:142–157Google Scholar
• Murray A. T., Church R. L. Measuring the efficacy of adjacency constraint structure in forest planning models. Canadian J. Forest Res. (1995) 25:1416–1424Crossref, Google Scholar
• Nelson J., Brodie D. Comparison of a random search algorithm and mixed integer programming for solving area-based forest planning. Canadian J. Forestry (1990) 20(7):934–942Crossref, Google Scholar
• Schrijwer A. Theory of linear and integer programming. Wiley-Interscience Series in Discrete Mathematics and Optimization (1986) (John Wiley and Sons, New York) Google Scholar
• Sessions J., Sessions J. B. Tactical harvest planning. Proc. 1991 Society American Foresters National Convention. (1991) (SAF Publication 91-01, Bethesda, MD) 362–368Google Scholar
• Sullivan E., Barnes B. Timber transport model, version 2.0, Res. (1980) . report UCB-ITS.RR-79-18, University of California, Berkeley, CAGoogle Scholar
• Sullivan E. C. A transportation analysis technique for natural resource management. Proc. Intl. Conf. Trans. Res. (1973) Bruges, Belgium:772–788Google Scholar
• Weintraub A., Navon D. A forest management planning model integrating sylvicultural and transportation activities. Management Sci. (1976) 22(12):1299–1309Link, Google Scholar
• Weintraub A., Jones G. J., Magendzo A., Meacham M. L., Kirby M. W. A heuristic system to solve mixed integer forest planning models. Oper. Res. (1994) 42:1010–1024Link, Google Scholar
• Weintraub A., Jones G. J., Magendzo A., Meacham M. L., Magendzo A., Malchuk D. Heuristic procedures for solving mixed-integer harvest scheduling—Transportation planning models. Canadian J. Forest Res. (1995) 25:1618–1626Crossref, Google Scholar
• Yoshimoto A., Brodie J. D., Sessions J. A new heuristic to solve spatially constrained long term harvest scheduling problems. Forest Sci. (1994) 40(3):365–396Google Scholar