Maximum-cover source location problems with objective edge-connectivity three
type: Item
instance of: scholarly article
title: Maximum-cover source location problems with objective edge-connectivity three
zbMATH Open document ID: 1176.90615
author: Kenya Sugihara
author: Hiro Ito
published in: Mathematical Methods of Operations Research
publication date: 2009-09-09T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90B80
zbMATH DE Number: 5602497
zbMATH Keywords: polynomial-time algorithm
zbMATH Keywords: NP-hard
MaRDI profile type: Publication
full work available at URL: s00186-008-0266-1
OpenAlex ID: W1991712569
cites work: Locating sources to meet flow demands in undirected networks
cites work: An algorithm for source location in directed graphs
cites work: The source location problem with local 3-vertex-connectivity requirements
cites work: Source location problems considering vertex-connectivity and edge-connectivity simultaneously
cites work: Q4664045
cites work: Edge connectivity between nodes and node-subsets
cites work: Q4782694
cites work: Minimum cost source location problem with vertex-connectivity requirements in digraphs
cites work: Maximum-Cover Source-Location Problem with Objective Edge-Connectivity Three
cites work: A simple 3-edge-connected component algorithm
DOI: 10.1007/S00186-008-0266-1
Recommended article: The source location problem with local 3-vertex-connectivity requirements
Recommended article: Source location problems considering vertex-connectivity and edge-connectivity simultaneously
Recommended article: Minimum cost source location problem with local 3-vertex-connectivity requirements
Recommended article: Upgrading edges in the maximal covering location problem
Recommended article: The generalized maximal covering location problem
Recommended article: The Maximal Expected Covering Location Problem: Revisited
Recommended article: Minmax regret maximal covering location problems with edge demands
Recommended article: A note on solutions to the maximal expected covering location problem
Recommended article: On covering location problems on networks with edge demand
description: scientific article; zbMATH DE number 5602497