The following pages link to A nonconvex max-min problem (Q4158832):
Displaying 12 items.
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development (Q480823) (← links)
- Global optimization of generalized semi-infinite programs via restriction of the right hand side (Q486720) (← links)
- A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs (Q670656) (← links)
- Towards global bilevel dynamic optimization (Q842715) (← links)
- Global solution of bilevel programs with a nonconvex inner program (Q1016068) (← links)
- Optimal deterministic algorithm generation (Q1668803) (← links)
- Global solution of nonlinear mixed-integer bilevel programs (Q1959230) (← links)
- Global solution of semi-infinite programs with existence constraints (Q2031944) (← links)
- Adaptive discretization-based algorithms for semi-infinite programs with unbounded variables (Q2168050) (← links)
- New bounding schemes and algorithmic options for the Branch-and-Sandwich algorithm (Q2176276) (← links)
- Bilevel linear programming (Q2368110) (← links)
- Recent advances in nonconvex semi-infinite programming: applications and algorithms (Q6114904) (← links)
