Extended ant colony optimization for non-convex mixed integer nonlinear programming

Similar items

• Extended ant colony optimization for non-convex mixed integer nonlinear programming

  Scholarly record2009Computers & ORMartin Schlüter, Jose A. Egea, Julio R. Banga

  Two novel extensions for the well known Ant Colony Optimization (ACO) framework are introduced here, which allow the solution of Mixed Integer Nonlinear Programs (MINLP). Furthermore, a hybrid implementation (ACOmi) based on this extended ACO framework, specially developed for co

• Non-convex mixed-integer nonlinear programming: A survey

  Scholarly record2012Samuel Burer, Adam N. Letchford

  A wide range of problems arising in practical applications can be formulated as Mixed-Integer Nonlinear Programs (MINLPs). For the case in which the objective and constraint functions are convex, some quite effective exact and heuristic algorithms are available. When nonconvexiti

• An algorithmic framework for convex mixed integer nonlinear programs

  Scholarly record2008Discrete OptimizationPierre Bonami, Lorenz T. Biegler, Andrew R. Conn, Gérard Cornuéjols

  This paper is motivated by the fact that mixed integer nonlinear programming is an important and difficult area for which there is a need for developing new methods and software for solving large-scale problems. Moreover, both fundamental building blocks, namely mixed integer lin

• Algorithms and Software for Convex Mixed Integer Nonlinear Programs

  Scholarly record2009PIERRE BONAMI, MUSTAFA KILINÇ, JEFF LINDEROTH

  This paper provides a survey of recent progress and software for solving convex mixed integer nonlinear programs (MINLP)s, where the objective and constraints are defined by convex functions and integrality restrictions are imposed on a subset of the decision variables. Convex MI

• Improved quadratic cuts for convex mixed-integer nonlinear programs

  Scholarly record2018Computers & Chemical EngineeringLijie Su, Lixin Tang, David E. Bernal, Ignacio E. Grossmann

  This paper presents scaled quadratic cuts based on scaling the second-order Taylor expansion terms for the decomposition methods Outer Approximation (OA) and Partial Surrogate Cuts (PSC) used for solving convex Mixed Integer Nonlinear Programing (MINLP). The scaled quadratic cut

• Unbounded convex sets for non-convex mixed-integer quadratic programming

  Scholarly record2014Math. Program.Samuel Burer, Adam N. Letchford

  This paper introduces a fundamental family of unbounded convex sets that arises in the context of non-convex mixed-integer quadratic programming. It is shown that any mixed-integer quadratic program with linear constraints can be reduced to the minimisation of a linear function o