# Odile Marcotte

Back## Publications

### Cahiers du GERAD

**Odile Marcotte**, Frédéric Quesnel, Julie Carreau, Juliana Schulz, Alexandre Blondin Massé, Michael R. Lindstrom, Marie-Jean Meurs, Alain Hertz, Golshid Aflaki, Jean-François Plante, Ernest Tafolong, and Mathieu Gervais-Dubé

The Twelfth Montreal IPSW took place on August 22-26, 2022, and was jointly organized by the Centre de recherches mathématiques (CRM) and the Institute for D...

BibTeX reference**Odile Marcotte**

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**Odile Marcotte**

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**Odile Marcotte**, Mario Morfin, and Mary Pugh

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

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

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

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

BibTeX reference

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**Odile Marcotte**, Wil H.A. Schilders, and Suzanne M. Shontz

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

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\)`

. ...

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**Odile Marcotte**

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**Odile Marcotte**

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

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

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

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

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**Odile Marcotte**

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

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**Odile Marcotte**and Pierre Hansen

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

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

We present an overview of the exact methods for channel assignment in cellular networks together with a new linear 0-1 column generation formulation. After ...

BibTeX reference**Odile Marcotte**

We describe a method of channel assignment for cellular telephone systems (in which a limited number of rearrangements are allowed) that gives good performa...

BibTeX reference

We present a 0-1 column generation model for channel block assignment in a cellular network, with the objective of minimizing the interference level. Priori...

BibTeX reference

We consider a model for communications network design that includes the optimal location of switches (of which there are several types) and the design of th...

BibTeX reference**Odile Marcotte**

Let <i>G =</i> (<i>V,E</i>) be an undirected graph and <i>c</i> any vector in Z<sub>+</sub><sup><i>V</i>(<i>G</i>)</sup>. Denote by <img src="chi.gif" alig...

BibTeX reference

In this paper we tackle the problem of jointly finding the optimal location of the ATM switches, the topology of the backbone and local access networks, the...

BibTeX reference### Articles

**Odile Marcotte**, Mario Morfin, and Mary Pugh

**Odile Marcotte**, Asma Mdimagh, Michel Carreau, and François Welt

**Odile Marcotte**, and Stevan Harnad

**Odile Marcotte**, Jean Marc Lina, Eliane Kobayashi, and Christophe Grova

**Odile Marcotte**, and David Schindl

**Odile Marcotte**

**Odile Marcotte**, Wil H.A. Schilders, and Suzanne M. Shontz

**Odile Marcotte**, Asma Mdimagh, Michel Carreau, and François Welt

**Odile Marcotte**, and David Schindl

**Odile Marcotte**

**Odile Marcotte**, Dominique Orban, and Vincent Zalzal

**Odile Marcotte**

**Odile Marcotte**, and François Soumis

**Odile Marcotte**, François Soumis, and M van Putten

### Books

**Odile Marcotte**

**Odile Marcotte**

**Odile Marcotte**