Given a graph <i>G</i>, an integer <i>k</i>, and a cost <i>c_uv</i> associated with all pairs <i>uv</i> of non-adjacent vertices in <i>G</i>, the ...

The BIRCH algorithm (Balanced Iterative Reducing and Clustering Hierarchies) handles massive dataset by reading the data file only once, clustering the data ...

This paper addresses the NP hard optimization problem of packing identical spheres of unit radii into the smallest sphere (PSS). It models PSS as a non-li...

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

In this paper, for the purpose of service differentiation in opportunistic spectrum access (OSA) enabled networks, we take different priority queueing discip...

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

The aim of this paper is to compute upper and lower bounds for convex value functions of derivative contracts. Laprise et al. (2006) compute bounds for Ame...

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

A travelling deliveryman needs to find a tour such that the total waiting time of all the customers he has to visit is minimum. The deliveryman starts his ...

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