Upper bounds for products of four measures of distances in graphs: diameter, radius, average eccentricity and remoteness with three measures of connectivity:...

In the set of all connected graphs with a given domination number, we characterize the graphs which achieve the maximum value of the spectral radius of the ...

We show that among connected graphs with maximum clique size <img src="/cgi-bin/mimetex.cgi?\omega">, the minimum value of the spectral radius of adjacency m...

We present and compare three new compact linearizations for the quadratic 0-1 minimization problem, two of which achieving the same lower bound than the "sta...

Data clustering methods have been developed extensively in the data mining literature for detecting useful patterns in large datasets in the form of dense...

Les contributions récentes en économie du tourisme reconnaissent que le marché du tourisme est un marché de concurrence imparfaite qui doit être abordé du po...

The <i>Capacitated Arc Routing Problem</i> (CARP) consists of determining a set of least cost capacitated vehicle routes servicing a set of arcs. In this p...

In an Advance Booking Discount Program (ABDP), a firm offers a product at a price discount prior to the selling season. In the selling season the product i...

We propose a new algorithm for general constrained derivative-free optimization. As in most methods, constraint violations are aggregated into a single con...

We consider a noncooperative differential game where a retailer sells her own private label in addition to the manufacturer’s brand. We assume that each bran...

A set of vertices <i>S</i> in a graph <i>G</i> is a clique if any two of its vertices are adjacent. The clique number <img src="/cgi-bin/mimetex.cgi?\omega"...

The main purpose of this paper is to study the impact of traditional and emergent environmental regulations on firms’ strategies and outcomes. The former co...

This paper proposes a way to combine the Mesh Adaptive Direct Search (MADS) algorithm, which extends the Generalized Pattern Search (GPS) algorithm, with th...

In this survey, we examine an important class of facility location problems known as the multisource Weber problem (also referred to as the continuous locat...

A recent comparison of evolutionary, neural network, and scatter search heuristics for solving the p-median problem is completed by (i) gathering or obtaini...

We study in this paper the impact of a Public Disclosure Program(PDP) as well as traditional environmental regulation (tax/subsidy) on optimal policies of t...

The probabilistic satisfiability problem is to verify the consistency of a set of probability values or intervals for logical propositions. The (tight) prob...

Optimization problems modeled in the AMPL modeling language [Fourer, Gay and Kernighan (2002)] may be examined by a set of tools found in the AMPL Library [...

We consider the problem of separating two sets of points in an n-dimensional real space with a (hyper)plane that minimizes the sum of <i>L</i>₂-n...

This work deals with bound constrained multiobjective optimization (<i>MOP</i>) of nonsmooth functions for problems in which the structure of the objective ...