Dynamic min-max problems
type: Item
instance of: scholarly article
title: Dynamic min-max problems
zbMATH Open document ID: 0959.93031
DOI: 10.1023/A:1008386713533
author: Uwe Schwiegelshohn
author: Lothar Thiele
published in: Discrete Event Dynamic Systems
publication date: 1999-11-23T00:00:00Z
review text: The authors describe a method to check the solvability of a set of linear equations in the (max,min,+) algebra and some extensions to dynamic and periodic systems. The paper contains new results on a special class of weighted graphs, i.e., min-max graphs: 1. A relation between potential functions of dynamic and weight transformed static graphs is derived. 2. An effective pseudo-polynomial algorithm for the determination of the period of min-max systems is presented. 3. Results on the existence and uniqueness of the period of a dynamic min-max system are given. 4. Results on the uniqueness of the periods in the quasi-periodic case are given as well as algorithms to determine these periods. The main theorem is: The period function of a given static graph is unique.
Mathematics Subject Classification ID: 93C30
Mathematics Subject Classification ID: 05C90
zbMATH DE Number: 1333015
zbMATH Keywords: min-max algebra
zbMATH Keywords: periodic graphs
zbMATH Keywords: dynamic graphs
zbMATH Keywords: weighted graphs
zbMATH Keywords: min-max graphs
zbMATH Keywords: min-max systems
zbMATH Keywords: static graph
reviewed by: Bohumil František Šmarda
MaRDI profile type: Publication
Wikidata QID: Q130471512
Recommended article: Q3325439
Recommended article: Q4883383
Recommended article: A dynamic minimization method
Recommended article: Min-max pursuit problem
Recommended article: Algorithms for the solution of stochastic dynamic minimax problems
Recommended article: Minmaxmin problems revisited
Recommended article: Q3577132
Recommended article: Minimax linear programming problem
Recommended article: Dynamic parameterized problems
Recommended article: Dynamic Parameterized Problems
description: scientific article; zbMATH DE number 1333015