Mining planning is a central problem in the mining business with the goal of setting high revenued exploitation agendas. However, current models lack robustness: they do not consider uncertainty of the future, so the plans are, indeed, recalculated every year according to the new information. This work presents some approaches to solve the...
-
December 2003 (v1)ReportUploaded on: December 3, 2022
-
December 2004 (v1)Report
In this paper we define and study a call scheduling problem that is motivated by radio networks. In such networks the physical space is a common resource that nodes have to share, since concurrent transmissions cannot be interfering. We study how one can satisfy steady bandwidth demands according to this constraint. This leads to the definition...
Uploaded on: December 3, 2022 -
October 2008 (v1)Journal article
International audience
Uploaded on: December 3, 2022 -
March 13, 2006 (v1)Conference paper
International audience
Uploaded on: February 22, 2023 -
May 9, 2006 (v1)Conference paper
National audience
Uploaded on: December 3, 2022 -
2006 (v1)Report
In this paper, we address the problem of gathering information in a specific node (or \emph{sink}) of a radio network, where interference constraints are present. We take into account the fact that, when a node transmits, it produces interference in an area bigger than the area in which its message can actually be received. The network is...
Uploaded on: December 4, 2022 -
2006 (v1)Journal article
In this paper, we address the problem of gathering information in a specific node (or \emph{sink}) of a radio network, where interference constraints are present. We take into account the fact that, when a node transmits, it produces interference in an area bigger than the area in which its message can actually be received. The network is...
Uploaded on: December 3, 2022 -
March 13, 2006 (v1)Conference paper
International audience
Uploaded on: December 3, 2022 -
March 2013 (v1)Journal article
In this paper, we address the problem of gathering information in one node (sink) of a radio network where interference constraints are present: when a node transmits, it produces interference in an area bigger than the area in which its message can actually be received. The network is modeled by a graph; a node is able to transmit one unit of...
Uploaded on: October 11, 2023 -
March 2013 (v1)Journal article
In this paper, we address the problem of gathering information in one node (sink) of a radio network where interference constraints are present: when a node transmits, it produces interference in an area bigger than the area in which its message can actually be received. The network is modeled by a graph; a node is able to transmit one unit of...
Uploaded on: December 2, 2022