{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T13:05:30Z","timestamp":1753880730101,"version":"3.41.2"},"reference-count":9,"publisher":"World Scientific Pub Co Pte Ltd","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Asia Pac. J. Oper. Res."],"published-print":{"date-parts":[[2024,2]]},"abstract":"<jats:p> Given a network [Formula: see text] and an [Formula: see text] cut [Formula: see text] with the capacity [Formula: see text] and the constant value [Formula: see text], an inverse minimum [Formula: see text] cut problem with value constraint is to modify the vector capacity [Formula: see text] as little as possible to make the [Formula: see text] cut [Formula: see text] become a minimum [Formula: see text] cut with the capacity [Formula: see text]. The distinctive feature of this problem with the inverse minimum cut problems is the addition of a constraint in which the capacity of the given cut has to equal to the preassumed value [Formula: see text]. In this paper, we investigate the inverse minimum [Formula: see text] cut problem with value constraint under the bottleneck weighted Hamming distance. We propose two strongly polynomial time algorithms based on a binary search to solve the problem. At each iteration of the first one, we solve a feasible flow problem. The second algorithm considers the problem in two cases [Formula: see text] and [Formula: see text]. In this algorithm, we first modify the capacity vector such that the given cut becomes a minimum [Formula: see text] cut in the network and then, by preserving optimality this [Formula: see text] cut, adjust it to satisfy value constraint. <\/jats:p>","DOI":"10.1142\/s0217595923500094","type":"journal-article","created":{"date-parts":[[2023,2,24]],"date-time":"2023-02-24T08:09:21Z","timestamp":1677226161000},"source":"Crossref","is-referenced-by-count":0,"title":["A Weighted Inverse Minimum s \u2212 t Cut Problem with Value Constraint Under the Bottleneck-Type Hamming Distance"],"prefix":"10.1142","volume":"41","author":[{"given":"Elham Ramzani","family":"Ghalebala","sequence":"first","affiliation":[{"name":"Department of Mathematics, Faculty of Mathematics and Statistics, University of Birjand, Khorasan-e-Jonobi, Birjand, Iran"}]},{"given":"Massoud","family":"Aman","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Faculty of Mathematics and Statistics, University of Birjand, Khorasan-e-Jonobi, Birjand, Iran"}]},{"given":"Nasim","family":"Nasrabadi","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Faculty of Mathematics and Statistics, University of Birjand, Khorasan-e-Jonobi, Birjand, Iran"}]}],"member":"219","published-online":{"date-parts":[[2023,5,27]]},"reference":[{"volume-title":"Network Flows, Theory, Algorithms, and Applications","year":"1993","author":"Ahuja RK","key":"S0217595923500094BIB001"},{"volume-title":"Combinatorial Algorithms for Inverse Network Flow Problems","year":"1998","author":"Ahuja RK","key":"S0217595923500094BIB002"},{"key":"S0217595923500094BIB003","doi-asserted-by":"publisher","DOI":"10.3390\/math8091494"},{"key":"S0217595923500094BIB004","doi-asserted-by":"publisher","DOI":"10.1023\/B:JOCO.0000038914.26975.9b"},{"key":"S0217595923500094BIB005","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29700-7_3"},{"key":"S0217595923500094BIB006","doi-asserted-by":"publisher","DOI":"10.1142\/S0217595907001474"},{"key":"S0217595923500094BIB007","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488705"},{"key":"S0217595923500094BIB008","doi-asserted-by":"publisher","DOI":"10.1002\/net.10000"},{"key":"S0217595923500094BIB009","doi-asserted-by":"publisher","DOI":"10.1080\/02331939708844306"}],"container-title":["Asia-Pacific Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0217595923500094","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,14]],"date-time":"2024-02-14T15:56:39Z","timestamp":1707926199000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S0217595923500094"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,27]]},"references-count":9,"journal-issue":{"issue":"01","published-print":{"date-parts":[[2024,2]]}},"alternative-id":["10.1142\/S0217595923500094"],"URL":"https:\/\/doi.org\/10.1142\/s0217595923500094","relation":{},"ISSN":["0217-5959","1793-7019"],"issn-type":[{"type":"print","value":"0217-5959"},{"type":"electronic","value":"1793-7019"}],"subject":[],"published":{"date-parts":[[2023,5,27]]},"article-number":"2350009"}}