A weighted inverse minimum s-t cut problem with value constraint under the Bottleneck-type Hamming distance

DOI10.1142/S0217595923500094MaRDI QIDQ6561572zbMATH OpenFDO

Authors Elham Ramzani Ghalebala, Massoud Aman, Nasim Nasrabadi

Publication date 25 June 2024

Published in Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0217595923500094

zbMATH Keywords

binary searchBottleneck-type Hamming distanceinverse problemstrongly polynomial time algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• A WEIGHTED INVERSE MINIMUM CUT PROBLEM UNDER THE BOTTLENECK TYPE HAMMING DISTANCE
• Weighted inverse minimum cut problem under the sum-type Hamming distance
• Inverse problem of minimum cuts
• Capacity inverse minimum cost flow problems under the weighted Hamming distance
• Inverse minimum cost flow problems under the weighted Hamming distance

Cites work

• A WEIGHTED INVERSE MINIMUM CUT PROBLEM UNDER THE BOTTLENECK TYPE HAMMING DISTANCE
• Inverse combinatorial optimization: a survey on problems, methods, and results
• Inverse maximum flow and minimum cut problems
• Max flows in O(nm) time, or better
• Minimax inverse problems of minimum cuts
• Network flows. Theory, algorithms, and applications.
• Weighted inverse minimum cut problem under the sum-type Hamming distance

This page was built for publication: A weighted inverse minimum \(s-t\) cut problem with value constraint under the Bottleneck-type Hamming distance

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