This paper concerns the solution of nonlinear (NLPs) and mixed-integer nonlinear programs (MINLPs) whose reformulated subproblems include bilinear ...

Oct 22, 2024 · We introduce algorithms for bilinear substructure detection, cutting plane identification, cut filtering, and cut selection and embed the ...

In this work, we propose and implement a set of relaxation tightening algorithms to simultaneously convexify nonlinear terms from multiple constraints through ...

This work considers the global optimization of general nonconvex nonlinear and mixed-integer nonlinear programming problems with underlying polynomial ...

This work considers the global optimization of general nonconvex nonlinear and mixed-integer nonlinear programming problems with underlying polynomial ...

This work considers the global optimization of general nonconvex nonlinear and mixed-integer nonlinear programming problems with underlying polynomial ...

Jul 1, 2014 · This work considers the global optimization of general nonconvex nonlinear and mixed-integer nonlinear programming problems with underlying ...

Connected Papers is a visual tool to help researchers and applied scientists find academic papers relevant to their field of work.

Zorn, K., Sahinidis, N.V.: Global optimization of general nonconvex problems with intermediate bilinear structures. Optim. Methods Softw. 29, 442–462 (2013)

Missing: general substructures.