Axis 2: Decision support made in complex systems
BackCahiers du GERAD
1368 results — page 19 of 69
Computational comparison of several algorithms for the minimum cost perfect matching problem
The aim of this paper is to computationally compare several algorithms for the Minimum Cost Perfect Matching Problem on an undirected graph. Our work is moti...
BibTeX reference
Necessary and sufficient conditions are provided for the existence of a simple
graph, or a simple connected graph with given
numbers \(m_{ij}\)
of edges ...
A survey of applications of viability theory to the sustainable exploitation of renewable resources
In this paper, we survey the literature applying viability theory to the sustainable management of renewable resources. After a refresher on the main conce...
BibTeX reference
This paper addresses the solution of the capacitated minimum cost flow problem on a network containing \(n\)
nodes and \(m\)
arcs. Satisfying necessary ...
We propose an iterative method named LSLQ for solving linear least-squares problems \(A x \approx b\)
of any shape.
The method is based on the Golub and K...
The object of study in the recent theory of Mean Field Games has been primarily large populations of agents interacting through a population dependent coupli...
BibTeX reference
While the joint optimization of production and outbound distribution decisions in a manufacturing context has been intensively studied in the past decade, th...
BibTeX reference
The integration of biorefinery processes into existing pulp and paper mills has been identified as a promising avenue to maintain mills activities. It could ...
BibTeX reference
The distance, distance Laplacian and distance signless Laplacian spectra of a connected graph \(G\)
are the spectra of the distance, distance Laplacian and...
On the nullity number of graphs
The paper discusses bounds on the nullity number of graphs. It is proved in [B. Cheng and B. Liu, On the nullity of graphs. Electron. J. Linear Algebra 16 ...
BibTeX referenceR&D investments in presence of free riders
It is an established result in the literature that if the knowledge spillover between firms is sufficiently high, then R&D investments are higher when firm...
BibTeX referenceHyper-heuristic approaches for solving stochastic optimization formulations of mineral value chains
This paper presents three hyper-heuristic approaches for the stochastic open-pit mine production scheduling problem with one processing stream (SMPS) and one...
BibTeX reference
Locally weighted regression combines the advantages of polynomial regression and kernel smoothing. We present three ideas for appropriate and effective use...
BibTeX reference
In this paper, we study how uncertainties weighing on the climate system impact the optimal technological pathways the world energy system should take to com...
BibTeX reference
Branch-price-and-cut is a leading methodology for solving various vehicle routing problems (VRPs). For many VRPs, the pricing problem of a branch-price-and-c...
BibTeX referenceSpatial effects and strategic behaviour in a multiregional transboundary pollution dynamic game
We analyze a transboundary pollution differential game where pollution control is spatially distributed among a number of agents with predetermined spatial r...
BibTeX reference
In the present paper we are interested in the study of the distance Laplacian eigenvalues of a connected graph with fixed order \(n\)
and chromatic number ...
We consider a class of dynamic games played over an event tree, with random terminal. We assume that the players wish to jointly optimize their payoffs thr...
BibTeX reference
The Mesh Adaptive Direct Search algorithm (MADS) is an iterative method for constrained blackbox optimization problems. One of the optional MADS features i...
BibTeX reference
Two-level orthogonal designs play an important role in industrial screening experiments, in which the primary goal is to identify the treatment factors with ...
BibTeX reference