On an instance of the inverse shortest paths problem
From MaRDI portal
Publication:1184336
DOI10.1007/BF01585693zbMath0756.90089MaRDI QIDQ1184336
Publication date: 28 June 1992
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Quadratic programming (90C20) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Inverse attribute‐based optimization with an application in assortment optimization ⋮ On reverse shortest paths in geometric proximity graphs ⋮ The restricted inverse optimal value problem on shortest path under \(l_1\) norm on trees ⋮ Partial inverse min-max spanning tree problem under the weighted bottleneck Hamming distance ⋮ Unnamed Item ⋮ A network flow method for solving some inverse combinatorial optimization problems ⋮ Robust partial inverse network flow problems ⋮ A perturbation approach for an inverse quadratic programming problem over second-order cones ⋮ The inverse connected \(p\)-median problem on block graphs under various cost functions ⋮ Inverse conic linear programs in Banach spaces ⋮ Reverse shortest path problem for unit-disk graphs ⋮ Continuity of Optimal Solution Functions and their Conditions on Objective Functions ⋮ Algorithm for constraint partial inverse matroid problem with weight increase forbidden ⋮ An interior-point algorithm for solving inverse linear optimization problem ⋮ Algorithms for the partial inverse matroid problem in which weights can only be increased ⋮ The 0–1 inverse maximum independent set problem on forests and unicyclic graphs ⋮ An inverse problem of the weighted shortest path problem ⋮ Decomposition and Adaptive Sampling for Data-Driven Inverse Linear Optimization ⋮ Capacity inverse minimum cost flow problems under the weighted Hamming distance ⋮ Inverse chromatic number problems in interval and permutation graphs ⋮ 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 median problems ⋮ Shortest paths in stochastic networks with correlated link costs ⋮ Reverse shortest path problem in weighted unit-disk graphs ⋮ Inverse matroid intersection problem ⋮ Inverse minimum flow problem ⋮ Generalized Inverse Multiobjective Optimization with Application to Cancer Therapy ⋮ A simple algorithm and min-max formula for the inverse arborescence problem ⋮ An algorithm for solving the shortest path improvement problem on rooted trees under unit Hamming distance ⋮ A parameter optimization heuristic for a temperature estimation model ⋮ Inverse Mixed Integer Optimization: Polyhedral Insights and Trust Region Methods ⋮ Calculating some inverse linear programming problems ⋮ A strongly polynomial algorithm for the inverse shortest arborescence problem ⋮ A perturbation approach for an inverse quadratic programming problem ⋮ A column generation method for inverse shortest path problems ⋮ Objective Selection for Cancer Treatment: An Inverse Optimization Approach ⋮ Inverse maximum capacity problems ⋮ Inverse optimization for multi-objective linear programming ⋮ Some inverse optimization problems on network ⋮ On inverse traveling salesman problems ⋮ Inverse optimization in high-speed networks ⋮ The inverse maximum dynamic flow problem ⋮ Branch-and-bound algorithms for the partial inverse mixed integer linear programming problem ⋮ Unnamed Item ⋮ Partial inverse maximum spanning tree in which weight can only be decreased under \(l_p\)-norm ⋮ Computational aspects of the inverse single facility location problem on trees under \(l_k\)-norm ⋮ Inverse maximum flow and minimum cut problems ⋮ On inverse linear programming problems under the bottleneck-type weighted Hamming distance ⋮ NETWORK DESIGN FOR MINIMUM SPANNING TREES UNDER HAMMING DISTANCE ⋮ A majorized penalty approach to inverse linear second order cone programming problems ⋮ Weight reduction problems with certain bottleneck objectives. ⋮ Computation of inverse 1-center location problem on the weighted trapezoid graphs ⋮ Inverse multi-objective combinatorial optimization ⋮ Notes on inverse bin-packing problems ⋮ The augmented Lagrangian method for a type of inverse quadratic programming problems over second-order cones ⋮ The inverse \(\{0,1\}\)-knapsack problem: theory, algorithms and computational experiments ⋮ Convex optimization techniques in compliant assembly simulation ⋮ Heuristic algorithms for the inverse mixed integer linear programming problem ⋮ A nonconvex ADMM for a class of sparse inverse semidefinite quadratic programming problems ⋮ A perturbation approach for a type of inverse linear programming problems ⋮ Valid cycles: A source of infeasibility in open shortest path first routing ⋮ Reverse maximum flow problem under the weighted Chebyshev distance ⋮ A penalty function method for solving inverse optimal value problem ⋮ Inverse semidefinite quadratic programming problem with \(l_1\) norm measure ⋮ An inverse optimization approach for a capacitated vehicle routing problem ⋮ The minmax regret inverse maximum weight problem ⋮ The inverse 1-median problem on a cycle ⋮ An algorithm for inverse minimum spanning tree problem ⋮ Inverse quadratic programming problem with \(l_1\) norm measure ⋮ Data-driven inverse optimization with imperfect information ⋮ A smoothing Newton method for a type of inverse semi-definite quadratic programming problem ⋮ Outlier respecting points approximation ⋮ Inverse Nonlinear Multicommodity Flow Optimization by Column Generation ⋮ Complexity and algorithms for nonlinear optimization problems ⋮ Inverse \(p\)-median problems with variable edge lengths ⋮ Inverse problems and solution methods for a class of nonlinear complementarity problems ⋮ Inverse minimum flow problem under the weighted sum-type Hamming distance ⋮ The inverse optimal value problem ⋮ The inverse Fermat-Weber problem ⋮ Unnamed Item ⋮ Capacity inverse minimum cost flow problem ⋮ A class of inverse dominant problems under weighted \(l_{\infty }\) norm and an improved complexity bound for Radzik's algorithm ⋮ Inverse conic programming with applications ⋮ Complexity of some inverse shortest path lengths problems ⋮ An augmented Lagrangian method for a class of Inverse quadratic programming problems ⋮ Achieving target equilibria in network routing games without knowing the latency functions ⋮ Inverse integer optimization with multiple observations ⋮ An alternating direction method for solving a class of inverse semi-definite quadratic programming problems ⋮ On the inverse problem of linear programming and its application to minimum weight perfect \(k\)-matching ⋮ Constrained inverse minimum flow problems under the weighted Hamming distance ⋮ Two general methods for inverse optimization problems ⋮ Cutting plane algorithms for the inverse mixed integer linear programming problem ⋮ Inverse Optimization with Noisy Data ⋮ The base-matroid and inverse combinatorial optimization problems. ⋮ Efficient algorithms for the reverse shortest path problem on trees under the hamming distance ⋮ Optimization of OSPF Routing in IP Networks ⋮ Inverse problems of submodular functions on digraphs ⋮ Some reverse location problems ⋮ Inverse optimization for linearly constrained convex separable programming problems ⋮ General restricted inverse assignment problems under \(l_1\) and \(l_{\infty}\) norms ⋮ Inverse 1-median problem on trees under mixed rectilinear and Chebyshev norms ⋮ Inverse problem of minimum cuts ⋮ 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 ⋮ On the use of an inverse shortest paths algorithm for recovering linearly correlated costs ⋮ Inverse optimization problems with multiple weight functions
Uses Software
Cites Work
- A numerically stable dual method for solving strictly convex quadratic programs
- A note on two problems in connexion with graphs
- On the quadratic programming algorithm of Goldfarb and Idnani
- A projected newton method forl p norm location problems
- A Stable Algorithm for Solving the Multifacility Location Problem Involving Euclidean Distances
- Efficient Algorithms for Shortest Paths in Sparse Networks
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
