On an instance of the inverse shortest paths problem

From MaRDI portal
Publication:1184336

DOI10.1007/BF01585693zbMath0756.90089MaRDI QIDQ1184336

S. Singh

Publication date: 28 June 1992

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)




Related Items

Inverse attribute‐based optimization with an application in assortment optimizationOn reverse shortest paths in geometric proximity graphsThe restricted inverse optimal value problem on shortest path under \(l_1\) norm on treesPartial inverse min-max spanning tree problem under the weighted bottleneck Hamming distanceUnnamed ItemA network flow method for solving some inverse combinatorial optimization problemsRobust partial inverse network flow problemsA perturbation approach for an inverse quadratic programming problem over second-order conesThe inverse connected \(p\)-median problem on block graphs under various cost functionsInverse conic linear programs in Banach spacesReverse shortest path problem for unit-disk graphsContinuity of Optimal Solution Functions and their Conditions on Objective FunctionsAlgorithm for constraint partial inverse matroid problem with weight increase forbiddenAn interior-point algorithm for solving inverse linear optimization problemAlgorithms for the partial inverse matroid problem in which weights can only be increasedThe 0–1 inverse maximum independent set problem on forests and unicyclic graphsAn inverse problem of the weighted shortest path problemDecomposition and Adaptive Sampling for Data-Driven Inverse Linear OptimizationCapacity inverse minimum cost flow problems under the weighted Hamming distanceInverse chromatic number problems in interval and permutation graphsThe shortest path improvement problems under Hamming distanceSome inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changesInverse median problemsShortest paths in stochastic networks with correlated link costsReverse shortest path problem in weighted unit-disk graphsInverse matroid intersection problemInverse minimum flow problemGeneralized Inverse Multiobjective Optimization with Application to Cancer TherapyA simple algorithm and min-max formula for the inverse arborescence problemAn algorithm for solving the shortest path improvement problem on rooted trees under unit Hamming distanceA parameter optimization heuristic for a temperature estimation modelInverse Mixed Integer Optimization: Polyhedral Insights and Trust Region MethodsCalculating some inverse linear programming problemsA strongly polynomial algorithm for the inverse shortest arborescence problemA perturbation approach for an inverse quadratic programming problemA column generation method for inverse shortest path problemsObjective Selection for Cancer Treatment: An Inverse Optimization ApproachInverse maximum capacity problemsInverse optimization for multi-objective linear programmingSome inverse optimization problems on networkOn inverse traveling salesman problemsInverse optimization in high-speed networksThe inverse maximum dynamic flow problemBranch-and-bound algorithms for the partial inverse mixed integer linear programming problemUnnamed ItemPartial inverse maximum spanning tree in which weight can only be decreased under \(l_p\)-normComputational aspects of the inverse single facility location problem on trees under \(l_k\)-normInverse maximum flow and minimum cut problemsOn inverse linear programming problems under the bottleneck-type weighted Hamming distanceNETWORK DESIGN FOR MINIMUM SPANNING TREES UNDER HAMMING DISTANCEA majorized penalty approach to inverse linear second order cone programming problemsWeight reduction problems with certain bottleneck objectives.Computation of inverse 1-center location problem on the weighted trapezoid graphsInverse multi-objective combinatorial optimizationNotes on inverse bin-packing problemsThe augmented Lagrangian method for a type of inverse quadratic programming problems over second-order conesThe inverse \(\{0,1\}\)-knapsack problem: theory, algorithms and computational experimentsConvex optimization techniques in compliant assembly simulationHeuristic algorithms for the inverse mixed integer linear programming problemA nonconvex ADMM for a class of sparse inverse semidefinite quadratic programming problemsA perturbation approach for a type of inverse linear programming problemsValid cycles: A source of infeasibility in open shortest path first routingReverse maximum flow problem under the weighted Chebyshev distanceA penalty function method for solving inverse optimal value problemInverse semidefinite quadratic programming problem with \(l_1\) norm measureAn inverse optimization approach for a capacitated vehicle routing problemThe minmax regret inverse maximum weight problemThe inverse 1-median problem on a cycleAn algorithm for inverse minimum spanning tree problemInverse quadratic programming problem with \(l_1\) norm measureData-driven inverse optimization with imperfect informationA smoothing Newton method for a type of inverse semi-definite quadratic programming problemOutlier respecting points approximationInverse Nonlinear Multicommodity Flow Optimization by Column GenerationComplexity and algorithms for nonlinear optimization problemsInverse \(p\)-median problems with variable edge lengthsInverse problems and solution methods for a class of nonlinear complementarity problemsInverse minimum flow problem under the weighted sum-type Hamming distanceThe inverse optimal value problemThe inverse Fermat-Weber problemUnnamed ItemCapacity inverse minimum cost flow problemA class of inverse dominant problems under weighted \(l_{\infty }\) norm and an improved complexity bound for Radzik's algorithmInverse conic programming with applicationsComplexity of some inverse shortest path lengths problemsAn augmented Lagrangian method for a class of Inverse quadratic programming problemsAchieving target equilibria in network routing games without knowing the latency functionsInverse integer optimization with multiple observationsAn alternating direction method for solving a class of inverse semi-definite quadratic programming problemsOn the inverse problem of linear programming and its application to minimum weight perfect \(k\)-matchingConstrained inverse minimum flow problems under the weighted Hamming distanceTwo general methods for inverse optimization problemsCutting plane algorithms for the inverse mixed integer linear programming problemInverse Optimization with Noisy DataThe base-matroid and inverse combinatorial optimization problems.Efficient algorithms for the reverse shortest path problem on trees under the hamming distanceOptimization of OSPF Routing in IP NetworksInverse problems of submodular functions on digraphsSome reverse location problemsInverse optimization for linearly constrained convex separable programming problemsGeneral restricted inverse assignment problems under \(l_1\) and \(l_{\infty}\) normsInverse 1-median problem on trees under mixed rectilinear and Chebyshev normsInverse problem of minimum cutsA further study on inverse linear programming problemsSome inverse optimization problems under the Hamming distanceOptimal Algorithms for Inverse Eccentric Vertex Location Problem on Extended Star NetworksOn the use of an inverse shortest paths algorithm for recovering linearly correlated costsInverse optimization problems with multiple weight functions


Uses Software


Cites Work