swMATH31776MaRDI QIDQ43487FDOQ43487
Author name not available (Why is that?)
Official website: http://mpc.zib.de/archive/2017/3/Vielma2017_Article_ExtendedFormulationsInMixedInt.pdf
Source code repository: https://github.com/juan-pablo-vielma/extended-MIQCP
Cited In (26)
- Polyhedral approximation in mixed-integer convex optimization
- Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra
- Lift-and-project cuts for convex mixed integer nonlinear programs
- Fractional 0-1 programs: links between mixed-integer linear and conic quadratic formulations
- Outer approximation and submodular cuts for maximum capture facility location problems with random utilities
- Reformulations for utilizing separability when solving convex MINLP problems
- Title not available (Why is that?)
- Rational polyhedral outer-approximations of the second-order cone
- Extended formulations in mixed-integer convex programming
- GUSS
- Partially distributed outer approximation
- MAIC
- Complementarity
- Gadfly
- Interact.jl
- MultiJuMP
- SolverStudio
- VariationalInequality
- CPLEX.jl
- Convex.jl
- QPsimplex
- Exact approaches for competitive facility location with discrete attractiveness
- L0BnB
- Outer approximation with conic certificates for mixed-integer convex problems
- A Scalable Algorithm for Sparse Portfolio Selection
- JuMP: a modeling language for mathematical optimization
This page was built for software: extended-MIQCP
