Inverse maximum capacity problems

DOI10.1007/BF01539860zbMath0904.90168OpenAlexW2027482741MaRDI QIDQ1387947

Chao Yang, Zhang, Jianzhong

Publication date: 10 August 1998

Published in: OR Spektrum (Search for Journal in Brave)

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

zbMATH Keywords

inverse problemsspanning tree problemmaximum capacityminimum capacityminimum weight cut set problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items

Partial inverse min-max spanning tree problem ⋮ Input estimation and identification of extra inputs in inverse DEA models ⋮ An Oracle Strongly Polynomial Algorithm for Bottleneck Expansion Problems ⋮ Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes ⋮ Inverse constrained bottleneck problems under weighted \(l_{\infty}\) norm ⋮ Constrained and bicriteria inverse bottleneck optimization problems under weighted Hamming distance ⋮ Weight reduction problems with certain bottleneck objectives. ⋮ An inverse DEA model for inputs/outputs estimate ⋮ A class of bottleneck expansion problems ⋮ The optimization of road building schedule based on budget restriction ⋮ Inverse problems of submodular functions on digraphs ⋮ Some reverse location problems ⋮ A further study on inverse linear programming problems

Cites Work

• Unnamed Item
• Unnamed Item
• On an instance of the inverse shortest paths problem
• An inverse problem of the weighted shortest path problem
• Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
• A Faster Algorithm for Finding the Minimum Cut in a Directed Graph
• A simple min-cut algorithm
• An algorithm for inverse minimum spanning tree problem
• A column generation method for inverse shortest path problems
• A network flow method for solving some inverse combinatorial optimization problems