Pages that link to "Item:Q2176276"
From MaRDI portal
The following pages link to New bounding schemes and algorithmic options for the Branch-and-Sandwich algorithm (Q2176276):
Displaying 7 items.
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development (Q480823) (← links)
- Global solution of bilevel programs with a nonconvex inner program (Q1016068) (← links)
- A new node selection strategy in the branch-and-bound procedure (Q1342946) (← links)
- An exact projection-based algorithm for bilevel mixed-integer problems with nonlinearities (Q2089867) (← links)
- (Q4352204) (← links)
- A survey on mixed-integer programming techniques in bilevel optimization (Q6114905) (← links)
- On a computationally ill-behaved bilevel problem with a continuous and nonconvex lower level (Q6163957) (← links)