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
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| 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 | |||
Latest revision as of 14:42, 16 May 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
