Jean Bertrand Gauthier
RetourPublications
Cahiers du GERAD
Branch-and-Price
Integer (linear) programs are a standard way of formalizing a vast array of optimization problems in industry, services, management, science, and technology....
référence BibTeX
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
This paper addresses the solution of the capacitated minimum cost flow problem on a network containing n
nodes and m
arcs. Satisfying necessary ...
This paper describes a vector space decomposition algorithmic framework for linear programming guided by dual feasibility considerations. The resolution pro...
référence BibTeX
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
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...
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
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
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