This paper studies the pricing strategies of firms belonging to a vertical channel structure where optional contingent products are sold. Optional continge...

The purpose of this paper is to study the periodic arc routing problem when the arcs of a network behave as customers, and sufficient material is delivered s...

In many situations, such as art auctions, privatization of public assets and allocation of television airwaves to wireless carriers, the value of the objec...

We consider a two-player differential game of international emissions to represent the interactions between two groups of countries, namely, developed and ...

Interior-point methods feature prominently among numerical methods for inequality-constrained optimization problems, and involve the need to solve a sequ...

This paper presents a decomposition approach for solving a variant of the Routing and Wavelength Assignment (RWA) problem, in which all connection requests a...

We model the role of the world's forests as a major carbon sink and consider the impact that forest depletion has on the accumulation of CO₂ in ...

Application of the dispersion models in order to address the cannibalization phenomenon within franchised chains is a new approach. In this work we have deve...

Community detection in networks has been studied extensively in the last decade. Many criteria, expressing the quality of the partitions obtained, as well ...

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...

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...

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...

The MaxSumSum (maximum diversity) problem consists of the selection of <i>p</i> facilities among <i>n</i> candidate locations in a way that the total sum ...

The airline fleet assignment problem (FAP) consists of assigning an aircraft type to each flight leg of a flight schedule in order to maximize the airline ...

We consider a problem of groundwater management in which a group of farmers overexploits a groundwater stock and causes excessive pollution. A Water Agency...