Weight reduction problems with certain bottleneck objectives.
type: Item
instance of: scholarly article
title: Weight reduction problems with certain bottleneck objectives.
zbMATH Open document ID: 1137.90689
DOI: 10.1016/S0377-2217(02)00713-0
author: Yanpei Liu
author: Rainer E. Burkard
author: Jianzhong Zhang
published in: European Journal of Operational Research
publication date: 2004-01-05T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C31
zbMATH DE Number: 2021183
zbMATH Keywords: Bottleneck problem
zbMATH Keywords: Weight reduction
zbMATH Keywords: Capacity expansion
zbMATH Keywords: Computational
zbMATH Keywords: complexity
zbMATH Keywords: Transversal set
MaRDI profile type: Publication
cites work: Improving the location of minisum facilities through network modification
cites work: Improving the location of minimax facilities through network modification
cites work: Bottleneck capacity expansion problems with general budget constraints
cites work: On an instance of the inverse shortest paths problem
cites work: Modifying edges of a network to obtain short subgraphs
cites work: Increasing the Weight of Minimum Spanning Trees
cites work: Increasing the capacity of a network: the parametric budget problem
cites work: Maximizing the minimum source-sink path subject to a budget constraint
cites work: Approximation algorithms for certain network improvement problems
cites work: Upgrading bottleneck constrained forests
cites work: Combinatorial Optimization with Rational Objective Functions
cites work: Applying Parallel Computation Algorithms in the Design of Serial Algorithms
cites work: The network inhibition problem
cites work: Parametric flows, weighted means of cuts, and fractional combinatorial optimization
cites work: A simple min-cut algorithm
cites work: Inverse maximum capacity problems
cites work: Some reverse location problems
cites work: Q4511232
cites work: A class of bottleneck expansion problems
full work available at URL: s0377-2217(02)00713-0
OpenAlex ID: W1969114411
description: scientific article; zbMATH DE number 2021183