Two general methods for inverse optimization problems
From MaRDI portal
Recommendations
Cites work
Cited in
(20)- Computation of inverse 1-center location problem on the weighted trapezoid graphs
- The inverse \(\{0,1\}\)-knapsack problem: theory, algorithms and computational experiments
- Branch-and-bound algorithms for the partial inverse mixed integer linear programming problem
- Inverse multi-objective combinatorial optimization
- scientific article; zbMATH DE number 2030326 (Why is no real title available?)
- Inverse polynomial optimization
- Application of Second-Order Optimization Methods to Solving the Inverse Coefficient Problems
- Inverse problems of mathematical programming. Global optimization methods.
- Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes
- The optimization of road building schedule based on budget restriction
- Inverse max + sum spanning tree problem by modifying the sum-cost vector under weighted \(l_\infty \) norm
- Heuristic algorithms for the inverse mixed integer linear programming problem
- An inverse optimization approach for a capacitated vehicle routing problem
- Inverse problems of submodular functions on digraphs
- Cutting plane algorithms for the inverse mixed integer linear programming problem
- Some reverse location problems
- An inverse model for the most uniform problem
- A class of bottleneck expansion problems
- A general model of some inverse combinatorial optimization problems and its solution method under \(\ell_\infty\) norm
- Some inverse optimization problems under the Hamming distance
This page was built for publication: Two general methods for inverse optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1808980)
