Optimal search path for service in the presence of disruptions

DOI10.1016/J.COR.2011.01.015zbMath1210.90033OpenAlexW1964065477MaRDI QIDQ716349

Dmitry Krass, Eduard Ianovsky, Oded Berman

Publication date: 28 April 2011

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2011.01.015

zbMATH Keywords

reliabilitynetworksroutingoptimal search

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Dynamic programming (90C39) Discrete location and assignment (90B80)

Related Items (3)

The reliable \(p\)-median problem with at-facility service ⋮ Minimizing the average searching time for an object within a graph ⋮ N-gram distribution and unification gain problem and its optimal solution

Cites Work

• Unnamed Item
• Unnamed Item
• Resource finding in store-and-forward networks
• Facility Reliability Issues in Network p-Median Problems: Strategic Centralization and Co-Location Effects
• Finding the Optimal a Priori Tour and Location of a Traveling Salesman with Nonhomogeneous Customers
• Technical Note—The Complexity of the Optimal Searcher Path Problem
• A Priori Optimization

This page was built for publication: Optimal search path for service in the presence of disruptions