On the use of an inverse shortest paths algorithm for recovering linearly correlated costs
From MaRDI portal
Publication:1315428
DOI10.1007/BF01582056zbMath0795.90080OpenAlexW1968988195WikidataQ58185914 ScholiaQ58185914MaRDI QIDQ1315428
Publication date: 14 September 1994
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01582056
Programming involving graphs or networks (90C35) Quadratic programming (90C20) Traffic problems in operations research (90B20)
Related Items (40)
Inverse conic linear programs in Banach spaces ⋮ Reconstruction of graphs based on random walks ⋮ Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes ⋮ Shortest paths in stochastic networks with correlated link costs ⋮ A constructive algorithm for realizing a distance matrix ⋮ Inverse minimum flow problem ⋮ A parameter optimization heuristic for a temperature estimation model ⋮ A column generation method for inverse shortest path 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 ⋮ The inverse maximum dynamic flow problem ⋮ Unnamed Item ⋮ On inverse linear programming problems under the bottleneck-type weighted Hamming distance ⋮ Notes on inverse bin-packing problems ⋮ Unnamed Item ⋮ Reverse maximum flow problem under the weighted Chebyshev distance ⋮ A penalty function method for solving inverse optimal value problem ⋮ An inverse optimization approach for a capacitated vehicle routing problem ⋮ Inverse Nonlinear Multicommodity Flow Optimization by Column Generation ⋮ Distance spectra of graphs: a survey ⋮ Complexity and algorithms for nonlinear optimization problems ⋮ Inverse problems and solution methods for a class of nonlinear complementarity problems ⋮ The inverse optimal value problem ⋮ Capacity inverse minimum cost flow problem ⋮ A penalty function method based on bilevel programming for solving inverse optimal value problems ⋮ Inverse conic programming with applications ⋮ Complexity of some inverse shortest path lengths problems ⋮ Achieving target equilibria in network routing games without knowing the latency functions ⋮ Inverse integer optimization with multiple observations ⋮ On the inverse problem of linear programming and its application to minimum weight perfect \(k\)-matching ⋮ Weak optimal inverse problems of interval linear programming based on KKT conditions ⋮ Efficient algorithms for the reverse shortest path problem on trees under the hamming distance ⋮ Some reverse location problems ⋮ Inverse optimization for linearly constrained convex separable programming problems ⋮ A further study on inverse linear programming problems ⋮ Some inverse optimization problems under the Hamming distance ⋮ Optimal Algorithms for Inverse Eccentric Vertex Location Problem on Extended Star Networks ⋮ Inverse optimization problems with multiple weight functions
Cites Work
This page was built for publication: On the use of an inverse shortest paths algorithm for recovering linearly correlated costs
