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

This paper shows that the important result obtained in a static marketing channel, namely, that the manufacturer can coordinate the channel through a two-pa...

<p> We consider an infinite-horizon differential game played by two direct marketers. Each player controls the number of emails sent to potential customers...

In this paper, we consider scheduling problems on a single machine in a sequence dependent setup environment. We introduce for these problems several integer...

In this paper, we study the problem of determining the capacity requirements for applications that require QoS guarantees. We consider three kinds of source ...

This work shows how disjunctive cuts can be generated for a bilevel linear programming problem (<i>BLP</i>) with continuous variables. First, a brief summar...

Given buses of different types arriving at a depot during the evening, the bus parking problem consists of assigning these buses to parking slots in such a w...

We consider two overlapping generations that want to coordinate their strategies of working, consuming and controlling pollution. As the cooperative solution...