"TheO(n3) algorithm for a special case of the maximum ..."

Ján Plávka (1992)

> Home

Details and statistics

DOI: 10.1007/BF01415758

access: closed

type: Journal Article

metadata version: 2020-05-18

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mmor/Plavka92
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mmor/Plavka92
Ján Plávka:
TheO(n³) algorithm for a special case of the maximum cost-to-time ratio cycle problem and its coherence with an eigenproblem of a matrix. ZOR Methods Model. Oper. Res. 36(5): 417-422 (1992)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.