Pages that link to "Item:Q2460141"
From MaRDI portal
The following pages link to Accelerating convergence of cutting plane algorithms for disjoint bilinear programming (Q2460141):
Displaying 6 items.
- Degeneracy removal in cutting plane methods for disjoint bilinear programming (Q519763) (← links)
- A review of recent advances in global optimization (Q842710) (← links)
- An accelerated extended cutting plane approach with piecewise linear approximations for signomial geometric programming (Q1704917) (← links)
- A reducibility method for the weak linear bilevel programming problems and a case study in principal-agent (Q2195296) (← links)
- Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties (Q4995064) (← links)
- An effective global algorithm for worst-case linear optimization under polyhedral uncertainty (Q6166102) (← links)
