You are here: MIMS > EPrints
MIMS EPrints

2006.349: Level of repair analysis and minimum cost homomorphisms of graphs

2006.349: Gregory Gutin, Arash Rafiey, Anders Yeo and Michael Tso (2002) Level of repair analysis and minimum cost homomorphisms of graphs. In: Algorithmic Applications in Management, 22-25 June 2005, China.

There is a more recent version of this eprint available. Click here to view it.

Full text available as:

PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
215 Kb

Official URL: http://www.informatik.uni-trier.de/~ley/db/conf/aaim/aaim2005.html

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.

Item Type:Conference or Workshop Item (Paper)
Uncontrolled Keywords:Computational logistics; Level of repair analysis; Independent sets in graphs; Homomorphisms of graphs
Subjects:MSC 2000 > 60 Probability theory and stochastic processes
MIMS number:2006.349
Deposited By:Miss Louise Stait
Deposited On:21 August 2006

Available Versions of this Item

Download Statistics: last 4 weeks
Repository Staff Only: edit this item