# Jacques Desrosiers

Retour

### 111 résultats — page 1 de 6

et

Cet article présente les propriétés de l'algorithme MMCC (minimum mean cycle-canceling) pour la résolution de programmes linéaires. Initialement conçu ...

référence BibTeX
, et

In this paper, we propose an integer programming model for obtaining lower bounds for the curriculum-based course timetabling problem, in which weekly assign...

référence BibTeX
, et

This paper addresses the solution of the capacitated minimum cost flow problem on a network containing $$n$$ nodes and $$m$$ arcs. Satisfying necessary ...

référence BibTeX
, et

This paper introduces a new primal algorithm for solving a linear program LP. In this algorithm, a pricing problem, namely a linear fractional program, is ...

référence BibTeX
, et

This paper describes a vector space decomposition algorithmic framework for linear programming guided by dual feasibility considerations. The resolution pro...

référence BibTeX
, et

Given a linear program (LP ) with m constraints and n lower and upper bounded variables, any solution $$x^0$$ to LP can be represented as a nonne...

référence BibTeX
, et

This paper focuses on the resolution of the capacitated minimum cost flow problem on a network comprising <i>n</i> nodes and <i>m</i> arcs. We present a met...

référence BibTeX
, et

This paper describes three recent tools for dealing with primal degeneracy in linear programming. The first one is the Improved Primal Simplex (IPS) algor...

référence BibTeX
, , , et

Onshore oil fields may contain hundreds of wells that use sophisticated and complex equipments. These equipments need maintenance regularly to keep the...

référence BibTeX
, et

Dantzig-Wolfe reformulation solved by Column Generation is an approach to obtain improved bounds for Mixed Integer Programs. A downside of this approach is t...

référence BibTeX
, et

Column generation for solving linear programs with a huge number of variables alternates between solving a master problem and a pricing subproblem to add var...

référence BibTeX
, et

This paper presents the first direct implementation of the positive edge criterion using COIN-OR's CLP, where it has been combined with the Devex pivot rule....

référence BibTeX
, et

In an onshore oil field, the productivity of oil wells decreases when they require maintenance. To restore full productivity at a well, it must be visi...

référence BibTeX
et

The Job Grouping Problem consists of assigning a set of jobs, each with a specific set of tool requirements, to machines with a limited tool capacity in orde...

référence BibTeX
, et

Column generation for solving linear programs with a huge number of variables alternately solves a (restricted) master problem and a pricing subproblem to ad...

référence BibTeX
, et

Dynamic constraint aggregation (DCA) and dual variable stabilization (DVS) are two methods that can reduce the negative impact of degeneracy when solvi...

référence BibTeX
, , et

The <i>positive edge</i> is a new pricing rule for the primal simplex: it identifies, with a probability error less than or equal to 2<sup>-30</sup> in sing...

référence BibTeX
et

In this paper, we generalize the Asymmetric Representatives Formulation, which was first introduced by Campêlo et al. (2008) for the Node Coloring Problem. ...

référence BibTeX
, et

The vehicle routing problem with time windows VRPTW consists of finding least-cost vehicle routes to service given customers exactly once each while satisfyi...

référence BibTeX

Dans cet article, on raconte l'histoire de l'équipe GENCOL et du logiciel d'optimisation du même nom. C'est avant tout le récit d'une collaboration qui se po...

référence BibTeX