Inverse maximum capacity problems

DOI10.1007/BF01539860MaRDI QIDQ1387947zbMATH OpenOpenAlexFDO

Authors Chao Yang, Jianzhong Zhang

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)

Recommendations

• Inverse maximum flow and minimum cut problems
• Inverse problem of minimum cuts
• Capacity inverse minimum cost flow problem
• The inverse maximum dynamic flow problem
• Inverse maximum flow problems under the combining norms

Cites work

• scientific article; zbMATH DE number 420868 (Why is no real title available?)
• scientific article; zbMATH DE number 949659 (Why is no real title available?)
• A Faster Algorithm for Finding the Minimum Cut in a Directed Graph
• A column generation method for inverse shortest path problems
• A network flow method for solving some inverse combinatorial optimization problems
• A simple min-cut algorithm
• An algorithm for inverse minimum spanning tree problem
• An inverse problem of the weighted shortest path problem
• Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
• On an instance of the inverse shortest paths problem

Cited in

(15)

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

This page was built for publication: Inverse maximum capacity problems

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