Cited in
(55)- SUSPECT: MINLP special structure detector for Pyomo
- Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT
- A mixed-integer nonlinear program for the optimal design and dispatch of distributed generation systems
- Conflict Analysis for MINLP
- A mixed-integer PDE-constrained optimization formulation for electromagnetic cloaking
- Strong formulations for conic quadratic optimization with indicator variables
- Inversion of convection-diffusion equation with discrete sources
- The supporting hyperplane optimization toolkit for convex MINLP
- A disjunctive cut strengthening technique for convex MINLP
- A primal heuristic for optimizing the topology of gas networks based on dual information
- scientific article; zbMATH DE number 7370569 (Why is no real title available?)
- Couenne
- filterSQP
- Bonmin
- MINLP
- QP
- DICOPT
- DrAmpl
- FilMINT
- MINLPLib
- minlpBB
- GloMIQO
- SBB
- ANTIGONE
- SCIP-SDP
- SHOT
- A Mixed-Integer Fractional Optimization Approach to Best Subset Selection
- A Bayesian framework for molecular strain identification from mixed diagnostic samples
- MAIC
- HASP
- Juniper
- extended-MIQCP
- QPsimplex
- Decogo
- Muriqui
- SUSPECT
- An exact multi-objective mixed integer nonlinear optimization approach for aircraft conflict resolution
- L0Learn
- FrankWolfe.jl
- pycombina
- Juniper: an open-source nonlinear branch-and-bound solver in Julia
- An optimisation approach to constructing an exchange-traded fund
- Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation
- Strong formulations for quadratic optimization with M-matrices and indicator variables
- Linearization and parallelization schemes for convex mixed-integer nonlinear optimization
- Multiobjective optimization for aircraft conflict resolution. A metaheuristic approach
- L0BnB
- PaPILO
- A VNS metaheuristic for solving the aircraft conflict detection and resolution problem by performing turn changes
- Polyhedral approximation in mixed-integer convex optimization
- A note on solving MINLP's using formulation space search
- Strengthening the sequential convex MINLP technique by perspective reformulations
- Undercover: a primal MINLP heuristic exploring a largest sub-MIP
- Market neutral portfolios
- Exact and fast algorithms for mixed-integer nonlinear programming
This page was built for software: MINOTAUR
