The integral column generation algorithm (ICG) was recently introduced to solve set partitioning problems involving a very large number of variables. This pr...

In derivative-free and blackbox optimization, the objective function is often evaluated through the execution of a computer program seen as a blackbox. It ...

Production planners in the non-ferrous metal industry face an inherent combinatorial complexity of the metal production process within a fast changing market...

This work proposes strategies to handle three types of constraints in the context of blackbox optimization: binary constraints that simply indicate if they a...

This paper studies the team orienteering problem, where the arrival time and service time affect the collection of profits. Such interactions result in a non...

We propose a generalized decomposition approach for production planning problems with process configuration decisions. These problems appear in contexts wher...

Nanoparticle-mediated drug delivery may be a promising alternative to traditional chemo-therapy of high systemic toxicity. Tumor tissue architecture poses a ...

This work introduces StoMADS, a stochastic variant of the mesh adaptive direct-search (MADS) algorithm originally developed for deterministic blackbox optim...

We introduce an iterative method named BiLQ for solving general square linear systems \(Ax=b\) based on the Lanczos biorthogonalization process defined by ...

We determine optimal pricing and order quantity of two substitute products in two markets, one of them is seasonal, with a decreasing market potential over...

Cities are facing severe traffic-related problems causing emission thresholds to be exceeded. All around the world, city center access restriction policies a...

In an optimization problem, multiplying an inequality constraint by a positive scalar has no effect on the domain. However, such a transformation might have...

In this paper, we compare the BFGS and the conjugate gradient (CG) methods for solving unconstrained problems with a trust-region algorithm. The main result ...

This paper presents a linear mixed-integer formulation to solve the short-term unit commitment problem. It determines the pair of maximum efficiency points o...

In e-commerce warehouses, online retailers increase their efficiency by using a mixed-shelves (or scattered storage) concept, where unit loads are purposeful...

We introduce the conditional \(p\)-dispersion problem (c-pDP), an incremental variant of the \(p\)-dispersion problem (pDP). In the c-pDP, one is given a...

Statistical image reconstruction in X-Ray computed tomography yields large-scale regularized linear least-squares problems with nonnegativity bounds, where t...

In the present paper, we prove lower and upper bounds for each of the ratios \(GA/\delta\), as well as a lower bound on \(GA/\sqrt{\delta}\), in terms of...

A small polygon is a polygon of unit diameter. The question of finding the largest area of small \(n-\)gons has been answered for some values of \(n\)....

Mathematical models of energy-economy-environmental systems (E3) provide a rational framework for exploring the effects of energy and climate policies and su...