TheO(n3) algorithm for a special case of the maximum cost-to-time ratio cycle problem and its coherence with an eigenproblem of a matrix (Q4015964): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A characterization of the minimum cycle mean in a digraph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4065564 / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf01415758 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W314609130 / rank | |||
Normal rank |
Latest revision as of 09:31, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | TheO(n3) algorithm for a special case of the maximum cost-to-time ratio cycle problem and its coherence with an eigenproblem of a matrix |
scientific article |
Statements
TheO(n3) algorithm for a special case of the maximum cost-to-time ratio cycle problem and its coherence with an eigenproblem of a matrix (English)
0 references
12 November 1992
0 references
cost-to-time optimization
0 references
cyclic permutation
0 references
generalized eigenproblem
0 references