research
∙
02/26/2023
Newton-type algorithms for inverse optimization II: weighted span objective
In inverse optimization problems, the goal is to modify the costs in an ...
share
research
∙
02/26/2023
Newton-type algorithms for inverse optimization I: weighted bottleneck Hamming distance and ℓ_∞-norm objectives
In minimum-cost inverse optimization problems, we are given a feasible s...
research
∙
10/01/2022
Conditions for minimally tough graphs
Katona, Soltész, and Varga showed that no induced subgraph can be exclud...
research
∙
01/09/2022
Inverse optimization problems with multiple weight functions
We introduce a new class of inverse optimization problems in which an in...
research
∙
10/19/2019
Strengthening some complexity results on toughness of graphs
Let t be a positive real number. A graph is called t-tough if the remova...
research
∙
10/19/2018
