The use of the chain metric solution of the problem on the group choice

被引：0
|
作者：
Kurochka, M.A.
机构：
来源：
Kibernetika i Vychislitel'naya Tekhnika | 1992年 / 01期
关键词：
721 Computer Circuits and Logic Elements - 921 Mathematics - 922 Statistical Methods;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
14
引用
收藏
页码：85 / 92
相关论文
共 50 条
  • [1] APPLICATION OF THE CHAIN METRIC IN GROUP CHOICE
    KUROCHKA, MA
    CYBERNETICS AND SYSTEMS ANALYSIS, 1992, 28 (01) : 71 - 77
  • [2] A PROBLEM OF GROUP CHOICE
    BOBROVSKII, YA
    ILYUNIN, OK
    NOVIKOV, BV
    RAPOPORT, AY
    SODIN, ML
    AUTOMATION AND REMOTE CONTROL, 1990, 51 (09) : 1244 - 1250
  • [3] A MARKOV CHAIN CHOICE PROBLEM
    Ross, Sheldon M.
    PROBABILITY IN THE ENGINEERING AND INFORMATIONAL SCIENCES, 2013, 27 (01) : 53 - 55
  • [4] The use of discrete choice experiments in adherence research: A new solution to an old problem
    Khan, Muhammad Umair
    Brien, Jo-anne
    Aslani, Parisa
    RESEARCH IN SOCIAL & ADMINISTRATIVE PHARMACY, 2020, 16 (10): : 1487 - 1492
  • [5] A DELIBERATIVE SOLUTION TO THE SOCIAL CHOICE PROBLEM
    Mladenovic, Ivan
    PHILOSOPHY AND SOCIETY-FILOZOFIJA I DRUSTVO, 2011, 22 (01): : 123 - 142
  • [6] A new solution to the discontinuity problem on metric spaces
    Celik, Ufuk
    Ozgur, Nihal
    TURKISH JOURNAL OF MATHEMATICS, 2020, 44 (04) : 1115 - 1126
  • [7] ALGORITHM FOR SOLUTION OF A LOCATION PROBLEM WITH METRIC CONSTRAINTS
    SCHAEFER, MK
    HURTER, AP
    NAVAL RESEARCH LOGISTICS, 1974, 21 (04) : 625 - 636
  • [8] INTROSPECTIVE UTILITY AND GROUP CHOICE PROBLEM
    PAINE, NR
    THEORY AND DECISION, 1975, 6 (03) : 357 - 362
  • [9] Solution to the Rhoades' problem under minimal metric structure
    Savaliya, Jayesh
    Gopal, Dhananjay
    Moreno, Juan Martinez
    Srivastava, Shailesh Kumar
    JOURNAL OF ANALYSIS, 2024, 32 (03): : 1787 - 1799
  • [10] An approximate solution to the metric SSTRESS problem in multidimensional scaling
    Tarazaga, P
    Trosset, MW
    DIMENSION REDUCTION, COMPUTATIONAL COMPLEXITY AND INFORMATION, 1998, 30 : 292 - 295
12345