Exact and fast algorithms for mixed-integer nonlinear programming
From MaRDI portal
Publication:2802655
Recommendations
- Relaxation and decomposition methods for mixed integer nonlinear programming.
- scientific article; zbMATH DE number 1857671
- Mixed integer nonlinear programming using interior-point methods
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Algorithms, softwares and recent developments of mixed integer nonlinear programming
Cited in
(11)- Exact solution of sparse linear systems via left-looking roundoff-error-free Lu factorization in time proportional to arithmetic work
- Algorithm 1021: SPEX Left LU, Exactly Solving Sparse Linear Systems via a Sparse Left-looking Integer-preserving LU Factorization
- A solution algorithm for non-convex mixed integer optimization problems with only few continuous variables
- Solving mixed-integer nonlinear programmes using adaptively refined mixed-integer linear programmes
- An efficient linearization approach for mixed-integer problems
- A computational status update for exact rational mixed integer programming
- Active-constraint variable ordering for faster feasibility of mixed integer linear programs
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- Solving quadratic programs to high precision using scaled iterative refinement
- scientific article; zbMATH DE number 1857671 (Why is no real title available?)
- Exact Sparse Approximation Problems via Mixed-Integer Programming: Formulations and Computational Performance
Describes a project that uses
Uses Software
This page was built for publication: Exact and fast algorithms for mixed-integer nonlinear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2802655)
