Inverse combinatorial optimization: a survey on problems, methods, and results
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- 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
- Solution structure of some inverse combinatorial optimization problems
- Inverse optimization in high-speed networks
- Inverse problems of submodular functions on digraphs
- A general model of some inverse combinatorial optimization problems and its solution method under \(\ell_\infty\) norm
- On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks
- An algorithm for solving the shortest path improvement problem on rooted trees under unit Hamming distance
- Inverse max + sum spanning tree problem under Hamming distance by modifying the sum-cost vector
- Variable-sized uncertainty and inverse problems in robust optimization
- A branch-and-bound algorithm for instrumental variable quantile regression
- 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
- On inverse linear programming problems under the bottleneck-type weighted Hamming distance
- An improved genetic algorithm for single-machine inverse scheduling problem
- Inverse quickest center location problem on a tree
- The inverse optimal value problem
- Weighted inverse minimum spanning tree problems under Hamming distance
- Inverse conic programming with applications
- A polyhedral characterization of the inverse-feasible region of a mixed-integer program
- The complexity analysis of the inverse center location problem
- 2-balanced flows and the inverse 1-median problem in the Chebyshev space
- On inverse traveling salesman problems
- Branch-and-bound algorithms for the partial inverse mixed integer linear programming problem
- Weighted inverse maximum perfect matching problems under the Hamming distance
- Inverse semidefinite quadratic programming problem with \(l_1\) norm measure
- Behavioral modeling in weight loss interventions
- Inverse minimum flow problem under the weighted sum-type Hamming distance
- Inverse multiobjective optimization: inferring decision criteria from data
- Inverse integer optimization with multiple observations
- Inverse optimization approach to the identification of electricity consumer models
- Constrained inverse minimum flow problems under the weighted Hamming distance
- Inverse single facility location problem on a tree with balancing on the distance of server to clients
- General restricted inverse assignment problems under \(l_1\) and \(l_{\infty}\) 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 optimization in semi-infinite linear programs
- Computational aspects of the inverse single facility location problem on trees under l_k-norm
- Computation of inverse 1-center location problem on the weighted trapezoid graphs
- Inverse maximum flow problem under the combination of the weighted \(l_2\) norm and the weighted Hamming distance
- The minmax regret inverse maximum weight problem
- Inverse quadratic programming problem with \(l_1\) norm measure
- Capacity inverse minimum cost flow problem
- Achieving target equilibria in network routing games without knowing the latency functions
- Inverse generalized minimum cost flow problem under the Hamming distances
- Inverse 1-median problem on trees under mixed rectilinear and Chebyshev norms
- 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
- Improved approaches to the exact solution of the machine covering problem
- Inverse optimization for multi-objective linear programming
- On the structure of the inverse-feasible region of a linear program
- Robust inverse optimization
- A majorized penalty approach to inverse linear second order cone programming problems
- Inverse multi-objective combinatorial optimization
- The inverse \(\{0,1\}\)-knapsack problem: theory, algorithms and computational experiments
- 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
- An alternating direction method for solving a class of inverse semi-definite quadratic programming problems
- Inverse feasibility problems of the inverse maximum flow problems
- Algorithm for constraint partial inverse matroid problem with weight increase forbidden
- Partial inverse assignment problems under \(l_{1}\) norm
- A simple algorithm and min-max formula for the inverse arborescence problem
- Upgrading edges in the maximal covering location problem
- The 1-median problem in \(\mathbb{R}^d\) with the Chebyshev-norm and its inverse problem
- Web services selection based on inverse optimization problems
- Generalized inverse multiobjective optimization with application to cancer therapy
- Inverse eccentric vertex problem on networks
- Complexity of some inverse shortest path lengths problems
- The partial inverse minimum cut problem with L₁-norm is strongly NP-hard
- scientific article; zbMATH DE number 5823945 (Why is no real title available?)
- Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
- 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 0-1 inverse maximum independent set problem on forests and unicyclic graphs
- The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance
- Constrained and bicriteria inverse bottleneck optimization problems under weighted Hamming distance
- Continuity of optimal solution functions and their conditions on objective functions
- 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
- The inverse parallel machine scheduling problem with minimum total completion time
- A bilevel programming problem with maximization of a supermodular function in the lower level
- Some inverse optimization problems on network
- Optimality conditions for a bilevel matroid problem
- An inverse approach to convex ordered median problems in trees
- Notes on inverse bin-packing problems
- The augmented Lagrangian method for a type of inverse quadratic programming problems over second-order cones
- Reverse maximum flow problem under the weighted Chebyshev distance
- Inverse max + sum spanning tree problem by modifying the sum-cost vector under weighted \(l_\infty \) norm
- Inverse optimization with noisy data
- Efficient algorithms for the reverse shortest path problem on trees under the Hamming distance
- Algorithms for inverse optimization problems
This page was built for publication: Inverse combinatorial optimization: a survey on problems, methods, and results
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1888171)
