Pages that link to "Item:Q4012412"
From MaRDI portal
The following pages link to The Homotopy Principle and Algorithms for Linear Programming (Q4012412):
Displaying 9 items.
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations (Q652290) (← links)
- Parametric mixed-integer 0-1 linear programming: The general case for a single parameter (Q958548) (← links)
- Deriving potential functions via a symmetry principle for nonlinear equations (Q1375121) (← links)
- A primal-dual homotopy algorithm for \(\ell _{1}\)-minimization with \(\ell _{\infty }\)-constraints (Q1639715) (← links)
- The implementation of linear programming algorithms based on homotopies (Q1911465) (← links)
- MIPping closures: An instant survey (Q2373443) (← links)
- Optimizing over the split closure (Q2476990) (← links)
- A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems (Q4639134) (← links)
- Using Two-Dimensional Projections for Stronger Separation and Propagation of Bilinear Terms (Q5110560) (← links)