Solution methods for partial inverse combinatorial optimization problems in which weights can only be increased

Partial inverse combinatorial optimization problems are bilevel optimization problems in which the leader aims to incentivize the follower to include respectively not include given sets of elements in the solution of their combinatorial problem. If the sets of required and forbidden elements define...

Full description

Bibliographic Details

Published in:	Journal of global optimization Vol. 93; no. 1; pp. 263 - 298
Main Authors:	Ley, Eva, Merkert, Maximilian
Format:	Journal Article
Language:	English
Published:	New York, NY Springer US 01.09.2025 Springer Nature B.V
Subjects:	Assignment problem Bilevel optimization Branch and bound Combinatorial analysis Inverse problems Mixed-integer programming Optimization Parameter estimation Polynomials Shortest-path problems
ISSN:	1573-2916, 0925-5001, 1573-2916
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!