The following pages link to FilMINT (Q18331):
Displaying 50 items.
- Approximated perspective relaxations: a project and lift approach (Q263157) (← links)
- Modeling without categorical variables: a mixed-integer nonlinear program for the optimization of thermal insulation systems (Q374673) (← links)
- A recipe for finding good solutions to MINLPs (Q384810) (← links)
- Heuristics for convex mixed integer nonlinear programs (Q429468) (← links)
- The integer approximation error in mixed-integer optimal control (Q431013) (← links)
- A hierarchy of relaxations for nonlinear convex generalized disjunctive programming (Q439452) (← links)
- Fitting piecewise linear continuous functions (Q439615) (← links)
- Mixed-integer nonlinear programs featuring ``on/off'' constraints (Q453616) (← links)
- Strong-branching inequalities for convex mixed integer nonlinear programs (Q480939) (← links)
- Compressor scheduling in oil fields. Piecewise-linear formulation, valid inequalities, and computational analysis (Q535673) (← links)
- Stochastic chance constrained mixed-integer nonlinear programming models and the solution approaches for refinery short-term crude oil scheduling problem (Q611563) (← links)
- Combinatorial integral approximation (Q634784) (← links)
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations (Q652290) (← links)
- TACO: a toolkit for AMPL control optimization (Q744209) (← links)
- Mixed integer nonlinear programming tools: a practical overview (Q766256) (← links)
- Minotaur: a mixed-integer nonlinear optimization toolkit (Q823885) (← links)
- Conic mixed-integer rounding cuts (Q847842) (← links)
- A mean-risk mixed integer nonlinear program for transportation network protection (Q1681354) (← links)
- Extended formulations in mixed integer conic quadratic programming (Q1688453) (← links)
- Lift-and-project cuts for convex mixed integer nonlinear programs (Q1697971) (← links)
- Mixed integer programming with a class of nonlinear convex constraints (Q1751218) (← links)
- Polyhedral approximation in mixed-integer convex optimization (Q1800994) (← links)
- Analyzing the computational impact of MIQCP solver components (Q1940956) (← links)
- Stochastic binary problems with simple penalties for capacity constraints violations (Q1949274) (← links)
- Outer approximation for global optimization of mixed-integer quadratic bilevel problems (Q2044965) (← links)
- Alternative regularizations for outer-approximation algorithms for convex MINLP (Q2089881) (← links)
- Linearization and parallelization schemes for convex mixed-integer nonlinear optimization (Q2114818) (← links)
- Nonlinear chance-constrained problems with applications to hydro scheduling (Q2118083) (← links)
- Inversion of convection-diffusion equation with discrete sources (Q2129202) (← links)
- The supporting hyperplane optimization toolkit for convex MINLP (Q2162510) (← links)
- An augmented Lagrangian filter method (Q2216190) (← links)
- Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation (Q2250087) (← links)
- Bound reduction using pairs of linear inequalities (Q2392123) (← links)
- Mixed integer nonlinear programming tools: an updated practical overview (Q2393446) (← links)
- Perspective reformulations of mixed integer nonlinear programs with indicator variables (Q2638370) (← links)
- Capacitated clustering problems applied to the layout of IT-teams in software factories (Q2675719) (← links)
- Exact and fast algorithms for mixed-integer nonlinear programming (Q2802655) (← links)
- The Chvátal-Gomory closure of a strictly convex body (Q2884272) (← links)
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs (Q2897292) (← links)
- Extending a CIP Framework to Solve MIQCPs (Q2897306) (← links)
- A lifted linear programming branch-and-bound algorithm for mixed-integer conic quadratic programs (Q2901026) (← links)
- Interactive dynamic optimization server – connecting one modelling language with many solvers (Q2926076) (← links)
- An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs (Q2967613) (← links)
- Lift-and-Project Cuts for Mixed Integer Convex Programs (Q3009750) (← links)
- Mixed integer nonlinear programming using interior-point methods (Q3096887) (← links)
- Optimization as an Analysis Tool for Human Complex Problem Solving (Q3105784) (← links)
- Extended Formulations in Mixed-Integer Convex Programming (Q3186495) (← links)
- Cutting Plane Algorithm for Convex Generalized Disjunctive Programs (Q3186647) (← links)
- The Chvátal-Gomory Closure of an Ellipsoid Is a Polyhedron (Q3569828) (← links)
- A Mixed-Integer Fractional Optimization Approach to Best Subset Selection (Q4995087) (← links)
