Minimizing Wallpaper Waste, Part 1: A Class of Traveling Salesman Problems

Robert S. Garfinkel
Additional contact information
Robert S. Garfinkel: University of Tennessee, Knoxville, Tennessee

Operations Research, 1977, vol. 25, issue 5, 741-751

Abstract: We address the problem of wallpapering a room so as to minimize the paper wasted. We show that the problem is equivalent to finding a shortest hamiltonian chain in a highly structured graph. When the chain connects two equivalent nodes (traveling salesman problem), the “nearest-neighbor” technique yields an optimal solution.

Date: 1977
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.25.5.741 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:25:y:1977:i:5:p:741-751

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().