Inverse optimization problems with multiple weight functions
From MaRDI portal
Publication:2112661
DOI10.1016/j.dam.2022.12.004OpenAlexW4313367967MaRDI QIDQ2112661
Kitti Varga, Kristóf Bérczi, Lydia Mirabel Mendoza-Cadena
Publication date: 11 January 2023
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2201.03078
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The extremal length of a network
- On an instance of the inverse shortest paths problem
- Solution structure of some inverse combinatorial optimization problems
- On the use of an inverse shortest paths algorithm for recovering linearly correlated costs
- Inverse matroid intersection problem
- A strongly polynomial algorithm for the inverse shortest arborescence problem
- On inverse problems of optimum perfect matching
- Inverse max + sum spanning tree problem under Hamming distance by modifying the sum-cost vector
- Inverse conic programming with applications
- On the inverse problem of linear programming and its application to minimum weight perfect \(k\)-matching
- Inverse combinatorial optimization: a survey on problems, methods, and results
- Weighted inverse maximum perfect matching problems under the Hamming distance
- Inverse problems of matroid intersection
- Inverse optimal value problem on minimum spanning tree under unit \(l_{\infty}\) norm
- Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes
- Algorithm for constraint partial inverse matroid problem with weight increase forbidden
- A simple algorithm and min-max formula for the inverse arborescence problem
- Robust Convex Optimization
- Inverse min-max spanning r-arborescence problem under the weighted sum-type Hamming distance
- Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths
- The inverse fractional matching problem
- An algorithm for inverse minimum spanning tree problem
- On the inverse maximum perfect matching problem under the bottleneck-type Hamming distance
- Packing rooted directed cuts in a weighted directed graph
- Market Pricing for Matroid Rank Valuations
- A Discrete Convex Min-Max Formula for Box-TDI Polyhedra
- On Correcting Inputs: Inverse Optimization for Online Structured Prediction
- Robust Portfolio Selection Problems
