The quadratic assignment problem (QAP), one of the most difficult problems in the NP-hard
class, models many real-life problems in several areas such as facilities location, parallel …

Many optimization problems involve integer or discrete variables and can be modelled as
Mixed Integer Nonlinear Programming problems (MINLPs). These variables can variously …

Let (QP) be a 0-1 quadratic program which consists in minimizing a quadratic function
subject to linear equality constraints. In this paper, we present QCR, a general method to …

A new class of Intelligent and Autonomous Vehicles (IAVs) has been designed in the
framework of Intelligent Transportation for Dynamic Environment (InTraDE) project funded …

We consider in this paper quadratic programming problems with cardinality and minimum
threshold constraints that arise naturally in various real-world applications such as portfolio …

An algorithm for optimal arrival flight sequencing and spacing in a near-terminal area is
proposed. The optimization problem and algorithm proposed in this paper are developed for …

All ship** liner companies divide their service regions into several rotations (strings) in
order to operate their container vessels. A string is the ordered set of ports at which a …

This paper proposes a novel method to solve signomial discrete programming (SDP)
problems frequently occurring in engineering design. Various signomial terms are first …

A portfolio problem with integer variables can facilitate the use of complex models, including
models containing discrete asset values, transaction costs, and logical constraints. This …

A decomposition technique is applied to address the simultaneous scheduling and optimal
control problem of multigrade polymerization reactors. The simultaneous scheduling and …