The Thirteenth Montreal IPSW took place on August 21-25, 2023, and was jointly organized by the Centre de recherches mathématiques (CRM) and the Institute ...

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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