An inverse problem of the weighted shortest path problem
From MaRDI portal
Publication:1894996
DOI10.1007/BF03167381zbMath0827.05031MaRDI QIDQ1894996
Publication date: 27 November 1995
Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)
05C35: Extremal problems in graph theory
90B06: Transportation, logistics and supply chain management
90B35: Deterministic scheduling theory in operations research
90B10: Deterministic network models in operations research
05C38: Paths and cycles
Related Items
Inverse maximum flow and minimum cut problems, An algorithm for inverse minimum spanning tree problem, Inverse Nonlinear Multicommodity Flow Optimization by Column Generation, A column generation method for inverse shortest path problems, A network flow method for solving some inverse combinatorial optimization problems, Some inverse optimization problems on network, Notes on inverse bin-packing problems, Note on inverse problem with \(l_\infty\) objective function, Inverse problem of minimum cuts, Inverse matroid intersection problem, A strongly polynomial algorithm for the inverse shortest arborescence problem, Inverse maximum capacity problems, Inverse optimization in high-speed networks, Inverse problems of submodular functions on digraphs, Two general methods for inverse optimization problems, Calculating some inverse linear programming problems, On inverse traveling salesman problems, 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
Cites Work
