An inverse problem of the weighted shortest path problem
From MaRDI portal
Publication:1894996
DOI10.1007/BF03167381zbMath0827.05031OpenAlexW2083358979MaRDI QIDQ1894996
Publication date: 27 November 1995
Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf03167381
Extremal problems in graph theory (05C35) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10) Paths and cycles (05C38)
Related Items
Inverse conic linear programs in Banach spaces ⋮ The shortest path improvement problems under Hamming distance ⋮ Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes ⋮ Inverse matroid intersection problem ⋮ Calculating some inverse linear programming problems ⋮ A strongly polynomial algorithm for the inverse shortest arborescence problem ⋮ A column generation method for inverse shortest path problems ⋮ Inverse maximum capacity problems ⋮ Some inverse optimization problems on network ⋮ On inverse traveling salesman problems ⋮ Inverse optimization in high-speed networks ⋮ The restricted inverse optimal value problem on shortest path under \(l_1\) norm on trees ⋮ Unnamed Item ⋮ Inverse maximum flow and minimum cut problems ⋮ Notes on inverse bin-packing problems ⋮ A network flow method for solving some inverse combinatorial optimization problems ⋮ An algorithm for inverse minimum spanning tree problem ⋮ Inverse Nonlinear Multicommodity Flow Optimization by Column Generation ⋮ Two general methods for inverse optimization problems ⋮ 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 ⋮ Inverse problem of minimum cuts
Cites Work