Maximum-cover source location problems with objective edge-connectivity three
From MaRDI portal
Publication:836873
DOI10.1007/S00186-008-0266-1zbMATH Open1176.90615OpenAlexW1991712569MaRDI QIDQ836873FDOQ836873
Authors: Kenya Sugihara, Hiro Ito 
Publication date: 9 September 2009
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00186-008-0266-1
Recommendations
- The source location problem with local 3-vertex-connectivity requirements
- Source location problems considering vertex-connectivity and edge-connectivity simultaneously
- Minimum cost source location problem with local 3-vertex-connectivity requirements
- Upgrading edges in the maximal covering location problem
- The generalized maximal covering location problem
- The Maximal Expected Covering Location Problem: Revisited
- Minmax regret maximal covering location problems with edge demands
- A note on solutions to the maximal expected covering location problem
- On covering location problems on networks with edge demand
Cites Work
- An algorithm for source location in directed graphs
- Locating sources to meet flow demands in undirected networks
- Edge connectivity between nodes and node-subsets
- Title not available (Why is that?)
- A simple 3-edge-connected component algorithm
- Minimum cost source location problem with vertex-connectivity requirements in digraphs
- The source location problem with local 3-vertex-connectivity requirements
- Maximum-Cover Source-Location Problem with Objective Edge-Connectivity Three
- Title not available (Why is that?)
- Source location problems considering vertex-connectivity and edge-connectivity simultaneously
Cited In (4)
This page was built for publication: Maximum-cover source location problems with objective edge-connectivity three
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q836873)
