extended-MIQCP

MaRDI QIDQ43487swMATHFDO

Official website http://mpc.zib.de/archive/2017/3/Vielma2017_Article_ExtendedFormulationsInMixedInt.pdf

Source code repository https://github.com/juan-pablo-vielma/extended-MIQCP

Described by source

• Extended formulations in mixed integer conic quadratic programming

Cited in

(26)

• L0BnB
• Lift-and-project cuts for convex mixed integer nonlinear programs
• Outer approximation and submodular cuts for maximum capture facility location problems with random utilities
• Polyhedral approximation in mixed-integer convex optimization
• Rational polyhedral outer-approximations of the second-order cone
• Partially distributed outer approximation
• Outer approximation with conic certificates for mixed-integer convex problems
• Fractional 0-1 programs: links between mixed-integer linear and conic quadratic formulations
• Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra
• GUSS
• MAIC
• Extended formulations in mixed-integer convex programming
• SolverStudio
• Interact.jl
• Gadfly
• Complementarity
• VariationalInequality
• MultiJuMP
• CPLEX.jl
• Convex.jl
• QPsimplex
• Sparse and smooth signal estimation: convexification of \(\ell_0\)-formulations
• A Scalable Algorithm for Sparse Portfolio Selection
• JuMP: a modeling language for mathematical optimization
• Reformulations for utilizing separability when solving convex MINLP problems
• Exact approaches for competitive facility location with discrete attractiveness

This page was built for software: extended-MIQCP