MINOTAUR
From MaRDI portal
Software:18400
swMATH6268MaRDI QIDQ18400FDOQ18400
Author name not available (Why is that?)
Cited In (27)
- A Mixed-Integer Fractional Optimization Approach to Best Subset Selection
- SUSPECT: MINLP special structure detector for Pyomo
- A mixed-integer PDE-constrained optimization formulation for electromagnetic cloaking
- Polyhedral approximation in mixed-integer convex optimization
- A primal heuristic for optimizing the topology of gas networks based on dual information
- An optimisation approach to constructing an exchange-traded fund
- Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT
- Conflict Analysis for MINLP
- Inversion of convection-diffusion equation with discrete sources
- Title not available (Why is that?)
- An exact multi-objective mixed integer nonlinear optimization approach for aircraft conflict resolution
- Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation
- The supporting hyperplane optimization toolkit for convex MINLP
- Strong formulations for conic quadratic optimization with indicator variables
- A disjunctive cut strengthening technique for convex MINLP
- Multiobjective optimization for aircraft conflict resolution. A metaheuristic approach
- A VNS metaheuristic for solving the aircraft conflict detection and resolution problem by performing turn changes
- Market neutral portfolios
- Exact and fast algorithms for mixed-integer nonlinear programming
- A Bayesian framework for molecular strain identification from mixed diagnostic samples
- Strong formulations for quadratic optimization with M-matrices and indicator variables
- A mixed-integer nonlinear program for the optimal design and dispatch of distributed generation systems
- Juniper: an open-source nonlinear branch-and-bound solver in Julia
- Strengthening the sequential convex MINLP technique by perspective reformulations
- Linearization and parallelization schemes for convex mixed-integer nonlinear optimization
- A note on solving MINLP's using formulation space search
- Undercover: a primal MINLP heuristic exploring a largest sub-MIP
This page was built for software: MINOTAUR