Pages that link to "Item:Q976987"
From MaRDI portal
The following pages link to The computational complexity of bilevel assignment problems (Q976987):
Displaying 6 items.
- Exact solution approaches for bilevel assignment problems (Q276866) (← links)
- A simple greedy heuristic for linear assignment interdiction (Q513608) (← links)
- On the complexity of robust bilevel optimization with uncertain follower's objective (Q2060358) (← links)
- A note on the complexity of the bilevel bottleneck assignment problem (Q2095526) (← links)
- Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography (Q5014642) (← links)
- On the complexity of the bilevel minimum spanning tree problem (Q6064168) (← links)
