THE MULTI-INDEX TRANSPORTATION PROBLEM

被引：0
|
作者：
MOTZKIN, TS
机构：
来源：
BULLETIN OF THE AMERICAN MATHEMATICAL SOCIETY | 1952年 / 58卷 / 04期
关键词：
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
引用
收藏
页码：494 / 494
页数：1
相关论文
共 50 条
  • [31] Detecting All Non-Dominated Points for Multi-Objective Multi-Index Transportation Problems
    Abd Elazeem, Abd Elazeem M.
    Mousa, Abd Allah A.
    El-Shorbagy, Mohammed A.
    Elagan, Sayed K.
    Abo-Elnaga, Yousria
    SUSTAINABILITY, 2021, 13 (03) : 1 - 21
  • [32] On the characterization of noninteger vertices of the relaxation polyhedron in the multi-index axial assignment problem
    V. M. Kravtsov
    Computational Mathematics and Mathematical Physics, 2010, 50 : 1615 - 1626
  • [33] Multi index fixed charge bicriterion transportation problem
    Ahuja, A
    Arora, SR
    INDIAN JOURNAL OF PURE & APPLIED MATHEMATICS, 2001, 32 (05): : 739 - 746
  • [34] On the characterization of noninteger vertices of the relaxation polyhedron in the multi-index axial assignment problem
    Kravtsov, V. M.
    COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS, 2010, 50 (09) : 1615 - 1626
  • [35] Multi-index evaluation for the construction of BSHSL
    Shi, QZ
    Xu, AN
    Zang, BM
    TRAFFIC AND TRANSPORTATION STUDIES, 1998, : 225 - 234
  • [36] Analysis and application of multi-index system
    Feng, Ao
    Liu, Bin
    Zhu, Nan
    Xiaoxing Weixing Jisuanji Xitong/Mini-Micro Systems, 2000, 21 (05): : 527 - 529
  • [37] Unbiased multi-index Monte Carlo
    Crisan, Dan
    Del Moral, Pierre
    Houssineau, Jeremie
    Jasra, Ajay
    STOCHASTIC ANALYSIS AND APPLICATIONS, 2018, 36 (02) : 257 - 273
  • [38] Multi-index ensemble Kalman filtering
    Shaimerdenova, Gaukhar
    Hoel, Hakon
    Tempone, Raul
    JOURNAL OF COMPUTATIONAL PHYSICS, 2022, 470
  • [39] On cross approximation of multi-index arrays
    Goreinov, S. A.
    DOKLADY MATHEMATICS, 2008, 77 (03) : 404 - 406
  • [40] On cross approximation of multi-index arrays
    S. A. Goreinov
    Doklady Mathematics, 2008, 77 : 404 - 406
12345