Abstract
We consider a set of inverse combinatorial optimization problems including inverse problems of minimum spanning tree problem, assignment problem and shortest path tree problem, etc. We suggest a method to solve these problems which first uses optimality conditions to formulate the inverse problems as some linear programming problems, find their dual problems, and then construct suitable network models to convert the dual problems into maximum-weight circulation problems. By using this method, the class of inverse problems can be handled uniformly with a strongly polynomial complexity.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
