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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of global optimization Jg. 93; H. 1; S. 263 - 298
Hauptverfasser:	Ley, Eva, Merkert, Maximilian
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York, NY Springer US 01.09.2025 Springer Nature B.V
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!