Jacques Desrosiers

Back

Cahiers du GERAD

112 results — page 1 of 6

, , , and

Integer (linear) programs are a standard way of formalizing a vast array of optimization problems in industry, services, management, science, and technology....

BibTeX reference
and

This paper presents the properties of the minimum mean cycle-canceling algorithm for solving linear programming models. Originally designed by Goldberg ...

BibTeX reference
, , and

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

BibTeX reference
, , and

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

BibTeX reference
, , and

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

BibTeX reference
, , and

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

BibTeX reference
, , and

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

BibTeX reference
, , and

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

BibTeX reference
, , and

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

BibTeX reference
, , and

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

BibTeX reference
, , , , and

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

BibTeX reference
, , and

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

BibTeX reference
, , and

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

BibTeX reference
, , and

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

BibTeX reference
, , and

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

BibTeX reference
and

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

BibTeX reference
, , and

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

BibTeX reference
, , , and

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

BibTeX reference
and

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

BibTeX reference
, , and

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

BibTeX reference