A probing algorithm for MINLP with failure prediction by SVM
From MaRDI portal
Publication:3003284
Recommendations
- Three enhancements for optimization-based bound tightening
- Branching and bounds tighteningtechniques for non-convex MINLP
- Learning and propagating Lagrangian variable bounds for mixed-integer nonlinear programming
- On branching rules for convex mixed-integer nonlinear optimization
- Feasibility-based bounds tightening via fixed points
Cited in
(5)- Inexact solution of NLP subproblems in MINLP
- Theoretical challenges towards cutting-plane selection
- Artificial intelligence for optimization: unleashing the potential of parameter generation, model formulation, and solution methods
- Domain reduction techniques for global NLP and MINLP optimization
- Three enhancements for optimization-based bound tightening
This page was built for publication: A probing algorithm for MINLP with failure prediction by SVM
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3003284)