A wide range of problems can be modeled as Mixed Integer Linear Programming (MIP)
problems using standard formulation techniques. However, in some cases the resulting MIP …

We address nonconvex bilinear problems where the main objective is the computation of a
tight lower bound for the objective function to be minimized. This can be obtained through a …

Many SMT problems of interest may require the capability of finding models that are optimal
wrt. some objective functions. These problems are grouped under the umbrella term of …

In the contexts of automated reasoning (AR) and formal verification (FV), important decision
problems are effectively encoded into Satisfiability Modulo Theories (SMT). In the last …

In this work, we present a new Big-M reformulation for Generalized Disjunctive Programs.
Unlike the traditional Big-M reformulation that uses one M-parameter for each constraint, the …

This paper addresses the short-term scheduling problem involved in the selection of a
subset of elective surgeries from a large waiting list. In order to overcome the combinatorial …

In Urselmann et al., 2011a, Urselmann et al., 2011b we presented a memetic algorithm (MA)
for the design optimization of reactive distillation columns. The MA is a combination of a …

An integrated chemical site involves a complex network of chemical plants. Typically, these
plants interact closely, are dependent on each other for raw materials and demand for their …

This paper addresses the multi-objective optimization problem arising in the operation of
heat integrated batch plants, where makespan and utility consumption are the two conflicting …

The industrial layout traditionally has been addressed accounting for the facilities
distribution and installation since the first day of operation of the plant; this is, without …