A review and comparison of solvers for convex MINLP
In this paper, we present a review of deterministic software for solving convex MINLP
problems as well as a comprehensive comparison of a large selection of commonly …
problems as well as a comprehensive comparison of a large selection of commonly …
Mathematical optimization approaches for facility layout problems: The state-of-the-art and future research directions
Facility layout problems are an important class of operations research problems that has
been studied for several decades. Most variants of facility layout are NP-hard, therefore …
been studied for several decades. Most variants of facility layout are NP-hard, therefore …
Mixed-integer nonlinear optimization
Many optimal decision problems in scientific, engineering, and public sector applications
involve both discrete decisions and nonlinear system dynamics that affect the quality of the …
involve both discrete decisions and nonlinear system dynamics that affect the quality of the …
[HTML][HTML] An algorithmic framework for convex mixed integer nonlinear programs
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 develo** new methods and software for …
and difficult area for which there is a need for develo** new methods and software for …
Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
This manuscript reviews recent advances in deterministic global optimization for Mixed-
Integer Nonlinear Programming (MINLP), as well as Constrained Derivative-Free …
Integer Nonlinear Programming (MINLP), as well as Constrained Derivative-Free …
Algorithms and software for convex mixed integer nonlinear programs
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 …
Integer Nonlinear Programs (MINLP) s, where the objective and constraints are defined by …
A biased random-key genetic algorithm for the unequal area facility layout problem
This paper presents a biased random-key genetic algorithm (BRKGA) for the unequal area
facility layout problem (UA-FLP) where a set of rectangular facilities with given area …
facility layout problem (UA-FLP) where a set of rectangular facilities with given area …
QPLIB: a library of quadratic programming instances
This paper describes a new instance library for quadratic programming (QP), ie, the family of
continuous and (mixed)-integer optimization problems where the objective function and/or …
continuous and (mixed)-integer optimization problems where the objective function and/or …
FilMINT: An outer approximation-based solver for convex mixed-integer nonlinear programs
K Abhishek, S Leyffer… - INFORMS Journal on …, 2010 - pubsonline.informs.org
We describe a new solver for convex mixed-integer nonlinear programs (MINLPs) that
implements a linearization-based algorithm. The solver is based on an algorithm of …
implements a linearization-based algorithm. The solver is based on an algorithm of …
Applying ant system for solving unequal area facility layout problems
KY Wong - European Journal of Operational Research, 2010 - Elsevier
Ant Colony Optimization (ACO) is a young metaheuristic algorithm which has shown
promising results in solving many optimization problems. To date, a formal ACO-based …
promising results in solving many optimization problems. To date, a formal ACO-based …