Euclidean Minimum Sum-of-Squares Clustering amounts to finding <i>p</i> prototypes by minimizing the sum of the squared Euclidean distances from a set of ...

Although General Variable Neighborhood Search (GVNS) is shown to be powerful and robust methodology for solving travelling salesman and vehicle routing pro...

Sequential clustering aims at determining homogeneous and/or well-separated clusters within a given set of entities, one at a time, until no more such clus...

Reduced RLT constraints are a special class of Reformulation-Linearization Technique (RLT) constraints. They apply to nonconvex (both continuous and mixed-...

Given a set of entities, cluster analysis aims at finding subsets, also called clusters or communities or modules, entities of which are homogeneous and well...

The past decade has seen advances in general methods for symmetry breaking in mixed-integer linear programming. These methods are advantageous for general ...

The production routing problem (PRP) concerns the production and distribution of a single product from a production plant to multiple customers using capacit...

We consider a two-period closed-loop supply chain (CLSC) game where a remanufacturer appropriates of the returns' residual value and decides whether to exc...

In this paper, we provide a decomposition over time of Shapley value for dynamic stochastic discrete-time games, where the uncertainty is described by an eve...

Blackbox optimization typically arises when the functions defining the objective and constraints of an optimization problem are computed through a computer...

Finding clusters, or communities, in a graph, or network is a very important problem which arises in many domains. Several models were proposed for its solu...

Convex nondifferentiable, also known as convex nonsmooth, optimization (NDO) looks at problems where the functions involved are not continuously different...

This paper is concerned with computing global optimal solutions for maximum k-cut problems. We improve on the SBC algorithm of Ghaddar, Anjos and Liers in...

Shared-segment protection offers a good compromise between shared link and path protection. In this paper, we further investigate segment protection with res...

This work introduces the use of the treed Gaussian process (TGP) as a surrogate model within the mesh adaptive direct search (MADS) framework for constrain...

The Mesh Adaptive Direct Search (MADS) class of algorithms is designed for nonsmooth optimization, where the objective function and constraints are typical...

We study the optimisation of a biomass waste to energy conversion system using an adapted Tabu Search heuristic. It corresponds to a non-linear and non-conv...

Le secteur économique du transport aérien de passagers est soumis à de fortes contraintes dues aux nouveaux acteurs dans le domaine qui tendent les prix vers...

This paper presents a framework in which many structural credit risk models can be made hybrid by randomizing the default trigger, while keeping the capita...

We develop a flexible discrete-time hedging methodology that miminizes the expected value of any desired penalty function of the hedging error within a gener...