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

In this paper, we model a two-period electricity market with interrelated demand, where oligopolistic generators make investments in peak- and base-load capa...

This paper considers large shift scheduling problems with different shift start times and lengths, fractionable breaks and work stretch duration restrictions...

We address a multi-objective version of the car sequencing problem, which consists in sequencing a given set of cars to be produced in a single day, minimizi...

We consider the problem of locating a circle with respect to existing facilities on the plane, such that the largest weighted distance between the circle and...

Consider a convex polygon <i>V_n</i> with <i>n</i> sides, perimeter <i>P_n</i>, diameter <i>D_n</i>, area <i>A_n</i>,...

Quel octogone de diamère unité (ou petit octogone) possède la plus grande surface ou le plus grand périmètre? Serait-ce l'octogone régulier? Eh! non, il n'en...

In this article we consider the problem of assigning parking slots to buses of different types so that the required buses can be dispatched easily in the mo...

The objective of the project is to provide dynamic scheduling solutions to two different services, automobile dealerships and dental clinics, in order to hel...

A conjecture of Delorme, Favaron and Rautenbach [DM 257 (2002) 29-38] about the Randic index of a graph, in relation to its order and minimum degree, is ref...

<p>Le système <i>AutoGraphiX (AGX1 et AGX2)</i> permet, parmi d’autres fonctions, la génération automatique de conjectures en théorie des graphes. Nous étud...

<p>Using the <i>AutoGraphiX 2</i> system, a systematic study is made on generation and proof of relations of the form</p> <center> $\underline{b}_n \leq ...

This paper is intended not as a survey, but as an introduction to some ideas behind the class of mesh adaptive direct search (MADS) methods. Space limitatio...

An alternative definition of the linear bilevel programming problem <i>BLP</i> has recently been proposed by Lu, Shi, and Zhang. This note shows that the pr...

We propose a unified framework for the update of the barrier parameter in interiorpoint methods for nonlinear programming. The original primal-dual system i...

We consider two (0,1)-linear programming formulations of the graph (vertex-) coloring problem, in which variables are associated to stable sets of the input...