Skip to main content
SpringerLink
Log in

Integer programming in forestry

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  • Murray, A.T., M. Goycoolea, and A. Weintraub. (2004). “Incorporating Average and Maximum area Restrictions in Harvest Scheduling Models.” Canadian Journal of Forest Research, 34, 456–464.

    Article  Google Scholar 

  • Andalaft, N., P. Andalaft, M. Guignard, M. Adrian, W. Alexis, and W. Andrés. (2003). “A Problem of Forest Harvesting and Road Building Solved Through Model Strengthening and Lagrangean Relaxation.” Operations Research, 51(4), 613–628.

    Article  Google Scholar 

  • Barahona, F., A. Weintaub, and R. Epstein. (1992). “Habitat Dispersion in Forest Planning and the Stable Set Problem.” Operations Research, 40(1).

  • Barrett, T.M. and J.K. Gilless. (2000). “Even-Aged Restrictions with Sub-Graph Adjacency.” Annals of Operations Research, 95, 159–175.

    Article  Google Scholar 

  • Boston, K. and P. Bettinger. (2002). “Combining Tabu Search and Genetic Algorithm Heuristic Techniques to Solve Spatial Harvest Scheduling Problems.” Forest Science, 48, 35–58.

    Google Scholar 

  • Clark, M.M., Meller, and T.P. McDonald. (2000). “A Three-Stage Heuristic for Harvest Scheduling with Access Road Network Development.” Forest Science, 46, 204–218.

  • Caro, F., M. Constantino, I. Martins, and A. Weintraub. (2003). “A 2 Opt. Tabu Search Procedure for the Multi-Period Forest Harvesting Problem with Adjacency, Green-up, Old Growth and Even Flow Constraints.” Forest Science, 49(5), 738–751.

    Google Scholar 

  • Diaz, A., J. Ferland, C. Ribeiro, J. Vera, and A. Weintraub. (2005). “A Tabu Search Approach for Solfing a Difficult Forest Harvesting Machine Location Problem.” In Review process in European Journal of Operational Research.

  • Epstein, R., R. Morales, J. Serón, and A. Weintraub. (1999). “Use of OR Systems in the Chilean Forest Industries.” Interfaces, 29, 7–29.

    Google Scholar 

  • Epstein, R. and A. Weintraub. (2005). A Mixed Integer Programming Approach for Solving Machinery Location and Road Design in Forestry Planning", submitted to Operations Research.

  • Epstein, R., L. Henríquez, J. Catalán, G. Weintraub, and C. Martínez. (2002). “A Combinatorial Auction Improves School Meals in Chile.” Interfaces, 32(6), 1–14.

    Article  Google Scholar 

  • Goycoolea, M., A. Murray, F. Barahona, R. Epstein, and A. Weintraub. (2005). “Harvest Scheduling Subject to Maximum Area Restrictions Exploring Exact Approaches.” To appear in Operations Research.

  • Hogason, H.M. and J.G. Borges. (1998). “Using Dynamic Programming and Overlapping Sub Problems to Address Adjacency in Large Harvest Scheduling Problems.” Forest Science, 44, 526–538.

    Google Scholar 

  • Jones, J.G., J.F.C. Hyde III, and M.L. Meacham. (1986). “Four Analytical Approaches for Integrating Land Management and Transportation Planning on Forest Lands.” Research Paper INT—361, U.S. Department of Agriculture, Forest Service, Intermountain Research Station, p. 33.

  • Kirby, M.W., W. Hager, and P. Wong. (1986). “Simultaneous Planning of Wildland Transportation Alternatives.” In TIMS Studies in the Management Sciences, Vol. 21, New York, Elsevier Science Publishers, pp. 371–387.

  • McDill, M.E., S.A. Rabin, and J. Braze. (2002). “Harvest Scheduling with Area-Based Adjacency Constraints.” Forest Science, 48, 631–642.

    Google Scholar 

  • Murray, A.T. (1999). “Spatial Restrictions in Harvest Scheduling.” Forest Science, 45, 1–8.

    Google Scholar 

  • Murray, A.T. and R.L. Church. (1996). “Analyzing Cliques for Imposing Adjacency Restrictions in Forest Models.” Forest Science, 42, 166–175.

    Google Scholar 

  • Murray, A.T. and A. Weintraub. (2002). “Scale and Unit Specificaton Influences in Harvest Scheduling with Maximum Area Restrictions.” Forest Science, 48, 779–789.

    Google Scholar 

  • Murray, A.T., M. Goycoolea, and A. Weintraub. (2004). “Incorporating Average and Maximum Area Restrictions in Harvest Scheduling Models.” Canadian Journal of Forest Research, 34, 456–464.

    Article  Google Scholar 

  • Navon, D.I. (1971). “Timber RAM... A Long-Range Planning Method for Commercial Timber Lands Under Multiple-Use Management.” USDA Forest Service, Research Paper PSW—70, Berkeley, California, 22.

  • Richards, E.W. and E.A. Gunn. (2000). “A Model and Tabu Search Method to Optimize Sand Harvest and Road Construction Schedules.” Forest Science, 46, 188–203.

    Google Scholar 

  • Vera, J., A. Weintraub, M. Koenig, G. Bravo, M., Guignard, and F. Barahona. (2003). “A Lagrangean Relaxation Approach for a Machinery Location Problem in Forest Harvesting.” Journal of the Brazilian OR Society, 23, 111–128.

    Google Scholar 

  • Vielma, J., A. Murray, D. Ryan, and A. Weintraub. (2004). “Improving Computational Capabilities for Addressing Volume Constraints in Forest Harvest Scheduling Problems”. In Review European Journal of Operations Research.

  • Weintraub, A. and D. Navon. (1976). “A Forest Management Planning Model Integrating Silvicultural and Transportation Activities.” Management Sciences, 22(12), 1299–1309.

    Article  Google Scholar 

  • Weintraub, A., G. Jones, A. Magendzo, M. Meacham, and M. Kirby. (1994). “Heuristic System to Solve Mixed Integer Forest Planning Models.” Operations Research, 42(6), 1010–1024.

    Google Scholar 

  • Weintraub, A., G. Jones, M. Meacham, M. Magendzo, A. Magendzo, and D. Malchuk. (1995). “Procedures for Solving Mixed-Integer Harvest Scheduling Transportation Planning Models.” Canadian Journal of Forest Research, 25, 1618–1626.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Chile, Industrial Engineering Republica 701., Santiago, Chile

    Andres Weintraub P.

Authors
  1. Andres Weintraub P.
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Andres Weintraub P..

Rights and permissions

Reprints and permissions

About this article

Cite this article

Weintraub P., A. Integer programming in forestry. Ann Oper Res 149, 209–216 (2007). https://doi.org/10.1007/s10479-006-0105-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-006-0105-9

Keywords

Search

Navigation