Inverse combinatorial optimization: a survey on problems, methods, and results
From MaRDI portal
Publication:1888171
DOI10.1023/B:JOCO.0000038914.26975.9bzbMath1084.90035OpenAlexW1979134936MaRDI QIDQ1888171
Publication date: 22 November 2004
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:joco.0000038914.26975.9b
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (only showing first 100 items - show all)
On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks ⋮ The inverse connected \(p\)-median problem on block graphs under various cost functions ⋮ Inverse conic linear programs in Banach spaces ⋮ A characterization of optimal multiprocessor schedules and new dominance rules ⋮ Partial inverse min-max spanning tree problem ⋮ On the adjustment problem for linear programs ⋮ Algorithm for constraint partial inverse matroid problem with weight increase forbidden ⋮ Inverse eccentric vertex problem on networks ⋮ Algorithms for the partial inverse matroid problem in which weights can only be increased ⋮ Capacity inverse minimum cost flow problems under the weighted Hamming distance ⋮ The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance ⋮ 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 ⋮ Improved approaches to the exact solution of the machine covering problem ⋮ Inverse minimum flow problem ⋮ An algorithm for solving the shortest path improvement problem on rooted trees under unit Hamming distance ⋮ The inverse parallel machine scheduling problem with minimum total completion time ⋮ A perturbation approach for an inverse quadratic programming problem ⋮ A bilevel programming problem with maximization of a supermodular function in the lower level ⋮ Inverse constrained bottleneck problems under weighted \(l_{\infty}\) norm ⋮ 2-balanced flows and the inverse 1-median problem in the Chebyshev space ⋮ Inverse sorting problem by minimizing the total weighted number of changes and partial inverse sorting problems ⋮ Inverse optimization for multi-objective linear programming ⋮ Inverse optimization in semi-infinite linear programs ⋮ Some inverse optimization problems on network ⋮ On the structure of the inverse-feasible region of a linear program ⋮ Robust inverse optimization ⋮ Inverse max + sum spanning tree problem under Hamming distance by modifying the sum-cost vector ⋮ On inverse traveling salesman problems ⋮ Optimality conditions for a bilevel matroid problem ⋮ Variable-sized uncertainty and inverse problems in robust optimization ⋮ An inverse approach to convex ordered median problems in trees ⋮ A branch-and-bound algorithm for instrumental variable quantile regression ⋮ Branch-and-bound algorithms for the partial inverse mixed integer linear programming problem ⋮ Weighted inverse maximum perfect matching problems under the Hamming distance ⋮ Necessary and sufficient optimality conditions for scheduling unit time jobs on identical parallel machines ⋮ 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 scheduling: Two-machine flow-shop problem ⋮ On inverse linear programming problems under the bottleneck-type weighted Hamming distance ⋮ A majorized penalty approach to inverse linear second order cone programming problems ⋮ 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 ⋮ An improved genetic algorithm for single-machine inverse scheduling problem ⋮ The inverse \(\{0,1\}\)-knapsack problem: theory, algorithms and computational experiments ⋮ Inverse min-max spanning tree problem under the weighted sum-type Hamming distance ⋮ Heuristic algorithms for the inverse mixed integer linear programming problem ⋮ Inverse max + sum spanning tree problem by modifying the sum-cost vector under weighted \(l_\infty \) norm ⋮ The inverse 1-maxian problem with edge length modification ⋮ Inverse quickest center location problem on a tree ⋮ Inverse maximum flow problem under the combination of the weighted \(l_2\) norm and the weighted Hamming distance ⋮ Inverse semidefinite quadratic programming problem with \(l_1\) norm measure ⋮ The partial inverse minimum spanning tree problem when weight increase is forbidden ⋮ The minmax regret inverse maximum weight problem ⋮ The inverse 1-median problem on a cycle ⋮ Inverse quadratic programming problem with \(l_1\) norm measure ⋮ Data-driven inverse optimization with imperfect information ⋮ Behavioral modeling in weight loss interventions ⋮ A smoothing Newton method for a type of inverse semi-definite quadratic programming problem ⋮ Outlier respecting points approximation ⋮ The 0-1 inverse maximum stable set problem ⋮ 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 ⋮ Capacity inverse minimum cost flow problem ⋮ 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 ⋮ Weighted inverse minimum spanning tree problems under Hamming distance ⋮ Inverse conic programming with applications ⋮ An augmented Lagrangian method for a class of Inverse quadratic programming problems ⋮ Achieving target equilibria in network routing games without knowing the latency functions ⋮ A polyhedral characterization of the inverse-feasible region of a mixed-integer program ⋮ Inverse max+sum spanning tree problem under weighted \(l_1\) norm by modifying the sum-cost vector ⋮ Inverse minimum cost flow problems under the weighted Hamming distance ⋮ Inverse integer programming ⋮ Inverse center location problem on a tree ⋮ Inverse multiobjective optimization: inferring decision criteria from data ⋮ Inverse integer optimization with multiple observations ⋮ An alternating direction method for solving a class of inverse semi-definite quadratic programming problems ⋮ Inverse optimization approach to the identification of electricity consumer models ⋮ Constrained inverse minimum flow problems under the weighted Hamming distance ⋮ Cutting plane algorithms for the inverse mixed integer linear programming problem ⋮ Data-driven estimation in equilibrium using inverse optimization ⋮ Up- and downgrading the 1-center in a network ⋮ Inverse generalized minimum cost flow problem under the Hamming distances ⋮ 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 single facility location problem on a tree with balancing on the distance of server to clients ⋮ 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 ⋮ 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 max+sum spanning tree problem under weighted \(l_{\infty}\) norm by modifying max-weight vector ⋮ Inverse optimization problems with multiple weight functions ⋮ Inverse feasibility problems of the inverse maximum flow problems
This page was built for publication: Inverse combinatorial optimization: a survey on problems, methods, and results
