Algorithmic Applications in Management

DOI10.1007/B137095MaRDI QIDQ5710145zbMATH OpenOpenAlexFDO

Authors G. Gutin, Arash Rafiey, A. Yeo, Michael Tso

Publication date 30 November 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b137095

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Programming involving graphs or networks (90C35)

Recommendations

• Level of repair analysis and minimum cost homomorphisms of graphs
• A dichotomy for minimum cost graph homomorphisms
• The dichotomy of minimum cost homomorphism problems for digraphs
• Minimum cost homomorphisms to semicomplete multipartite digraphs
• scientific article; zbMATH DE number 5531978
• On the Complexity of Finding Set Repairs for Data-Graphs
• Minimum self-repairing graphs
• On the approximation of minimum cost homomorphism to bipartite graphs
• The complexity of the minimum cost homomorphism problem for semicomplete digraphs with possible loops
• Minimum Cost Homomorphisms to Reflexive Digraphs

Cited in

(5)

• A facility location and installation of resources model for level of repair analysis
• A combinatorial approach to level of repair analysis
• An efficient model formulation for level of repair analysis
• Level of repair analysis and minimum cost homomorphisms of graphs
• Minimum cost and list homomorphisms to semicomplete digraphs

This page was built for publication: Algorithmic Applications in Management

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5710145)