Inverse Bottleneck Optimization Problems on Networks

DOI10.1007/11775096_21MaRDI QIDQ5434401zbMATH OpenOpenAlexFDO

Authors Xiucui Guan, Jianzhong Zhang

Publication date 4 January 2008

Published in Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11775096_21

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• Constrained and bicriteria inverse bottleneck optimization problems under weighted Hamming distance
• A WEIGHTED INVERSE MINIMUM CUT PROBLEM UNDER THE BOTTLENECK TYPE HAMMING DISTANCE
• Inverse constrained bottleneck problems under weighted \(l_{\infty}\) norm
• Inverse minimum cost flow problems under the weighted Hamming distance
• Combinatorial algorithms for inverse network flow problems

Cited in

(11)

• Computation of inverse 1-center location problem on the weighted trapezoid graphs
• Constrained inverse min-max spanning tree problems under the weighted Hamming distance
• Inverse 1-median problem on trees under weighted Hamming distance
• The minmax regret inverse maximum weight problem
• Inverse bottleneck Steiner tree problem under norm
• Inverse 1-center location problems with edge length augmentation on trees
• Inverse constrained bottleneck problems under weighted \(l_{\infty}\) norm
• On Uniformly Optimal Networks: A Reversal of Fortune?
• Constrained and bicriteria inverse bottleneck optimization problems under weighted Hamming distance
• The inverse maximum dynamic flow problem
• Inverse multi-objective shortest pPath problem under the bottleneck type weighted Hamming distance

This page was built for publication: Inverse Bottleneck Optimization Problems on Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5434401)