A column generation method for inverse shortest path problems

DOI10.1007/BF01432364zbMath0838.90134OpenAlexW2021388365MaRDI QIDQ4845144

Zhongfan Ma, Chao Yang, Zhang, Jianzhong

Publication date: 4 September 1995

Published in: [https://portal.mardi4nfdi.de/entity/Q4289815 ZOR Zeitschrift f�r Operations Research Mathematical Methods of Operations Research] (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01432364

zbMATH Keywords

column generationsimplex methodinverse shortest path problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Linear programming (90C05)

Related Items

Input estimation and identification of extra inputs in inverse DEA models, The shortest path improvement problems under Hamming distance, Inverse matroid intersection problem, Inverse minimum flow problem, An algorithm for solving the shortest path improvement problem on rooted trees under unit Hamming distance, Calculating some inverse linear programming problems, Inverse maximum capacity problems, Some inverse optimization problems on network, Inverse optimization in high-speed networks, The restricted inverse optimal value problem on shortest path under \(l_1\) norm on trees, Inverse maximum flow and minimum cut problems, Notes on inverse bin-packing problems, Heuristic algorithms for the inverse mixed integer linear programming problem, A network flow method for solving some inverse combinatorial optimization problems, An inverse robust optimisation approach for a class of vehicle routing problems under uncertainty, An inverse DEA model for inputs/outputs estimate, An algorithm for inverse minimum spanning tree problem, Note on inverse problem with \(l_\infty\) objective function, Efficient algorithms for the reverse shortest path problem on trees under the hamming distance, Inverse problems of submodular functions on digraphs, Some reverse location problems, Inverse optimization for linearly constrained convex separable programming problems, Inverse problem of minimum cuts

Cites Work

• A numerically stable dual method for solving strictly convex quadratic programs
• On an instance of the inverse shortest paths problem
• On the use of an inverse shortest paths algorithm for recovering linearly correlated costs
• An inverse problem of the weighted shortest path problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item