Inverse combinatorial optimization: a survey on problems, methods, and results
From MaRDI portal
Publication:1888171
DOI10.1023/B:JOCO.0000038914.26975.9bzbMath1084.90035MaRDI QIDQ1888171
Publication date: 22 November 2004
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
90C35: Programming involving graphs or networks
90C27: Combinatorial optimization
90-02: Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming
Related Items
Inverse Booking Problem: Inverse Chromatic Number Problem in Interval Graphs, Inverse integer programming, Inverse center location problem on a tree, Inverse minimum flow problem, Inverse constrained bottleneck problems under weighted \(l_{\infty}\) norm, Inverse sorting problem by minimizing the total weighted number of changes and partial inverse sorting problems, Inverse min-max spanning tree problem under the weighted sum-type Hamming distance, The inverse 1-maxian problem with edge length modification, The inverse 1-median problem on a cycle, A smoothing Newton method for a type of inverse semi-definite quadratic programming problem, The 0-1 inverse maximum stable set problem, The inverse Fermat-Weber problem, Cutting plane algorithms for the inverse mixed integer linear programming problem, Up- and downgrading the 1-center in a network, Constrained inverse min-max spanning tree problems under the weighted Hamming distance, Efficient algorithms for the inverse sorting problem with bound constraints under the \(l_{\infty }\)-norm and the Hamming distance, Inverse scheduling with maximum lateness objective, Inverse optimization for linearly constrained convex separable programming problems, Inverse 1-center location problems with edge length augmentation on trees, The inverse optimal value problem, Weighted inverse minimum spanning tree problems under Hamming distance, Inverse conic programming with applications, Capacity inverse minimum cost flow problem, On the adjustment problem for linear programs, Inverse maximum flow problems under the weighted Hamming distance, Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes, The partial inverse minimum spanning tree problem when weight increase is forbidden, Constrained inverse minimum spanning tree problems under the bottleneck-type Hamming distance, A class of inverse dominant problems under weighted \(l_{\infty }\) norm and an improved complexity bound for Radzik's algorithm, Partial inverse assignment problems under \(l_{1}\) norm, A WEIGHTED INVERSE MINIMUM CUT PROBLEM UNDER THE BOTTLENECK TYPE HAMMING DISTANCE, Some Inverse Traveling Salesman Problems, Valid cycles: A source of infeasibility in open shortest path first routing, The inverse maximum flow problem consideringl∞norm
