The inverse 1-maxian problem with edge length modification
type: Item
instance of: scholarly article
title: The inverse 1-maxian problem with edge length modification
zbMATH Open document ID: 1180.90165
author: Elisabeth Gassner
published in: Journal of Combinatorial Optimization
publication date: 2008-09-02T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 5319303
zbMATH Keywords: obnoxious location
zbMATH Keywords: tree
MaRDI profile type: Publication
full work available at URL: s10878-007-9098-9
OpenAlex ID: W2045213840
cites work: Minimum cost flow algorithms for series-parallel networks
cites work: Improving the location of minisum facilities through network modification
cites work: Improving the location of minimax facilities through network modification
cites work: Finding the Minimum-Cost Maximum Flow in a Series-Parallel Network
cites work: Inverse median problems
cites work: A linear time algorithm for the reverse 1‐median problem on a cycle
cites work: Reverse 2-median problem on trees
cites work: Q4198056
cites work: Faster shortest-path algorithms for planar graphs
cites work: Inverse combinatorial optimization: a survey on problems, methods, and results
cites work: Graph minors. II. Algorithmic aspects of tree-width
cites work: Obnoxious Facility Location on Graphs
cites work: Q4511232
cites work: Some reverse location problems
cites work: Inapproximability and a polynomially solvable special case of a network improvement problem.
DOI: 10.1007/S10878-007-9098-9
Recommended article: The inverse \(p\)-maxian problem on trees with variable edge lengths
Recommended article: Inverse \(p\)-median problems with variable edge lengths
Recommended article: The inverse 1-center problem on cycles with variable edge lengths
Recommended article: Inverse maximum flow and minimum cut problems
Recommended article: Inverse 1-center location problems with edge length augmentation on trees
Recommended article: Q4649340
Recommended article: On an extremal inverse problem in graph theory
Recommended article: On an instance of the inverse shortest paths problem
Recommended article: On a max-min problem concerning weights of edges
Recommended article: Parameterizing edge modification problems above lower bounds
description: scientific article; zbMATH DE number 5319303