Advertisement

Level of Repair Analysis and Minimum Cost Homomorphisms of Graphs

  • Gregory Gutin
  • Arash Rafiey
  • Anders Yeo
  • Michael Tso
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3521)

Abstract

Level of Repair Analysis (LORA) is a prescribed procedure for defence logistics support planning. For a complex engineering system containing perhaps thousands of assemblies, sub-assemblies, components, etc. organized into several levels of indenture and with a number of possible repair decisions, LORA seeks to determine an optimal provision of repair and maintenance facilities to minimize overall life-cycle costs. For a LORA problem with two levels of indenture with three possible repair decisions, which is of interest in UK and US military and which we call LORA-BR, Barros (1998) and Barros and Riley (2001) developed certain branch-and-bound heuristics. The surprising result of this paper is that LORA-BR is, in fact, polynomial-time solvable. To obtain this result, we formulate the general LORA problem as an optimization homomorphism problem on bipartite graphs, and reduce a generalization of LORA-BR, LORA-M, to the maximum weight independent set problem on a bipartite graph. We prove that the general LORA problem is NP-hard by using an important result on list homomorphisms of graphs. We introduce the minimum cost graph homomorphism problem and provide partial results. Finally, we show that our result for LORA-BR can be applied to prove that an extension of the maximum weight independent set problem on bipartite graphs is polynomial time solvable.

Keywords

Polynomial Time Bipartite Graph Interval Graph Input Graph Complex Engineering System 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ageev, A.A.: On finding critical independent and vertex sets. SIAM J. Discrete Math. 7, 293–295 (1994)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Ahuja, R.K., Orlin, J.B., Stein, C., Tarjan, R.E.: Improved algorithms for bipartite network flows. SIAM J. Comput. 23, 906–933 (1994)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Asratian, A.S., Denley, T.M.J., Haggkvist, R.: Bipartite Graphs and Their Applications. Cambridge University Press, Cambridge (1998)zbMATHGoogle Scholar
  4. 4.
    Barros, L.L.: The optimisation of repair decisions using life-cycle cost parameters. IMA J. Management Math. 9, 403–413 (1988)CrossRefGoogle Scholar
  5. 5.
    Barros, L.L.: Private communications with M. Tso (2001)Google Scholar
  6. 6.
    Barros, L.L., Riley, M.: A combinatorial approach to level of repair analysis. Europ. J. Oper. Res. 129, 242–251 (2001)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Brightwell, G.: Private communications with G. Gutin (January 2005)Google Scholar
  8. 8.
    Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press, Cambridge (1990)zbMATHGoogle Scholar
  9. 9.
    Crabtree, J.W., Sandel, B.C.: Army level of repair analysis (LORA). Logistics Spectrum, 27–31 (Summer 1989)Google Scholar
  10. 10.
    Feder, T., Hell, P., Huang, J.: List homomorphisms and circular arc graphs. Combinatorica 19, 487–505 (1999)zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Frahling, G., Faigle, U.: Combinatorial algorithm for weighted stable sets in bipartite graphs. To appear in Discrete Appl. Math.Google Scholar
  12. 12.
    Garey, M.R., Johnson, D.S.: Computers and Intractability. Freeman and Co., San Francisco (1979)zbMATHGoogle Scholar
  13. 13.
    Hell, P., Nesetril, J.: Graphs and Homomorphisms. Oxford University Press, Oxford (2004)zbMATHCrossRefGoogle Scholar
  14. 14.
    Hochbaum, D.: Provisioning, Shared Fixed Costs, Maximum Closure, and Implications on Algorithmic Methods Today. Management Sci. 50, 709–723 (2004)CrossRefGoogle Scholar
  15. 15.
    West, D.: Introduction to Graph Theory. Prentice Hall, Upper Saddle River (1996)zbMATHGoogle Scholar
  16. 16.
    Zhang, C.-Q.: Finding critical independent sets and critical vertex subsets are polynomial problems. SIAM J. Discrete Math. 3, 431–438 (1990)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Gregory Gutin
    • 1
  • Arash Rafiey
    • 1
  • Anders Yeo
    • 1
  • Michael Tso
    • 2
  1. 1.Department of Computer ScienceRoyal Holloway University of LondonEghamUK
  2. 2.School of MathematicsUniversity of ManchesterManchesterUK

Personalised recommendations