-
Tóth, S.F., McDill, M.E., George, S., Könnyű, N. A Strengthening
Procedure for the Path Formulation of the Area-Based Adjacency Problem in
Harvest Scheduling Models. Submitted to Mathematical and Computational Forestry
and Natural Resource Science.
Dataset(s): Bear Town, Five Points, Kittaning4, PackForest, PhyllisLeeper Tóth, S.F., McDill, M.E., George, S., Könnyű, N. Lazy Constraints in Area-Based Adjacency Formulations of Harvest
Scheduling Models. Submitted to Forest Science.
Dataset(s): Bear Town, Five Points, Kittaning4, PackForest, PhyllisLeeper Könnyű, N., Tóth, S.F. Cutting Plane Method for Solving Harvest
Scheduling Models with Maximum Clearcut Size Restrictions. Submitted to
Operations Research.
Dataset(s): Bear Town, Five Points, Kittaning4, PackForest, PhyllisLeeper
- Gunn, E.A., Richards, E.W. Optimizing stand level forest
harvesting using a tradeoff objective function. Fried, Jeremy, Leefers,
Larry, and Vasievich, J. M. Proceedings of the Seventh Symposium on
Systems Analysis in Forest Resources NC-GTR-208. 1997. North Central
Research Station, St. Paul Mn.
Dataset(s): Shulkell
- Richards,
E.W. A tabu search method for a tactical forest planning problem.
1-248. 1997. Technical University of Nova Scotia. 9-1-1997.
Dataset(s): Shulkell
- Richards,
E.W., Gunn, E.A. A model and tabu search method to optimize stand
harvest and road construction schedules. Forest Science 46[2], 188-203.
2000.
Dataset(s): Shulkell
- Richards,
E.W., Gunn, E.A., 2003. Tabu search design for difficult forest
management optimization problems.Can. J. For. Res. 33, 1126-1133.
Dataset(s): Shulkell
- Murray, A., Church, R. Heuristic Solution Approaches to Operational Forest Planning Problems. OR Spektrum 17, 193-203. 1995.
Dataset(s): Bloedel
Bettinger, P., D. Graetz, K. Boston, J. Sessions, and W. Chung. 2002.
Eight heuristic planning techniques applied to three increasingly
difficult wildlife planning problems. Silva Fennica. 36:561-584. WLC
- Murray,
A.T. and A. Weintraub. 2002. Scale and unit specification influences in
harvest scheduling with maximum area restrictions. Forest Science, 48,
2002.
Dataset(s): Buttercreek
- Epstein,
R., Goycoolea, M., Murray, A.T. and A. Weintraub. 2003. An
adjacency-modeling problem based on constructing harvesting areas. In
Systems Analysis in Forest Resources, edited by G.J. Arthaud and T.M.
Barrett. 279-289 (Dordrecht: Kluwer Scientific). Dataset(s): Buttercreek, El Dorado
-
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.
Dataset(s): Buttercreek, El Dorado
-
A.T. Murray, D. M. Ryan, J.P. Vielma, and A. Weintraub."Improved
Solution Techniques for Multi-Period Area-Based Forest Harvest
Scheduling Problems". In "System analysis in forest resources:
proceedings of the 2003 symposium." Gen. Tech. Rep. PNW-GTR-656. M.
Bevers, T.M. Barrett, tech. comps. 2005. U.S. Department of
Agriculture, Portland, OR. Page 285.
Dataset(s): El Dorado
-
Goycoolea M., Murray A., Barahona F., Epstein R., Weintraub A., 2005,
Harvest scheduling subject to maximum area restrictions: exploring
exact approaches. Operations Research 53, 490-500.
Dataset(s): Buttercreek, El Dorado
-
A.T. Murray, D. M. Ryan, J.P. Vielma, and A. Weintraub. 2005. Improving
Computational Capabilities for Addressing Volume Constraints in Forest
Harvest Scheduling Problems Accepted in European Journal of Operational
Research.
Dataset(s): Buttercreek, El Dorado
- Crowe,
K., Nelson, J. 2005. An evaluation of the simulated annealing algorithm
for solving the ARM against optimal benchmarks. Can. J. For. Res.
35:2500-2509.
Datasets: Naka, Stafford, Hardwicke, Gavin, Kootenay1, Kootenay2, Kootenay3
- Crowe,
Kevin A.and Nelson, J.D. An evaluation of the simulated annealing
algorithm for solving the area-restricted harvest scheduling model
against optimal benchmarks Can. J. For. Res. Vol 35 Issue 10,
p2500�2509 (2005).
Datasets: Naka, Stafford, Hardwicke, Gavin, Kootenay1, Kootenay2, Kootenay3
- Gunn E.A., Richards E.W. Solving the adjacency problem with stand-centred constraints, Can. J. For. Res. 35: 832�842 (2005).
|
