Raf Jans

Back

Cahiers du GERAD

27 results — page 2 of 2

G-2013-26
Improved Column Generation Algorithms for the Job Grouping Problem
, , 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
G-2012-57
Benders Decomposition for Production Routing under Demand Uncertainty
, , and

The production routing problem (PRP) concerns the production and distribution of a single product from a production plant to multiple customers using capacit...

BibTeX reference
G-2012-14
Formulations and Branch-and-Cut Algorithms for Multi-Vehicle Production and Inventory Routing Problems
, , and

The inventory routing problem (IRP) and the production routing problem (PRP) are two difficult problems arising in the planning of integrated supply chains...

BibTeX reference
G-2011-67
Efficient Symmetry-Breaking Formulations for the Job Grouping Problem
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
G-2011-52
Optimization-Based Adaptive Large Neighborhood Search for the Production Routing Problem
, , and

Operational problems arising in the planning of integrated supply chains have been increasingly studied in the past decade. Among these, the production rout...

BibTeX reference
G-2010-66
Efficient Formulations and a Branch-and-Cut Algorithm for a Production-Routing Problem
, , , , and

The production-routing problem can be seen as a combination of two well known combinatorial optimization problems: the lotsizing and the vehicle routing prob...

BibTeX reference
G-2010-44
Binary Clustering Problems: Symmetric, Asymmetric and Decomposition Formulations
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