{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,4]],"date-time":"2025-06-04T15:07:27Z","timestamp":1749049647258},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,8,24]],"date-time":"2010-08-24T00:00:00Z","timestamp":1282608000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2012,1]]},"DOI":"10.1007\/s10589-010-9347-1","type":"journal-article","created":{"date-parts":[[2010,8,23]],"date-time":"2010-08-23T19:37:02Z","timestamp":1282592222000},"page":"363-385","source":"Crossref","is-referenced-by-count":12,"title":["A branch-and-price approach for harvest scheduling subject to maximum area restrictions"],"prefix":"10.1007","volume":"51","author":[{"given":"Isabel","family":"Martins","sequence":"first","affiliation":[]},{"given":"Filipe","family":"Alvelos","sequence":"additional","affiliation":[]},{"given":"Miguel","family":"Constantino","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,8,24]]},"reference":[{"key":"9347_CR1","unstructured":"Alvelos, F.: Branch-and-price and multicommodity flows. Ph.D. Thesis, Universidade do Minho, Portugal (2005)"},{"issue":"3","key":"9347_CR2","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1287\/opre.46.3.316","volume":"46","author":"C. Barnhart","year":"1998","unstructured":"Barnhart, C., Johnson, E.L., Nemhauser, G.L., Savelsbergh, M.W.P., Vance, P.H.: Branch-and-price: Column generation for solving huge integer programs. Oper. Res. 46(3), 316\u2013329 (1998)","journal-title":"Oper. Res."},{"issue":"4","key":"9347_CR3","first-page":"569","volume":"44","author":"T.M. Barrett","year":"1998","unstructured":"Barrett, T.M., Gilles, J.K., Davis, L.S.: Economic and fragmentation effects of clearcut restrictions. For. Sci. 44(4), 569\u2013577 (1998)","journal-title":"For. Sci."},{"issue":"1","key":"9347_CR4","first-page":"35","volume":"48","author":"K. Boston","year":"2002","unstructured":"Boston, K., Bettinger, P.: Combining tabu search and genetic algorithm heuristic techniques to solve spatial harvest scheduling problems. For. Sci. 48(1), 35\u201346 (2002)","journal-title":"For. Sci."},{"key":"9347_CR5","first-page":"204","volume":"46","author":"M.M. Clark","year":"2000","unstructured":"Clark, M.M., Mueller, R.D., McDonald, T.P.: A three-stage heuristic for harvest scheduling with access road network development. For. Sci. 46, 204\u2013218 (2000)","journal-title":"For. Sci."},{"issue":"3","key":"9347_CR6","doi-asserted-by":"crossref","first-page":"542","DOI":"10.1287\/opre.1070.0472","volume":"56","author":"M. Constantino","year":"2008","unstructured":"Constantino, M., Martins, I., Borges, J.G.: A new mixed integer programming model for harvest scheduling subject to maximum area restrictions. Oper. Res. 56(3), 542\u2013551 (2008)","journal-title":"Oper. Res."},{"issue":"9","key":"9347_CR7","doi-asserted-by":"crossref","first-page":"1804","DOI":"10.1139\/x03-101","volume":"33","author":"K. Crowe","year":"2003","unstructured":"Crowe, K., Nelson, J., Boyland, M.: Solving the area-restricted harvest-scheduling model using the branch and bound algorithm. Can. J.\u00a0For. Res. 33(9), 1804\u20131814 (2003)","journal-title":"Can. J.\u00a0For. Res."},{"key":"9347_CR8","series-title":"Graduate Texts in Mathematics","volume-title":"Graph Theory","author":"R. Diestel","year":"2000","unstructured":"Diestel, R.: Graph Theory, 2nd edn. Graduate Texts in Mathematics. Springer, Berlin (2000)","edition":"2"},{"key":"9347_CR9","volume-title":"Systems Analysis in Forest Resources","author":"R. Epstein","year":"2003","unstructured":"Epstein, R., Goycoolea, M., Murray, A.T., Weintraub, A.: An adjacency-modeling problem based on constructing harvesting areas. In: Arthaud, G.J., Barrett, T.M. (eds.) Systems Analysis in Forest Resources. Kluwer Academic, Dordrecht (2003)"},{"issue":"3","key":"9347_CR10","first-page":"608","volume":"48","author":"A.O. Falc\u00e3o","year":"2002","unstructured":"Falc\u00e3o, A.O., Borges, J.G.: Combining random and systematic search procedures for solving spatially constrained forest management scheduling models. For. Sci. 48(3), 608\u2013621 (2002)","journal-title":"For. Sci."},{"key":"9347_CR11","volume-title":"Graphs and Algorithms","author":"M. Gondran","year":"1984","unstructured":"Gondran, M., Minoux, M.: Graphs and Algorithms. Wiley, New York (1984)"},{"issue":"3","key":"9347_CR12","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1287\/opre.1040.0169","volume":"53","author":"M. Goycoolea","year":"2005","unstructured":"Goycoolea, M., Murray, A.T., Barahona, F., Epstein, R., Weintraub, A.: Harvest scheduling subject to maximum area restrictions: exploring exact approaches. Oper. Res. 53(3), 90\u2013500 (2005)","journal-title":"Oper. Res."},{"issue":"2","key":"9347_CR13","first-page":"149","volume":"55","author":"M. Goycoolea","year":"2009","unstructured":"Goycoolea, M., Murray, A.T., Vielma, J.P., Weintraub, A.: Evaluating approaches for solving the area restricted model in harvest scheduling. For. Sci. 55(2), 149\u2013165 (2009)","journal-title":"For. Sci."},{"key":"9347_CR14","volume-title":"Column Generation","year":"2005","unstructured":"Guy, D., et al. (eds.): Column Generation. Springer, Berlin (2005)"},{"key":"9347_CR15","unstructured":"ILOG: ILOG CPLEX 11.0\u2014User\u2019s Manual (2007)"},{"key":"9347_CR16","doi-asserted-by":"crossref","first-page":"468","DOI":"10.1139\/x93-065","volume":"23","author":"C. Lockwood","year":"1993","unstructured":"Lockwood, C., Moore, T.: Harvest scheduling with spatial constraints: a simulated annealing approach. Can. J. For. Res. 23, 468\u2013478 (1993)","journal-title":"Can. J. For. Res."},{"issue":"6","key":"9347_CR17","doi-asserted-by":"crossref","first-page":"1007","DOI":"10.1287\/opre.1050.0234","volume":"53","author":"M.E. L\u00fcbbecke","year":"2005","unstructured":"L\u00fcbbecke, M.E., Desrosiers, J.: Selected topics in column generation. Oper. Res. 53(6), 1007\u20131023 (2005)","journal-title":"Oper. Res."},{"key":"9347_CR18","unstructured":"Martins, I., Constantino, M., Borges, J.G.: Forest management models with spatial structure constraints. Working Paper No. 2\/1999, C.I.O.\/Faculdade de Ci\u00eancias de Lisboa (1999)"},{"issue":"2","key":"9347_CR19","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1016\/j.ejor.2003.07.021","volume":"161","author":"I. Martins","year":"2005","unstructured":"Martins, I., Constantino, M., Borges, J.G.: A column generation approach for solving a non-temporal forest harvest model with spatial structure constraints. Eur. J.\u00a0Oper. Res. 161(2), 478\u2013498 (2005)","journal-title":"Eur. J.\u00a0Oper. Res."},{"issue":"4","key":"9347_CR20","first-page":"631","volume":"48","author":"M.E. McDill","year":"2002","unstructured":"McDill, M.E., Rebain, S.A., Braze, J.: Harvest scheduling with area-based adjacency constraints. For. Sci. 48(4), 631\u2013642 (2002)","journal-title":"For. Sci."},{"issue":"1","key":"9347_CR21","first-page":"45","volume":"45","author":"A.T. Murray","year":"1999","unstructured":"Murray, A.T.: Spatial restrictions in harvest scheduling. For. Sci. 45(1), 45\u201352 (1999)","journal-title":"For. Sci."},{"issue":"4","key":"9347_CR22","first-page":"779","volume":"48","author":"A.T. Murray","year":"2002","unstructured":"Murray, A.T., Weintraub, A.: Scale and unit specification influences in harvest scheduling with maximum area restrictions. For. Sci. 48(4), 779\u2013789 (2002)","journal-title":"For. Sci."},{"key":"9347_CR23","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1989","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley, New York (1989)"},{"issue":"4","key":"9347_CR24","first-page":"608","volume":"49","author":"E.W. Richards","year":"2000","unstructured":"Richards, E.W., Gunn, E.A.: A model and tabu search to optimize stand harvest and road construction schedules. For. Sci. 49(4), 608\u2013618 (2000)","journal-title":"For. Sci."},{"key":"9347_CR25","doi-asserted-by":"crossref","first-page":"1126","DOI":"10.1139\/x03-039","volume":"33","author":"E.W. Richards","year":"2003","unstructured":"Richards, E.W., Gunn, E.A.: Tabu search design for difficult forest management optimization problems. Can. J.\u00a0For. Res. 33, 1126\u20131133 (2003)","journal-title":"Can. J.\u00a0For. Res."},{"issue":"2","key":"9347_CR26","doi-asserted-by":"crossref","first-page":"1246","DOI":"10.1016\/j.ejor.2005.09.016","volume":"176","author":"J.P. Vielma","year":"2007","unstructured":"Vielma, J.P., Murray, A.T., Ryan, D.M., Weintraub, A.: Improving computational capabilities for adressing volume constraints in forest harvest scheduling problems. Eur. J.\u00a0Oper. Res. 176(2), 1246\u20131264 (2007)","journal-title":"Eur. J.\u00a0Oper. Res."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-010-9347-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-010-9347-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-010-9347-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T11:36:38Z","timestamp":1559302598000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-010-9347-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,8,24]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,1]]}},"alternative-id":["9347"],"URL":"https:\/\/doi.org\/10.1007\/s10589-010-9347-1","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,8,24]]}}}