A weighted inverse minimum \(s-t\) cut problem with value constraint under the Bottleneck-type Hamming distance
type: Item
instance of: scholarly article
title: A weighted inverse minimum \(s-t\) cut problem with value constraint under the Bottleneck-type Hamming distance
zbMATH Open document ID: 1548.90474
author: Elham Ramzani Ghalebala
author: Massoud Aman
author: Nasim Nasrabadi
published in: Asia-Pacific Journal of Operational Research
publication date: 2024-06-25T00:00:00Z
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 7870971
zbMATH Keywords: inverse problem
zbMATH Keywords: Bottleneck-type Hamming distance
zbMATH Keywords: binary search
zbMATH Keywords: strongly polynomial time algorithm
MaRDI profile type: Publication
cites work: Q3056948
cites work: Inverse combinatorial optimization: a survey on problems, methods, and results
cites work: Weighted Inverse Minimum Cut Problem under the Sum-Type Hamming Distance
cites work: A WEIGHTED INVERSE MINIMUM CUT PROBLEM UNDER THE BOTTLENECK TYPE HAMMING DISTANCE
cites work: Max flows in O(nm) time, or better
cites work: Minimax inverse problems of minimum cuts
cites work: Inverse maximum flow and minimum cut problems
DOI: 10.1142/S0217595923500094
description: scientific article; zbMATH DE number 7870971