Computer application for the cutting problem of a board

Authors

  • María Elena Blandón Dávila UNAN-Managua/FAREM-Estelí
  • Victor Manuel Valdivia UNAN-Managua/FAREM-Estelí
  • Julia Argentina Granera UNAN-Managua/FAREM-Estelí

DOI:

https://doi.org/10.5377/farem.v0i25.5671

Keywords:

cutting of a board, Greedy algorithm, computer application.

Abstract

This article shows the application of a computer tool based in heuristic algorithms which are efficient for cutting problems of boards using the Greedy algorithm proposed by Martello y Toth in 1990 (Constructive algorithm). (Canovas, Huertas & Sempere, 2011) In this particular case the Greedy algorithm is used to find a first solution (as a starting point for another heuristic) For the development of this application it was used Visual Studio 2010.

Downloads

Download data is not yet available.
Abstract
988
PDF (Español (España)) 932
HTML (Español (España)) 1538

Downloads

Published

2018-03-07

How to Cite

Blandón Dávila, M. E., Valdivia, V. M., & Granera, J. A. (2018). Computer application for the cutting problem of a board. Revista Científica De La FAREM-Estelí, (25), 31–37. https://doi.org/10.5377/farem.v0i25.5671

Issue

No. 25 (2018)

Section

Science Education

License

© Revista Científica de FAREM-Estelí