SIMPLE DERIVATION OF NECESSARY CONDITIONS FOR STATIC MIN-MAX PROBLEMS

被引:10
|
作者
SCHMITENDORF, WE
机构
关键词
D O I
10.1016/0022-247X(79)90060-X
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
引用
收藏
页码:486 / 489
页数:4
相关论文
共 50 条
  • [1] NECESSARY CONDITIONS FOR MIN-MAX PROBLEMS AND ALGORITHMS BY A RELAXATION PROCEDURE
    SHIMIZU, K
    AIYOSHI, E
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1980, 25 (01) : 62 - 66
  • [2] Complexity of the min-max and min-max regret assignment problems
    Aissi, H
    Bazgan, C
    Vanderpooten, D
    OPERATIONS RESEARCH LETTERS, 2005, 33 (06) : 634 - 640
  • [3] Dynamic min-max problems
    Schwiegelshohn, U
    Thiele, L
    DISCRETE EVENT DYNAMIC SYSTEMS-THEORY AND APPLICATIONS, 1999, 9 (02): : 111 - 134
  • [4] Dynamic Min-Max Problems
    Uwe Schwiegelshohn
    Lothar Thiele
    Discrete Event Dynamic Systems, 1999, 9 : 111 - 134
  • [5] Min-max and min-max regret versions of combinatorial optimization problems: A survey
    Aissi, Hassene
    Bazgan, Cristina
    Vanderpooten, Daniel
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 197 (02) : 427 - 438
  • [6] Pseudo-polynomial algorithms for min-max and min-max regret problems
    Aissi, Hassene
    Bazgan, Cristina
    Vanderpooten, Daniel
    Operations Research and Its Applications, 2005, 5 : 171 - 178
  • [7] Approximation and resolution of min-max and min-max regret versions of combinatorial optimization problems
    Aissi H.
    4OR, 2006, 4 (4) : 347 - 350
  • [8] Approximation of min-max and min-max regret versions of some combinatorial optimization problems
    Aissi, Hassene
    Bazgan, Cristina
    Vanderpooten, Daniel
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 179 (02) : 281 - 290
  • [9] Min-Max quickest path problems
    Ruzika, Stefan
    Thiemann, Markus
    NETWORKS, 2012, 60 (04) : 253 - 258
  • [10] Parallel Approximation of Min-Max Problems
    Gus Gutoski
    Xiaodi Wu
    computational complexity, 2013, 22 : 385 - 428