Pages that link to "Item:Q652290"
From MaRDI portal
The following pages link to Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations (Q652290):
Displaying 4 items.
- An effective global algorithm for worst-case linear optimization under polyhedral uncertainty (Q6166102) (← links)
- Effective algorithms for optimal portfolio deleveraging problem with cross impact (Q6178391) (← links)
- On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs (Q6589745) (← links)
- A disjunctive cutting plane algorithm for bilinear programming (Q6622752) (← links)