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

DOI10.1142/S0217595923500094zbMATH Open1548.90474MaRDI QIDQ6561572FDOQ6561572

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)

zbMATH Keywords

inverse problembinary searchstrongly polynomial time algorithmBottleneck-type Hamming distance

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

• Network flows. Theory, algorithms, and applications.
• 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
• A WEIGHTED INVERSE MINIMUM CUT PROBLEM UNDER THE BOTTLENECK TYPE HAMMING DISTANCE
• Weighted Inverse Minimum Cut Problem under the Sum-Type Hamming Distance
• Minimax inverse problems of minimum cuts

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)