Weight reduction problems with certain bottleneck objectives.
From MaRDI portal
Publication:1417504
DOI10.1016/S0377-2217(02)00713-0zbMath1137.90689MaRDI QIDQ1417504
Zhang, Jianzhong, Rainer E. Burkard, Yanpei Liu
Publication date: 5 January 2004
Published in: European Journal of Operational Research (Search for Journal in Brave)
complexity; Capacity expansion; Bottleneck problem; Computational; Transversal set; Weight reduction
90C35: Programming involving graphs or networks
90C31: Sensitivity, stability, parametric optimization
Related Items
Inverse constrained bottleneck problems under weighted \(l_{\infty}\) norm, Reverse 2-median problem on trees, A smoothing Newton method for a type of inverse semi-definite quadratic programming problem, Up- and downgrading the 1-center in a network, A game-theoretic approach for downgrading the 1-median in the plane with Manhattan metric, On the optimum capacity of capacity expansion problems, A class of node based bottleneck improvement problems
Cites Work
- Unnamed Item
- Unnamed Item
- Improving the location of minisum facilities through network modification
- On an instance of the inverse shortest paths problem
- Modifying edges of a network to obtain short subgraphs
- Approximation algorithms for certain network improvement problems
- Inverse maximum capacity problems
- Some reverse location problems
- Bottleneck Capacity Expansion Problems with General Budget Constraints
- Increasing the Capacity of a Network: The Parametric Budget Problem
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Combinatorial Optimization with Rational Objective Functions
- Maximizing the minimum source-sink path subject to a budget constraint
- Improving the location of minimax facilities through network modification
- A simple min-cut algorithm
- Increasing the Weight of Minimum Spanning Trees
- The network inhibition problem
- Upgrading bottleneck constrained forests
- A class of bottleneck expansion problems
