Pages that link to "Item:Q1968795"

The following pages link to A branch-and-cut method for 0-1 mixed convex programming (Q1968795):

Displaying 50 items.

• Approximated perspective relaxations: a project and lift approach (Q263157) (← links)
• A hierarchy of relaxations for linear generalized disjunctive programming (Q421708) (← links)
• A hierarchy of relaxations for nonlinear convex generalized disjunctive programming (Q439452) (← links)
• Mixed-integer nonlinear programs featuring ``on/off'' constraints (Q453616) (← links)
• Strong-branching inequalities for convex mixed integer nonlinear programs (Q480939) (← links)
• Branch-and-cut for complementarity-constrained optimization (Q482112) (← links)
• Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming (Q486413) (← links)
• Optimization methods for mixed integer weakly concave programming problems (Q489113) (← links)
• Global optimization of non-convex generalized disjunctive programs: a review on reformulations and relaxation techniques (Q506439) (← links)
• How to convexify the intersection of a second order cone and a nonconvex quadratic (Q517311) (← links)
• Regularized optimization methods for convex MINLP problems (Q518454) (← links)
• Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices (Q537960) (← links)
• Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations (Q652290) (← links)
• Global optimization of generalized semi-infinite programs using disjunctive programming (Q670652) (← links)
• Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs (Q691415) (← links)
• Lift-and-project for mixed 0-1 programming: recent progress (Q697568) (← links)
• Minimizing Lipschitz-continuous strongly convex functions over integer points in polytopes (Q715233) (← links)
• Logic-based modeling and solution of nonlinear discrete/continuous optimization problems (Q817192) (← links)
• Projection, lifting and extended formulation integer and combinatorial optimization (Q817203) (← links)
• A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes (Q833581) (← links)
• Lifting inequalities: a framework for generating strong cuts for nonlinear programs (Q847822) (← links)
• Conic mixed-integer rounding cuts (Q847842) (← links)
• Two-term disjunctions on the second-order cone (Q896297) (← links)
• An algorithmic framework for convex mixed integer nonlinear programs (Q951092) (← links)
• Global optimization of signomial mixed-integer nonlinear programming problems with free variables (Q1024826) (← links)
• A reformulation-linearization technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions (Q1025998) (← links)
• A modified lift-and-project procedure (Q1365045) (← links)
• Strong formulations for quadratic optimization with M-matrices and indicator variables (Q1650773) (← links)
• Solving linear optimization over arithmetic constraint formula (Q1675635) (← links)
• Extended formulations in mixed integer conic quadratic programming (Q1688453) (← links)
• Lift-and-project cuts for convex mixed integer nonlinear programs (Q1697971) (← links)
• Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming (Q1742902) (← links)
• A complete characterization of disjunctive conic cuts for mixed integer second order cone optimization (Q1751214) (← links)
• Mixed integer programming with a class of nonlinear convex constraints (Q1751218) (← links)
• Intersection cuts for convex mixed integer programs from translated cones (Q1751221) (← links)
• Partial convexification cuts for 0--1 mixed-integer programs (Q1771349) (← links)
• Split cuts and extended formulations for mixed integer conic quadratic programming (Q1785310) (← links)
• Disjunctive cuts for cross-sections of the second-order cone (Q1785397) (← links)
• Log-robust portfolio management with parameter ambiguity (Q1789607) (← links)
• A recursive procedure to generate all cuts for 0-1 mixed integer programs (Q1813832) (← links)
• Convex envelopes generated from finitely many compact convex sets (Q1942266) (← links)
• Explicit convex and concave envelopes through polyhedral subdivisions (Q1949256) (← links)
• A review of deterministic optimization methods in engineering and management (Q1955154) (← links)
• Strong formulations for conic quadratic optimization with indicator variables (Q2039236) (← links)
• Branch-and-price for a class of nonconvex mixed-integer nonlinear programs (Q2052398) (← links)
• A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming (Q2097632) (← links)
• Between steps: intermediate relaxations between big-M and convex hull formulations (Q2117230) (← links)
• Ideal formulations for constrained convex optimization problems with indicator variables (Q2118117) (← links)
• A disjunctive cut strengthening technique for convex MINLP (Q2129197) (← links)
• Inversion of convection-diffusion equation with discrete sources (Q2129202) (← links)