A network flow method for solving some inverse combinatorial optimization problems
From MaRDI portal
Publication:5689828
DOI10.1080/02331939608844197zbMath0866.90099OpenAlexW1994443503MaRDI QIDQ5689828
Publication date: 4 August 1997
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331939608844197
shortest path treeminimum spanning treeassignmentinverse combinatiorial optimizationmaximum-weight circulation problems
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)
Related Items (16)
Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes ⋮ Partial inverse assignment problems under \(l_{1}\) norm ⋮ Inverse maximum capacity problems ⋮ Inverse maximum flow and minimum cut problems ⋮ Computation of inverse 1-center location problem on the weighted trapezoid graphs ⋮ Inverse optimal value problem on minimum spanning tree under unit \(l_{\infty}\) norm ⋮ The partial inverse minimum spanning tree problem when weight increase is forbidden ⋮ Complexity of Partial Inverse Assignment Problem and Partial Inverse Cut Problem ⋮ A class of bottleneck expansion problems ⋮ Capacitated inverse optimal value problem on minimum spanning tree under bottleneck Hamming distance ⋮ Note on inverse problem with \(l_\infty\) objective function ⋮ Efficient algorithms for the reverse shortest path problem on trees under the hamming distance ⋮ Inverse problems of submodular functions on digraphs ⋮ Some reverse location problems ⋮ Inverse problem of minimum cuts ⋮ A further study on inverse linear programming problems
Cites Work
This page was built for publication: A network flow method for solving some inverse combinatorial optimization problems
