Mixed integer nonlinear programming. Selected papers based on the presentations at the IMA workshop mixed-integer nonlinear optimization: Algorithmic advances and applications, Minneapolis, MN, USA, November 17--21, 2008
From MaRDI portal
Publication:649984
Cited in
(16)- Norm bounds and underestimators for unconstrained polynomial integer minimization
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
- Mixed-integer nonlinear optimization: a hatchery for modern mathematics. Abstracts from the workshop held October 18--24, 2015
- Semidefinite relaxations for partitioning, assignment and ordering problems
- A fast exact method for the capacitated facility location problem with differentiable convex production costs
- On topology optimization and canonical duality method
- Volume computation for sparse Boolean quadric relaxations
- Global optimization of mixed-integer ODE constrained network problems using the example of stationary gas transport
- Discrete midpoint convexity
- Improving the performance of DICOPT in convex MINLP problems using a feasibility pump
- scientific article; zbMATH DE number 7415078 (Why is no real title available?)
- Quadratization of symmetric pseudo-Boolean functions
- A note on solving MINLP's using formulation space search
- On solving generalized convex MINLP problems using supporting hyperplane techniques
- A numerical method for solving quadratic integer programming problem
- Optimal rank-sparsity decomposition
This page was built for publication: Mixed integer nonlinear programming. Selected papers based on the presentations at the IMA workshop mixed-integer nonlinear optimization: Algorithmic advances and applications, Minneapolis, MN, USA, November 17--21, 2008
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q649984)