IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v25y1977i5p741-751.html
   My bibliography  Save this article

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

Author

Listed:
  • Robert S. Garfinkel

    (University of Tennessee, Knoxville, Tennessee)

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.

Suggested Citation

  • Robert S. Garfinkel, 1977. "Minimizing Wallpaper Waste, Part 1: A Class of Traveling Salesman Problems," Operations Research, INFORMS, vol. 25(5), pages 741-751, October.
    • Handle: RePEc:inm:oropre:v:25:y:1977:i:5:p:741-751
    DOI: 10.1287/opre.25.5.741
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.25.5.741
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.25.5.741?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. B. Madhu Rao & Petros Xanthopoulos & Qipeng Phil Zheng, 2020. "Case Article—DeLand Crayon Company: An Application of the Traveling Salesman Problem to Production Scheduling with Sequence-Dependent Setup Times," INFORMS Transactions on Education, INFORMS, vol. 20(2), pages 93-98, January.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:25:y:1977:i:5:p:741-751. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.