A new approach to the analysis of random methods for detecting necessary linear inequality constraints-Reference-Cited by-同舟云学术

A new approach to the analysis of random methods for detecting necessary linear inequality constraints

Published:1989-01 Issue:1-3 Volume:43 Page:97-102
ISSN:0025-5610
Container-title:Mathematical Programming
language:en
Short-container-title:Mathematical Programming

Author:

Caron Richard J.,McDonald J. F.

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics,Software

Link

http://link.springer.com/content/pdf/10.1007/BF01582281.pdf

Reference10 articles.

1. M. Abramowitz and I.A. Stegun, eds.,Handbook of Mathematical Functions (National Bureau of Standards, Washington, DC, 1964).

2. H.C.P. Berbee, C.G.E. Boender, A.H.G. Rinooy Kan, C.L. Sheffer, R.L. Smith and T. Telgen, “Hit-and-run algorithms for the identification of nonredundant linear inequalities,”Mathematical Programming 37 (1987) 184–207.

3. A. Boneh, “Preduce—A probabilistic algorithm identifying redundancy by a random feasible point generator (RFPG),” in: M.H. Karwan, V. Lotfi, J. Telgen and S. Zionts, eds.,Redundancy in Mathematical Programming (Springer-Verlag, Berlin, 1983) pp. 108–134.

4. A. Boneh and A. Golan, “Constraints' redundancy and feasible region boundedness by random feasible point generator (RFPG), “contributed paper, Third European congress on operations research, EURO III (Amsterdam, The Netherlands, April 1979).

5. R.J. Caron, J.F. McDonald, R.L. Smith and J. Telgen, “Random methods for detecting necessary linear inequality constraints: Stopping Rules,” Windsor Mathematics Report WMR 86-03, Department of Mathematics and Statistics, University of Windsor (Windsor, Ontario, 1986).

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Optimal strategy of coupon subset collection when each package contains half of the coupons;Information Processing Letters;2014-12

2. Approximating Shortest Paths in Large-Scale Networks with an Application to Intelligent Transportation Systems;INFORMS Journal on Computing;1998-05

3. Convergence properties of hit–and–run samplers;Communications in Statistics. Stochastic Models;1998-01

4. Redundancy;Advances in Sensitivity Analysis and Parametric Programming;1997

5. The coupon-collector problem revisited — a survey of engineering problems and computational methods;Communications in Statistics. Stochastic Models;1997-01