We consider a marketing channel where a retailer sells, along the manufacturer’s brand, her own private label. We assume that each player invests in adverti...

A set of vertices <i>S</i> in a graph <i>G</i> is independent if no neighbor of a vertex of <i>S</i> belongs to <i>S</i>. The independence number &alpha is ...

Given a set of timetabled tasks, the multi-depot vehicle scheduling problem is a wellknown problem that consists of determining least-cost schedules for veh...

From the pentagon onwards, the area of the regular convex polygon with <i>n</i> sides and unit diameter is greater for each odd number <i>n</i> than for the...

We consider four conjectures related to the largest eigenvalue of (the adjacency matrix of) a graph (i.e., to the index of the graph). Three of them have be...

Let &nbsp;<img src="/cgi-bin/mimetex.cgi?G=(V,E)">&nbsp; be a simple graph with vertex degrees &nbsp;<img src="/cgi-bin/mimetex.cgi?d1, d2, \ldots, d_n...

This paper argues that the literature applying differential games in economics and management science has aimed to a large extent for analytical results. On...

In this survey, a classification of twenty-seven Asymmetric Traveling Salesman Problem (ATSP) formulations is presented. The strength of their LP relaxation...

In [<i>SIAM J. Optim.</i>, 17 (2006), pp. 188–217] Audet and Dennis proposed the class of <i>mesh adaptive direct search algorithms</i> (MADS) for minimizat...

The vehicle routing problem with time windows consists of delivering goods at minimum cost to a set of customers using an unlimited number of capacitated ve...

Let &nbsp;<img src="/cgi-bin/mimetex.cgi?G=(V,E)"> be a simple graph with &nbsp;<img src="/cgi-bin/mimetex.cgi?n=|V|"> vertices and &nbsp;<img src="/cgi-bin/...

Given a simple connected graph <i>G = (V,E)</i> the geodetic closure <i>I&nbsp;[S]</i> <img src="/cgi-bin/mimetex.cgi?\subset"> <i>V</i> of a subset <i>S</i...

This paper considers the swapping problem on a tree. In this problem at most one object of some type is available at each vertex, and each vertex also reque...

We discuss feature selection approaches within the context of linear programming models for discrimination, with special emphasis on a new interpretation an...

We propose a game-theoretic model involving the manufacturer of a national brand and a retailer selling her private label along with the national brand. The...

<p>The paper considers a problem of how to minimize advertising costs to sell seats for a particular event, for instance, a sports game, a rock concert or a...

The AutoGraphiX research program led to a new type of application of metaheuristics in graph theory, <i>i.e.</i>, finding conjectures on graph invariants by...

Using the AutoGraphiX 2 system (AGX2), we study relations between graph invariants of the form <img src="/cgi-bin/mimetex.cgi?lbn \leq R \oplus i \leq ub...

Colour image quantization is a data compression technique that reduces the total set of colours in an image to a representative subset. This problem is expr...

In the integrated aircraft routing, crew scheduling and flight retiming problem, a minimum-cost set of aircraft routes and crew pairings must be constructed...