Optimización del trozado de fustes en el nivel de unidad de manejo forestal
- Autores
- Yapura, Pablo Fernando; Sañudo, Gastón; Keller, A. E.; Fassola, H. E.; Crechi, E. H.; Winck, R. A.; Barth, S.; Caraballo, Horacio
- Año de publicación
- 2019
- Idioma
- español castellano
- Tipo de recurso
- documento de conferencia
- Estado
- versión publicada
- Descripción
- In planning forest harvests the bucking optimization problem arises at tree-level as well as standand forest management unit-level. In a former project, Dynamic Programming has been coded in spreadsheets for obtaining optimal bucking patterns at tree-level for major species in NE Argentina. At the stand- and forest-level the problem has been formulated as a linear programming, master problem, and using a longest path algorithm for sub-problem, bucking pattern generation. GLPK and Java were used for coding OptimEsus, a software tool aimed at solving problems at these levels. A three stand problem was solved as a prototypical example.
Laboratorio de Investigación de Sistemas Ecológicos y Ambientales
Instituto Nacional de Tecnología Agropecuaria - Materia
-
Ciencias Agrarias
Bucking pattern
Longest path algorithm
Linear programming - Nivel de accesibilidad
- acceso abierto
- Condiciones de uso
- http://creativecommons.org/licenses/by-nc-sa/4.0/
- Repositorio
- Institución
- Universidad Nacional de La Plata
- OAI Identificador
- oai:sedici.unlp.edu.ar:10915/125356
Ver los metadatos del registro completo
id |
SEDICI_ae10b65a98ed6ed09e805edb3f4ab40e |
---|---|
oai_identifier_str |
oai:sedici.unlp.edu.ar:10915/125356 |
network_acronym_str |
SEDICI |
repository_id_str |
1329 |
network_name_str |
SEDICI (UNLP) |
spelling |
Optimización del trozado de fustes en el nivel de unidad de manejo forestalTree-stem bucking optimization at the forest management unit levelYapura, Pablo FernandoSañudo, GastónKeller, A. E.Fassola, H. E.Crechi, E. H.Winck, R. A.Barth, S.Caraballo, HoracioCiencias AgrariasBucking patternLongest path algorithmLinear programmingIn planning forest harvests the bucking optimization problem arises at tree-level as well as standand forest management unit-level. In a former project, Dynamic Programming has been coded in spreadsheets for obtaining optimal bucking patterns at tree-level for major species in NE Argentina. At the stand- and forest-level the problem has been formulated as a linear programming, master problem, and using a longest path algorithm for sub-problem, bucking pattern generation. GLPK and Java were used for coding OptimEsus, a software tool aimed at solving problems at these levels. A three stand problem was solved as a prototypical example.Laboratorio de Investigación de Sistemas Ecológicos y AmbientalesInstituto Nacional de Tecnología Agropecuaria2019info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionResumenhttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdf117-119http://sedici.unlp.edu.ar/handle/10915/125356spainfo:eu-repo/semantics/altIdentifier/issn/2686-7110info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/4.0/Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-29T11:30:09Zoai:sedici.unlp.edu.ar:10915/125356Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-29 11:30:09.405SEDICI (UNLP) - Universidad Nacional de La Platafalse |
dc.title.none.fl_str_mv |
Optimización del trozado de fustes en el nivel de unidad de manejo forestal Tree-stem bucking optimization at the forest management unit level |
title |
Optimización del trozado de fustes en el nivel de unidad de manejo forestal |
spellingShingle |
Optimización del trozado de fustes en el nivel de unidad de manejo forestal Yapura, Pablo Fernando Ciencias Agrarias Bucking pattern Longest path algorithm Linear programming |
title_short |
Optimización del trozado de fustes en el nivel de unidad de manejo forestal |
title_full |
Optimización del trozado de fustes en el nivel de unidad de manejo forestal |
title_fullStr |
Optimización del trozado de fustes en el nivel de unidad de manejo forestal |
title_full_unstemmed |
Optimización del trozado de fustes en el nivel de unidad de manejo forestal |
title_sort |
Optimización del trozado de fustes en el nivel de unidad de manejo forestal |
dc.creator.none.fl_str_mv |
Yapura, Pablo Fernando Sañudo, Gastón Keller, A. E. Fassola, H. E. Crechi, E. H. Winck, R. A. Barth, S. Caraballo, Horacio |
author |
Yapura, Pablo Fernando |
author_facet |
Yapura, Pablo Fernando Sañudo, Gastón Keller, A. E. Fassola, H. E. Crechi, E. H. Winck, R. A. Barth, S. Caraballo, Horacio |
author_role |
author |
author2 |
Sañudo, Gastón Keller, A. E. Fassola, H. E. Crechi, E. H. Winck, R. A. Barth, S. Caraballo, Horacio |
author2_role |
author author author author author author author |
dc.subject.none.fl_str_mv |
Ciencias Agrarias Bucking pattern Longest path algorithm Linear programming |
topic |
Ciencias Agrarias Bucking pattern Longest path algorithm Linear programming |
dc.description.none.fl_txt_mv |
In planning forest harvests the bucking optimization problem arises at tree-level as well as standand forest management unit-level. In a former project, Dynamic Programming has been coded in spreadsheets for obtaining optimal bucking patterns at tree-level for major species in NE Argentina. At the stand- and forest-level the problem has been formulated as a linear programming, master problem, and using a longest path algorithm for sub-problem, bucking pattern generation. GLPK and Java were used for coding OptimEsus, a software tool aimed at solving problems at these levels. A three stand problem was solved as a prototypical example. Laboratorio de Investigación de Sistemas Ecológicos y Ambientales Instituto Nacional de Tecnología Agropecuaria |
description |
In planning forest harvests the bucking optimization problem arises at tree-level as well as standand forest management unit-level. In a former project, Dynamic Programming has been coded in spreadsheets for obtaining optimal bucking patterns at tree-level for major species in NE Argentina. At the stand- and forest-level the problem has been formulated as a linear programming, master problem, and using a longest path algorithm for sub-problem, bucking pattern generation. GLPK and Java were used for coding OptimEsus, a software tool aimed at solving problems at these levels. A three stand problem was solved as a prototypical example. |
publishDate |
2019 |
dc.date.none.fl_str_mv |
2019 |
dc.type.none.fl_str_mv |
info:eu-repo/semantics/conferenceObject info:eu-repo/semantics/publishedVersion Resumen http://purl.org/coar/resource_type/c_5794 info:ar-repo/semantics/documentoDeConferencia |
format |
conferenceObject |
status_str |
publishedVersion |
dc.identifier.none.fl_str_mv |
http://sedici.unlp.edu.ar/handle/10915/125356 |
url |
http://sedici.unlp.edu.ar/handle/10915/125356 |
dc.language.none.fl_str_mv |
spa |
language |
spa |
dc.relation.none.fl_str_mv |
info:eu-repo/semantics/altIdentifier/issn/2686-7110 |
dc.rights.none.fl_str_mv |
info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by-nc-sa/4.0/ Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) |
eu_rights_str_mv |
openAccess |
rights_invalid_str_mv |
http://creativecommons.org/licenses/by-nc-sa/4.0/ Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) |
dc.format.none.fl_str_mv |
application/pdf 117-119 |
dc.source.none.fl_str_mv |
reponame:SEDICI (UNLP) instname:Universidad Nacional de La Plata instacron:UNLP |
reponame_str |
SEDICI (UNLP) |
collection |
SEDICI (UNLP) |
instname_str |
Universidad Nacional de La Plata |
instacron_str |
UNLP |
institution |
UNLP |
repository.name.fl_str_mv |
SEDICI (UNLP) - Universidad Nacional de La Plata |
repository.mail.fl_str_mv |
alira@sedici.unlp.edu.ar |
_version_ |
1844616181253668864 |
score |
13.070432 |