TY  - JOUR
AU  - Lovász, László
TI  - Hit-and-run Mixes Fast
JF  - MATHEMATICAL PROGRAMMING
J2  - MATH PROGRAM
VL  - 86
PY  - 1999
IS  - 3
SP  - 443
EP  - 461
PG  - 19
SN  - 0025-5610
DO  - 10.1007/s101070050099
UR  - https://m2.mtmt.hu/api/publication/1086764
ID  - 1086764
N1  - Cited By :155            
            Export Date: 7 January 2022            
            CODEN: MPSBE            
            Correspondence Address: Lovász, L.; Microsoft Research, One Microsoft Way, Redmond, WA 98052-6399, United States; email: lovasz@microsoft.com
AB  - It is shown that the "hit-and-run" algorithm for sampling from a convex body K (introduced by R.L. Smith) mixes in time O*(n(2)R(2)/r(2)), where R and r are the radii of the inscribed and circumscribed balls of K. Thus after appropriate preprocessing, hit-and-run produces an approximately uniformly distributed sample point in time O*(n(3)), which matches the best known bound for other sampling algorithms. We show that the bound is best possible in terms of R, r and n.
LA  - English
DB  - MTMT
ER  - 

TY  - JOUR
AU  - Solymosi, Tamás
AU  - Dombi, József
TI  - A method for determining the weights of criteria. The centralized weights
TS  - The centralized weights
JF  - EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
J2  - EJOR
VL  - 26
PY  - 1986
IS  - 1
SP  - 35
EP  - 41
PG  - 7
SN  - 0377-2217
DO  - 10.1016/0377-2217(86)90157-8
UR  - https://m2.mtmt.hu/api/publication/1675815
ID  - 1675815
LA  - English
DB  - MTMT
ER  -