Weight reduction problems with certain bottleneck objectives.

DOI10.1016/S0377-2217(02)00713-0zbMath1137.90689OpenAlexW1969114411MaRDI QIDQ1417504

Yanpei Liu, Zhang, Jianzhong, Rainer E. Burkard

Publication date: 5 January 2004

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00713-0

zbMATH Keywords

complexityCapacity expansionBottleneck problemComputationalTransversal setWeight reduction

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Sensitivity, stability, parametric optimization (90C31)

Related Items

Expanding maximum capacity path under weighted sum-type distances, Optimal approaches for upgrading selective obnoxious \(p\)-median location problems on tree networks, Inverse constrained bottleneck problems under weighted \(l_{\infty}\) norm, Upgrading edges in the maximal covering location problem, Notes on inverse bin-packing problems, Reverse 2-median problem on trees, Inverse semidefinite quadratic programming problem with \(l_1\) norm measure, Inverse quadratic programming problem with \(l_1\) norm measure, On the optimum capacity of capacity expansion problems, A smoothing Newton method for a type of inverse semi-definite quadratic programming problem, Inverse problems and solution methods for a class of nonlinear complementarity problems, A game-theoretic approach for downgrading the 1-median in the plane with Manhattan metric, A class of node based bottleneck improvement problems, An augmented Lagrangian method for a class of Inverse quadratic programming problems, Up- and downgrading the 1-center in a network

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