Constructing and selecting adjacency constraints

INFOR

Volumn 34, Issue 3, 1996, Pages 232-247

  Murray, Alan T ^a   Church, Richard L ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Adjacency constraints; Constraint aggregation; Forest planning; Integer program ming and linear programming

Indexed keywords

EID: 0043035168     PISSN: 03155986     EISSN: None     Source Type: Journal    
DOI: 10.1080/03155986.1996.11732306     Document Type: Article

References (32)

1. Barahona, F., Weintraub, A. and Epstein, R. (1992). "Habitat dispersion in forest planning and stable set problem." Operations Research 40 Supp. No. 1, S14-S21.
2. Bradley, G.H.(1971). "Transformation of integer programs to knapsack problems." Discrete Mathematics 1, 29-45.
3. Bradley, G.H., Hammer, P.L. and Wolsey, L. (1974). "Coefficient reduction for inequalities in 0-1 variables." Mathematical Programming 7, 263-282.
4. Chong, S.K. and Beck, J.A. (1991). "The effect of land classification and stratification on deriva-tion of timber supply and allowable cut in harvest scheduling." Can. J. For. Res. 21, 1334-1342.
5. Clements, S.E., Dallain, P.L. and Jamnick, M.S. (1990). "An operational, spatially constrained harvest scheduling model." Can. J. For. Res. 20, 1438-1447
6. Covington, W.W., Wood, D.B., Young, D.L., Dykstra, D.P. and Garrett, L.D. (1988). "TEAMS: a decision support system for multiresource management." Journal of Forestry 86(8), 25-33.
7. Elimam, A.A. and Elmaghraby, S.E. (1985). "On the reduction method for integer linear programs, II." Discrete Applied Mathematics 12, 241-260.
8. Gross, T.E. and Dykstra, D.P. (1988). "Harvest scheduling with nonadjacency constraints." In Proceedings, Society of American foresters national convention, 16-19 Oct. 1988, Washington B.C. Society of American Foresters, Washington, D.C., 310-315.
9. Gross, T.E. (1989). "Use of graph theory to analyze constraints on juxtaposition of timber stands." Masters Thesis, Northern Arizona University, Flagstaff, Arizona. 153 p.
10. Jamnick, M.S., Davis, L.S. and Gilless, J.K. (1990). "Influence of land classification systems on timber harvest scheduling models." Can. J. For. Res. 20, 172-178
11. Jamnick, M.S. and Walters, K. (1991). "arvest blocking, adjacency constraints and timber harvest volumes." 1991 Systems Analysis in Forest Resources Symposium, Charleston, South Carolina, March 3-7, 255-261.
12. Jones, J.G., Meneghin, B.J. and Kirby, M.W. (1991). "Formulating adjacency constraints in linear optimization models for scheduling projects in tactical planning." Forest Science 37, 1283-1297.
13. Mealey, S.P., Lipscomb, J.F. and Johnson, K.N. (1982). "Solving the habitat dispersion problem in forest planning." Trans. N. Am. Wildl. Natur. Resour. Conf. 47, 142-153.
14. Meneghin, B.J., Kirby, M.W. and Jones, J.G. (1988). "An algorithm for writing adjacency constraints efficiently in linear programming models." In The 1988 Symposium on systems analysis in forest resources. U.S. Forest Service Rocky Mountain Forest and Range Experiment Station General Technical Report RM-161, 46-53.
15. Murray, A.T. and Church, R.L. (1995). "Measuring the efficacy of adjacency constraint structure in forest planning models." Can. J. For. Res. to appear.
16. Nelson, J.D. and Brodie (1990). "Comparison of random search algorithm and mixed integer programming for solving area-based forest plans." Can. J. For. Res. 20, 934-942.
17. Nelson, J.D., Brodie, J.D. and Sessions, J. (1991). "Integrating short-term, area-based logging plans with long-term harvest scheduling." Forest Science 37, 101-122.
18. Nelson, J.D. and Finn, S.T. (1991). "The influence of cut-block size and adjacency rules on harvest levels and road networks." Can. J. For. Res. 21, 595-600.
19. Nelson, J.D. and Howard, A.F. (1991). "A three-stage heuristic procedure for allocating spatially and temporally feasible cutting rights on public lands." Can. J. For. Res. 21, 726-768.
20. Nemhauser, G.L. and Wolsey, L.A. (1988). Integer and Combinatorial Optimization, Wiley and Sons, New York.
21. O'Hare, A.J., Faaland, B.H. and Bare, B.B. (1989). "Spatially constrained timber harvest cheduling." Can. J. For. Res. 19, 715-724
22. Onyekwelu, D.C. (1983). "Computational viability of a constraint aggregation scheme for integer linear programming problems." Operations Research 31, 795-801.
23. Padberg, M.W. (1972). "Equivalent knapsack-type formulations of bounded integer linear programs: an alternative approach." Naval Research Logistics Quarterly 19, 699-708.
24. Roise, J.P. (1990). "Multicriteria nonlinear programming for optimal spatial allocation of stands." Forest Science 36, 487-501.
25. Rosing, K.E., ReVelle, C.S. and Rosing-Vogelaar, H. (1992). "Fractions in the location setcovering problem." Environment and Planning B 19, 125-130.
26. Thompson, E.F., Halterman, B.C., Lyon, T.J. and Miller, R.L. (1973). "Integrating timber and wildlife management planning." Forestry Chronicle 49, 247-250.
27. Torregas, C. and ReVelle, C.S. (1972). "Location under time or distance constraints." Papers of the Regional Science Association 28, 133-143.
28. Torres R., J.M. and Brodie, J.D. (1990). "Adjacency constraints in harvest scheduling: an aggregation heuristic." Can. J. For. Res. 20, 978-986.
29. Torres R., J.M., Brodie, J.D. and Sessions, J. (1991). "The use of relaxation to solve the habitat dispersion problem." Working paper.
30. Williams, H.P. (1974). "Experiments in the formulation of integer programming problems." Mathematical Programming Study 2, 180-197.
31. Williams, H.P. (1990). Model building in mathematical programming, third edition, Wiley and Sons, England.
32. Yoshimoto, A. and Brodie, J.D. (1994). "Comparative analysis of algorithms to generate adjacency constraints." Can. J. For. Res. 24, 1277-1288.