A dynamic convexized method for nonconvex mixed integer nonlinear programming
From MaRDI portal
Publication:547132
DOI10.1016/j.cor.2011.02.014zbMath1215.90047OpenAlexW2055342238MaRDI QIDQ547132
Publication date: 30 June 2011
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2011.02.014
Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)
Related Items
An effective discrete dynamic convexized method for solving the winner determination problem, Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem
Uses Software
Cites Work
- Unnamed Item
- A lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures
- Simulated annealing with asymptotic convergence for nonlinear constrained optimization
- A discrete dynamic convexized method for nonlinear integer programming
- Extended ant colony optimization for non-convex mixed integer nonlinear programming
- Discrete dynamic convexized method for nonlinearly constrained nonlinear integer programming
- A real coded genetic algorithm for solving integer and mixed integer optimization problems
- Checking local optimality in constrained quadratic programming is NP- hard
- Coupling genetic algorithm with a grid search method to solve mixed integer nonlinear programming problems
- Test example for nonlinear programming codes
- Handbook of test problems in local and global optimization
- An improved branch and bound algorithm for mixed integer nonlinear programs
- Solving mixed integer nonlinear programs by outer approximation
- Nonlinear equations and optimization
- A mixed-integer optimization strategy for oil supply in distribution complexes
- Review of nonlinear mixed-integer and disjunctive programming techniques
- Solving pseudo-convex mixed integer optimization problems by cutting plane techniques
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Outer approximation algorithms for separable nonconvex mixed-integer nonlinear programs
- BARON: A general purpose global optimization software package
- Solving nonlinearly constrained global optimization problem via an auxiliary function method
- A trust region SQP algorithm for mixed-integer nonlinear programming
- An effective genetic algorithm approach to large scale mixed integer programming problems
- Generalized Benders decomposition
- MINLPLib—A Collection of Test Models for Mixed-Integer Nonlinear Programming
- Branching and bounds tighteningtechniques for non-convex MINLP
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Algorithm 778: L-BFGS-B
- An Algorithm Model for Mixed Variable Programming
- A computational comparison of some non-linear programs
- Integrating SQP and branch-and-bound for mixed integer nonlinear programming
