Pages that link to "Item:Q686998"
From MaRDI portal
The following pages link to Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems (Q686998):
Displaying 4 items.
- A new reformulation-linearization technique for bilinear programming problems (Q1201905) (← links)
- Decomposition methods for solving a class of nonconvex programming problems dealing with bilinear and quadratic functions (Q1892595) (← links)
- Convex and concave relaxations of implicit functions (Q2943829) (← links)
- ON THE PROJECTION OF THE EFFICIENT SET AND POTENTIAL APPLICATIONS (Q4548050) (← links)
