Computation of the second maximum path weight in a max-plus matrix

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F62690094%3A18450%2F11%3A10068635" target="_blank" >RIV/62690094:18450/11:10068635 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Computation of the second maximum path weight in a max-plus matrix

Original language description

The problem of efficient computation of all second maximal path weights for a given square matrix A of dimension n in max-plus algebra is solved by computing so-called double power sequence of a specific extension of A. An algorithm using this method ispresented, by which the second maximal cycle mean value can be computed in O(n4) time.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

BB - Applied statistics, operational research

OECD FORD branch

—

Project

<a href="/en/project/GA402%2F09%2F0405" target="_blank" >GA402/09/0405: Development of Non-standard Optimization Methods and their Applications in Economy and Management</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2011

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Acta electrotechnica et informatica

ISSN

1335-8243

e-ISSN

—

Volume of the periodical

2011

Issue of the periodical within the volume

11

Country of publishing house

SK - SLOVAKIA

Number of pages

6

Pages from-to

51 - 56

UT code for WoS article

—

EID of the result in the Scopus database

—