Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Optimal location of facilities on a network with an unreliable node or link

From MaRDI portal
Publication:1350200
Jump to:navigation, search

DOI10.1016/0020-0190(96)00024-5zbMath0900.68229OpenAlexW2093467530MaRDI QIDQ1350200

H. A. Eiselt, Gilbert Laporte, Michel Gendreau

Publication date: 27 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(96)00024-5

zbMATH Keywords

AlgorithmsCombinatorial problemsNetwork reliabilityStochastic location


Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)


Related Items

Emergency facility location under random network damage: insights from the Istanbul case, The impact of hub failure in hub-and-spoke networks: mathematical formulations and solution techniques, A Fast Tabu Search Algorithm for the Reliable P-Median Problem, Multiple facility location on a network with linear reliability order of edges, The approximability of multiple facility location on directed networks with random arc failures, Network location of a reliable center using the most reliable route policy, On the location of a constrained \(k\)-tree facility in a tree network with unreliable edges



Cites Work

  • On the computational power of pushdown automata
  • Location of facilities on a network subject to a single‐edge failure
  • Unnamed Item
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1350200&oldid=13484955"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 15:00.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki