article · ePrints Soton (University of Southampton) · 2003

Improved dynamic programming algorithm for unconstrained two-dimensioal cutting stock problem

Cited by 0Abstract and details only

Abstract

The index has no abstract for this paper.

Cite this paper

Song, X., & Nie, Y. (2003). Improved dynamic programming algorithm for unconstrained two-dimensioal cutting stock problem. ePrints Soton (University of Southampton).

MLA 9

Song, Xiang, and Yuhe Nie. “Improved dynamic programming algorithm for unconstrained two-dimensioal cutting stock problem.” ePrints Soton (University of Southampton), 2003.

Chicago

Song, Xiang, and Yuhe Nie. 2003. “Improved dynamic programming algorithm for unconstrained two-dimensioal cutting stock problem.” ePrints Soton (University of Southampton).

Harvard

Song, X. and Nie, Y. (2003) ‘Improved dynamic programming algorithm for unconstrained two-dimensioal cutting stock problem’, ePrints Soton (University of Southampton).

BibTeX

@article{song2003improved,
  title = {{Improved dynamic programming algorithm for unconstrained two-dimensioal cutting stock problem}},
  author = {Song, Xiang and Nie, Yuhe},
  journal = {ePrints Soton (University of Southampton)},
  year = {2003}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.