Odile Marcotte

Back

Cahiers du GERAD

26 results — page 1 of 2

The Tenth Montreal IPSW took place on August 13-27, 2020, and was jointly organized by the Centre de recherches mathématiques (CRM) and the Institute for Dat...

BibTeX reference

The Ninth Montreal IPSW took place on August 19-23, 2019, and was jointly organized by the CRM and IVADO (Institute for Data Valorization). The workshop welc...

BibTeX reference
, , , and

In this article we consider a difficult combinatorial optimization problem arising from the operation of a system for testing electronic circuit boards (EC...

BibTeX reference
, , , , and

In this article we consider a real-world problem submitted to us by the Hatch company. This problem consists of designing a collection network for a wind f...

BibTeX reference
, , and

In this article we investigate some strategies for solving set partitioning problems (SPP), in particular the gains in computational efficiency that can be...

BibTeX reference
, , , and

We consider the multicommodity network flow formulation of the Multiple Depot Vehicle Scheduling Problem (MDVSP) and investigate several strategies within a ...

BibTeX reference
, , , , and

In this article we study a network design problem that arises in the exploitation of wind energy. We formulate this problem as a mixed integer programming ...

BibTeX reference
, , , and

In this article we address the model order reduction problem for resistor networks by using methods from graph theory. We formulate this problem through gr...

BibTeX reference
, , and

Let \(G\) be a connected graph, \(n\) the order of \(G\), and \(f\) (resp. \(t\)) the maximum order of an induced forest (resp. tree) in \(G\). ...

BibTeX reference
, , , , and

We present a procedure for self calibration of a pinhole camera subject to radial distortion. Radial distortion parameters are estimated using a nonlinear le...

BibTeX reference
and

The minimum weight feedback vertex set problem (FVS) on series-parallel graphs can be solved in <i>O(n)</i> time by dynamic programming. This solution, howev...

BibTeX reference
, , , , , and

Meaning cannot be based on dictionary definitions all the way down: at some point the circularity of definitions must be broken in some way, by grounding the...

BibTeX reference
, , , , and

With the help of the Graffiti system, Fajtlowicz conjectured around 1992 that the average distance between two vertices of a connected graph <i>G</i> is at ...

BibTeX reference
, , and

We present an exact algorithm for solving the channel assignment problem in cellular telephony networks. This problem consists of assigning sets of channels...

BibTeX reference
, , , , and

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

BibTeX reference
, , and

We consider the multiple depot vehicle scheduling problem (MDVSP) and propose a branch-and-bound algorithm for solving it that combines column generation, va...

BibTeX reference

Let <i>G</i> be a multigraph containing no minor isomorphic to <i>K</i><sub>3,3</sub> or <i>K</i><sub>5</sub><i>e</i> (where <i>K</i><sub>5</sub><i>e</i> de...

BibTeX reference
, , , and

We study several formulations of the channel assignment problem in an FDMA network as a linear integer 0-1 program. We consider the objective of minimizing...

BibTeX reference
and

Let <i>G</i> be a simple graph and <i>C</i> and <i>D</i> two proper colourings of <i>G</i>. The problem of colour switching consists of finding a sequence ...

BibTeX reference
, , and

In this article we propose a mixed 0-1 linear programming model for the topological network design problem with modular switches such as the ones that will ...

BibTeX reference