Pages that link to "Item:Q2250087"
From MaRDI portal
The following pages link to Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation (Q2250087):
Displaying 17 items.
- Lago: a (heuristic) branch and cut algorithm for nonconvex minlps (Q940828) (← links)
- Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs (Q1110459) (← links)
- An efficient linearization approach for mixed-integer problems (Q1572989) (← links)
- A solution framework for linear PDE-constrained mixed-integer problems (Q2044978) (← links)
- Outer approximation for mixed-integer nonlinear robust optimization (Q2095574) (← links)
- Linearization and parallelization schemes for convex mixed-integer nonlinear optimization (Q2114818) (← links)
- On refinement strategies for solving \(\textsc{MINLP}\)s by piecewise linear relaxations: a generalized red refinement (Q2115319) (← links)
- On generalized surrogate duality in mixed-integer nonlinear programming (Q2118119) (← links)
- A solution algorithm for non-convex mixed integer optimization problems with only few continuous variables (Q2255939) (← links)
- Two linear approximation algorithms for convex mixed integer nonlinear programming (Q2675735) (← links)
- FilMINT: an outer approximation-based solver for convex mixed-integer nonlinear programs (Q2899087) (← links)
- (Q3220358) (← links)
- Convex relaxations for mixed-integer nonlinear programs (Q4605948) (← links)
- Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems (Q5202509) (← links)
- On Proximity for k-Regular Mixed-Integer Linear Optimization (Q5214422) (← links)
- Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs (Q6166099) (← links)
- Fully automated verification of linear time-invariant systems against signal temporal logic specifications via reachability analysis (Q6581256) (← links)
