Maximum-cover source location problems with objective edge-connectivity three

DOI10.1007/S00186-008-0266-1MaRDI QIDQ836873zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

NP-hardpolynomial-time algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Discrete location and assignment (90B80)

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

• scientific article; zbMATH DE number 2152473 (Why is no real title available?)
• scientific article; zbMATH DE number 1839429 (Why is no real title available?)
• A simple 3-edge-connected component algorithm
• An algorithm for source location in directed graphs
• Edge connectivity between nodes and node-subsets
• Locating sources to meet flow demands in undirected networks
• Maximum-Cover Source-Location Problem with Objective Edge-Connectivity Three
• Minimum cost source location problem with vertex-connectivity requirements in digraphs
• Source location problems considering vertex-connectivity and edge-connectivity simultaneously
• The source location problem with local 3-vertex-connectivity requirements

Cited in

(4)

• Source location problems considering vertex-connectivity and edge-connectivity simultaneously
• Multi-commodity Source Location Problems and Price of Greed
• Static and dynamic source locations in undirected networks
• The 3‐vertex single source Weber location problem

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)