extended-MIQCP
From MaRDI portal
Extended-MIQCP
Cited in
(26)- Extended formulations in mixed-integer convex programming
- Outer approximation and submodular cuts for maximum capture facility location problems with random utilities
- Rational polyhedral outer-approximations of the second-order cone
- 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 with conic certificates for mixed-integer convex problems
- Exact approaches for competitive facility location with discrete attractiveness
- scientific article; zbMATH DE number 7370569 (Why is no real title available?)
- GUSS
- JuMP: a modeling language for mathematical optimization
- MAIC
- Complementarity
- Gadfly
- Interact.jl
- MultiJuMP
- SolverStudio
- VariationalInequality
- CPLEX.jl
- Convex.jl
- QPsimplex
- A Scalable Algorithm for Sparse Portfolio Selection
- Reformulations for utilizing separability when solving convex MINLP problems
- L0BnB
- Polyhedral approximation in mixed-integer convex optimization
- Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra
- Partially distributed outer approximation
This page was built for software: extended-MIQCP