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

Shake-and-Bake Algorithms for Generating Uniform Points on the Boundary of Bounded Polyhedra

Author

Listed:
  • C. G. E. Boender

    (Erasmus University, Rotterdam, The Netherlands)

  • R. J. Caron

    (University of Windsor, Windsor, Ontario, Canada)

  • J. F. McDonald

    (University of Windsor, Windsor, Ontario, Canada)

  • A. H. G. Rinnooy Kan

    (Erasmus University, Rotterdam, The Netherlands)

  • H. E. Romeijn

    (Erasmus University, Rotterdam, The Netherlands)

  • R. L. Smith

    (University of Michigan, Ann Arbor, Michigan)

  • J. Telgen

    (University of Twente, Enschede, The Netherlands)

  • A. C. F. Vorst

    (Erasmus University, Rotterdam, The Netherlands)

Abstract

We present a class of shake-and-bake algorithms for generating (asymptotically) uniform points on the boundary of full-dimensional bounded polyhedra. We also report results of simulations for some elementary test problems.

Suggested Citation

  • C. G. E. Boender & R. J. Caron & J. F. McDonald & A. H. G. Rinnooy Kan & H. E. Romeijn & R. L. Smith & J. Telgen & A. C. F. Vorst, 1991. "Shake-and-Bake Algorithms for Generating Uniform Points on the Boundary of Bounded Polyhedra," Operations Research, INFORMS, vol. 39(6), pages 945-954, December.
    • Handle: RePEc:inm:oropre:v:39:y:1991:i:6:p:945-954
    DOI: 10.1287/opre.39.6.945
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.39.6.945
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.39.6.945?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. A. B. Dieker & Santosh S. Vempala, 2015. "Stochastic Billiards for Sampling from the Boundary of a Convex Set," Mathematics of Operations Research, INFORMS, vol. 40(4), pages 888-901, October.
    2. van Valkenhoef, Gert & Tervonen, Tommi, 2016. "Entropy-optimal weight constraint elicitation with additive multi-attribute utility models," Omega, Elsevier, vol. 64(C), pages 1-12.
    3. Serpil Sayin, 2003. "A Procedure to Find Discrete Representations of the Efficient Set with Specified Coverage Errors," Operations Research, INFORMS, vol. 51(3), pages 427-436, June.
    4. Gryazina, Elena & Polyak, Boris, 2014. "Random sampling: Billiard Walk algorithm," European Journal of Operational Research, Elsevier, vol. 238(2), pages 497-504.

    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:39:y:1991:i:6:p:945-954. 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.