Algorithms for solving discrete control problems on networks
type: Item
instance of: scholarly article
title: Algorithms for solving discrete control problems on networks
zbMATH Open document ID: 1043.93039
author: A. Iusiumbeli
author: Dmitrii Lozovanu
published in: Computer Science Journal of Moldova
publication date: 2003-08-06T00:00:00Z
review text: The authors consider the discrete optimal problem concerning networks with integral time cost criteria applied to trajectories starting from and ending in known states. The cost functions on the edges of the graph are supposed to be positive and nondecreasing. A polynomial-time algorithm for solving the problem is proposed.
Mathematics Subject Classification ID: 93C55
Mathematics Subject Classification ID: 49N90
Mathematics Subject Classification ID: 65Y20
Mathematics Subject Classification ID: 94C05
zbMATH DE Number: 1960736
zbMATH Keywords: discrete systems
zbMATH Keywords: optimal control
zbMATH Keywords: networks
zbMATH Keywords: graph
zbMATH Keywords: polynomial-time algorithm
reviewed by: Liviu Goraş
MaRDI profile type: MaRDI publication profile
description: scientific article; zbMATH DE number 1960736