An inverse problem of the weighted shortest path problem

DOI10.1007/BF03167381MaRDI QIDQ1894996zbMATH OpenOpenAlexFDO

Authors Shaoji Xu, Jianzhong Zhang

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

zbMATH Keywords

inverse problempolyhedral coneminimal cutset problemweighted shortest path problem

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Deterministic scheduling theory in operations research (90B35) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Transportation, logistics and supply chain management (90B06)

Recommendations

• scientific article; zbMATH DE number 815126
• Inverse multi-objective shortest pPath problem under the bottleneck type weighted Hamming distance
• A strongly polynomial algorithm for the inverse shortest arborescence problem
• On an instance of the inverse shortest paths problem
• Complexity of some inverse shortest path lengths problems

Cites work

• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• A paradigm for listing \((s,t)\)-cuts in graphs
• Graph theory with applications
• Iterative algorithms for generating minimal cutsets in directed graphs
• On an instance of the inverse shortest paths problem

Cited in

(27)

• Some inverse optimization problems on network
• Inverse conic linear programs in Banach spaces
• scientific article; zbMATH DE number 7378671 (Why is no real title available?)
• A network flow method for solving some inverse combinatorial optimization problems
• Inverse maximum capacity problems
• Note on inverse problem with l_ objective function
• Inverse matroid intersection problem
• A strongly polynomial algorithm for the inverse shortest arborescence problem
• Inverse problem of minimum cuts
• Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes
• Inverse Nonlinear Multicommodity Flow Optimization by Column Generation
• Notes on inverse bin-packing problems
• An enhanced Benders decomposition method for unique shortest path routing
• On an instance of the inverse shortest paths problem
• Inverse problems of submodular functions on digraphs
• Efficient algorithms for the reverse shortest path problem on trees under the Hamming distance
• The restricted inverse optimal value problem on shortest path under \(l_1\) norm on trees
• scientific article; zbMATH DE number 815126 (Why is no real title available?)
• Calculating some inverse linear programming problems
• On inverse traveling salesman problems
• An algorithm for inverse minimum spanning tree problem
• Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths
• Inverse maximum flow and minimum cut problems
• A column generation method for inverse shortest path problems
• The shortest path improvement problems under Hamming distance
• Two general methods for inverse optimization problems
• Inverse optimization in high-speed networks

This page was built for publication: An inverse problem of the weighted shortest path problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1894996)