Pages that link to "Item:Q3503836"

The following pages link to Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables (Q3503836):

Displaying 16 items.

• Approximated perspective relaxations: a project and lift approach (Q263157) (← links)
• Mixed-integer nonlinear programs featuring ``on/off'' constraints (Q453616) (← links)
• A critical review of discrete filled function methods in solving nonlinear discrete optimization problems (Q708127) (← links)
• Minotaur: a mixed-integer nonlinear optimization toolkit (Q823885) (← links)
• A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes (Q833581) (← links)
• Extended formulations in mixed integer conic quadratic programming (Q1688453) (← links)
• Lift-and-project cuts for convex mixed integer nonlinear programs (Q1697971) (← links)
• Improving the approximated projected perspective reformulation by dual information (Q1728322) (← links)
• Convex envelopes generated from finitely many compact convex sets (Q1942266) (← links)
• Modeling and solving the uncapacitated \(r\)-allocation \(p\)-hub median problem under congestion (Q2052283) (← links)
• Inversion of convection-diffusion equation with discrete sources (Q2129202) (← links)
• A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function (Q2181606) (← links)
• Demand allocation with latency cost functions (Q2429466) (← links)
• Perspective reformulations of mixed integer nonlinear programs with indicator variables (Q2638370) (← links)
• Perspective Reformulation and Applications (Q2897294) (← links)
• Perspective Reformulations of the CTA Problem with <i>L</i>₂ Distances (Q2931708) (← links)