SIMPLE DERIVATION OF NECESSARY CONDITIONS FOR STATIC MIN-MAX PROBLEMS

被引：10
|
作者：
SCHMITENDORF, WE
机构：
来源：
JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS | 1979年 / 70卷 / 02期
关键词：
D O I：
10.1016/0022-247X(79)90060-X
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
引用
收藏
页码：486 / 489
页数：4
相关论文
共 50 条
  • [31] Approximation Algorithms for Min-Max Generalization Problems
    Berman, Piotr
    Raskhodnikova, Sofya
    ACM TRANSACTIONS ON ALGORITHMS, 2014, 11 (01)
  • [32] Min-Max Spaces and Complexity Reduction in Min-Max Expansions
    Stephane Gaubert
    William M. McEneaney
    Applied Mathematics & Optimization, 2012, 65 : 315 - 348
  • [33] NECESSARY CONDITIONS IN A MIN MAX PROBLEM
    SAGAIDAK, MI
    CYBERNETICS, 1982, 18 (01): : 103 - 111
  • [34] Improved approximation algorithms for some min-max postmen cover problems with applications to the min-max subtree cover
    Yu, Wei
    MATHEMATICAL METHODS OF OPERATIONS RESEARCH, 2023, 97 (01) : 135 - 157
  • [35] Approximation algorithms for min-max and max-min resource sharing problems, and applications
    Institut für Informatik und Praktische Mathematik, Christian-Albrechts-Universität zu Kiel, Olshausenstr. 40, 24098 Kiel, Germany
    Lect. Notes Comput. Sci., 2006, (156-202):
  • [36] A Deterministic Algorithm for Min-max and Max-min Linear Fractional Programming Problems
    Qigao Feng
    Hongwei Jiao
    Hanping Mao
    Yongqiang Chen
    International Journal of Computational Intelligence Systems, 2011, 4 (2) : 134 - 141
  • [37] A Deterministic Algorithm for Min-max and Max-min Linear Fractional Programming Problems
    Feng, Qigao
    Jiao, Hongwei
    Mao, Hanping
    Chen, Yongqiang
    INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE SYSTEMS, 2011, 4 (02): : 134 - 141
  • [38] Approximation algorithms for min-max and max-min resource sharing problems, and applications
    Jansen, K
    EFFICIENT APPROXIMATION AND ONLINE ALGORITHMS: RECENT PROGRESS ON CLASSICAL COMBINATORIAL OPTIMIZATION PROBLEMS AND NEW APPLICATIONS, 2006, 3484 : 156 - 202
  • [39] Sum-of-squares relaxations for polynomial min-max problems over simple sets
    Bach, Francis
    MATHEMATICAL PROGRAMMING, 2025, 209 (1-2) : 475 - 501
  • [40] Complexity of the min-max (regret) versions of cut problems
    Aissi, H
    Bazgan, C
    Vanderpooten, D
    ALGORITHMS AND COMPUTATION, 2005, 3827 : 789 - 798
12345