Pages that link to "Item:Q2774597"
From MaRDI portal
The following pages link to An outer approximation based branch and cut algorithm for convex 0-1 MINLP problems (Q2774597):
Displaying 8 items.
- Lago: a (heuristic) branch and cut algorithm for nonconvex minlps (Q940828) (← links)
- A branch-and-cut method for 0-1 mixed convex programming (Q1968795) (← links)
- A disjunctive cut strengthening technique for convex MINLP (Q2129197) (← links)
- Inversion of convection-diffusion equation with discrete sources (Q2129202) (← links)
- Two linear approximation algorithms for convex mixed integer nonlinear programming (Q2675735) (← links)
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs (Q2897292) (← links)
- Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut (Q4025902) (← links)
- Polynomial Interior Point Cutting Plane Methods (Q4653547) (← links)