Dynamic min-max problems

被引：7
|
作者：
Schwiegelshohn, U [1 ]
Thiele, L
机构：
[1] Univ Dortmund, Comp Engn Inst, D-44221 Dortmund, Germany
[2] Swiss Fed Inst Technol, Comp Engn & Networks Lab, CH-8092 Zurich, Switzerland
来源：
DISCRETE EVENT DYNAMIC SYSTEMS-THEORY AND APPLICATIONS | 1999年 / 9卷 / 02期
关键词：
min-max algebra; graph theory; periodic graphs;
D O I：
10.1023/A:1008386713533
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
In this paper a method to check the solvability of a set of linear equations in the (max, min, +) algebra is described. Then, extensions to dynamic (or periodic) systems in the (max, min, +) algebra are provided. Further, some results regarding the uniqueness of solutions in both cases are given. Finally, we address a more general quasi periodic problem and provide an algorithm for its solution.
引用
收藏
页码：111 / 134
页数：24
相关论文
共 50 条
  • [31] MIN-MAX BOUNDS FOR DYNAMIC NETWORK FLOWS
    WILKINSON, WL
    [J]. NAVAL RESEARCH LOGISTICS, 1973, 20 (03) : 505 - 516
  • [32] Improved approximation algorithms for some min-max postmen cover problems with applications to the min-max subtree cover
    Yu, Wei
    [J]. MATHEMATICAL METHODS OF OPERATIONS RESEARCH, 2023, 97 (01) : 135 - 157
  • [33] 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
    [J]. Lect. Notes Comput. Sci, 2006, (156-202):
  • [34] A Deterministic Algorithm for Min-max and Max-min Linear Fractional Programming Problems
    Qigao Feng
    Hongwei Jiao
    Hanping Mao
    Yongqiang Chen
    [J]. International Journal of Computational Intelligence Systems, 2011, 4 (2) : 134 - 141
  • [35] A Deterministic Algorithm for Min-max and Max-min Linear Fractional Programming Problems
    Feng, Qigao
    Jiao, Hongwei
    Mao, Hanping
    Chen, Yongqiang
    [J]. INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE SYSTEMS, 2011, 4 (02): : 134 - 141
  • [36] Approximation algorithms for min-max and max-min resource sharing problems, and applications
    Jansen, K
    [J]. EFFICIENT APPROXIMATION AND ONLINE ALGORITHMS: RECENT PROGRESS ON CLASSICAL COMBINATORIAL OPTIMIZATION PROBLEMS AND NEW APPLICATIONS, 2006, 3484 : 156 - 202
  • [37] A decentralized algorithm for large scale min-max problems
    Mukherjee, Soham
    Chakraborty, Mrityunjoy
    [J]. 2020 59TH IEEE CONFERENCE ON DECISION AND CONTROL (CDC), 2020, : 2967 - 2972
  • [38] Complexity of the min-max (regret) versions of cut problems
    Aissi, H
    Bazgan, C
    Vanderpooten, D
    [J]. ALGORITHMS AND COMPUTATION, 2005, 3827 : 789 - 798
  • [39] Novel Min-Max Reformulations of Linear Inverse Problems
    Sheriff, Mohammed Rayyan
    Chatterjee, Debasish
    [J]. JOURNAL OF MACHINE LEARNING RESEARCH, 2022, 23 : 1 - 46
  • [40] ON A MIN-MAX THEOREM
    CHEN FANGQI
    [J]. Applied Mathematics:A Journal of Chinese Universities, 1997, (03) : 43 - 48
12345