Pages that link to "Item:Q2494301"
From MaRDI portal
The following pages link to Improve-and-branch algorithm for the global optimization of nonconvex NLP problems (Q2494301):
Displaying 6 items.
- A review of recent advances in global optimization (Q842710) (← links)
- An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms (Q857806) (← links)
- Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← links)
- (Q4360542) (← links)
- On the Performance of NLP Solvers Within Global MINLP Solvers (Q4685828) (← links)
- Algorithm for solving NLP problems with the use of a modified Lagrange function (Q5903436) (← links)