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

Celý popis

Podrobná bibliografia

Vydané v:	Journal of global optimization Ročník 93; číslo 1; s. 263 - 298
Hlavní autori:	Ley, Eva, Merkert, Maximilian
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York, NY Springer US 01.09.2025 Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!