Shake-and-Bake Algorithms for Generating Uniform Points on the Boundary of Bounded Polyhedra
Published Online:1 Dec 1991https://doi.org/10.1287/opre.39.6.945
- Cited by
- Przegląd Statystyczny, Vol. 68, No. 4
- Operations Research Letters, Vol. 48, No. 6
- IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Vol. 37, No. 11
- 30 October 2018 | International Journal of Computer Mathematics: Computer Systems Theory, Vol. 3, No. 4
- 12 March 2015 | Mathematics of Operations Research, Vol. 40, No. 4
- CRAN: Contributed Packages
- 20 September 2011
- 1 June 2003 | Operations Research, Vol. 51, No. 3
- Computers & Chemical Engineering, Vol. 23, No. 11-12
- Communications in Statistics. Stochastic Models, Vol. 14, No. 4
- Annals of Operations Research, Vol. 59, No. 1
- Journal of Global Optimization, Vol. 5, No. 2
- Mathematical Programming, Vol. 54, No. 1-3
Volume 39, Issue 6
November-December 1991
Pages 866-1026
Article Information
Metrics
Information
- Published Online:December 01, 1991
© 1991 INFORMS
Cite as
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 39(6):945-954.
https://doi.org/10.1287/opre.39.6.945
Keywords
