Publication Cover
Optimization
A Journal of Mathematical Programming and Operations Research
Volume 30, 1994 - Issue 3
11
Views
5
CrossRef citations to date
0
Altmetric
Original Articles

The complexity of finding the minimal of the maximum cycle means of similar zero-one matrices

Pages 283-287 | Published online: 20 Mar 2007

References

  • Butkovič P. Cunninghame-Green R. A An 0(n2 ) Algorithm for the Maximum Cycle Mean of an nxn Bivalent Matrix Preprint 33/90 School of Mathematics and Statistics
  • Butkovič , P. and Plávka , J. 1989 . On the dependence of the maximum cycle mean of a matrix on permutations of its rows and columns . Discrete Applied Mathematics , 23 : 45 – 53 .
  • Cunninghame-Green , R.A. 1962 . Describing industrial processes with interference and approximating their steady-state behaviour . Oper. Ress. Quart , 13 : 95 – 100 .
  • Cunninghame-Green , R.A. 1979 . Mininax Algebra , Vol. 166 , Berlin : Springer-Verlag .
  • Dantzig , G.B. and Blattner , W.D. 1967 . “ Finding a cycle in a graph with minimum cost to time ratio, with application to a shiprouting problem ” . In Theory of graphs , Edited by: Rosenstiehl , P. New York : Gordon and Breach .
  • Garey , R.M. and Johnson , D.S. 1979 . Computers and Intractibility , San Francisco : Freedman W.H. and Company .
  • Karp , R.M. 1978 . A characterization of the minimum cycle mean in a diagraph . Discrete Mathematics , 23 : 309 – 311 .
  • Lawler E. L. Combinatorial Optimization: Networks and Matroids Holt 1976 Rinehart and Winston

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.