Algorithms for solving discrete control problems on networks (Q1397635)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Algorithms for solving discrete control problems on networks |
scientific article; zbMATH DE number 1960736
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for solving discrete control problems on networks |
scientific article; zbMATH DE number 1960736 |
Statements
Algorithms for solving discrete control problems on networks (English)
0 references
6 August 2003
0 references
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.
0 references
discrete systems
0 references
optimal control
0 references
networks
0 references
graph
0 references
polynomial-time algorithm
0 references
