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

La littérature en R&D a établi que si le paramètre mesurant le débordement en connaissance est suffisamment élevé, alors les firmes investissent plus en rech...

Global warming is a much discussed topic as it sparks debate for shaping government policy and how humans should behave in reaction to climate change. Global...

This paper analyzes the effects of geological heterogeneity representation in a producing reservoir, when different stochastic simulation methods are used, s...

For pattern-based simulation methods such as SIMPAT, filtersim, wavesim, ect, patterns are stored by scanning a training image with a sliding template. Dimen...

The traditional mine planning framework employs a flawed approach in the design of ultimate pit limits and phases. Conventional methods arbitrarily confine ...

This paper presents three hyper-heuristic approaches for the stochastic open-pit mine production scheduling problem with one processing stream (SMPS) and one...

Complex polymetallic mining projects with multiple processing streams tend to require tight blending constraints, with different operational and processing t...

With the advent of inexpensive sensors and digital storage, increasing amounts of data about a mining complex can be collected. This can include camera imagi...

Every mining operation faces a decision on additional drilling at some point during its lifetime. The two questions that always arise with this decision are ...

Locally weighted regression combines the advantages of polynomial regression and kernel smoothing. We present three ideas for appropriate and effective use...

Étant donné un graphe \(G\) complet, orienté, avec des poids sur les sommets et les arcs, une \(k\)-coloration \(\theta\)-impropre de \(G\) est une...

We consider the NP-hard problem of synthesis of optimal spanning communication subgraph in a given arbitrary simple edge-weighted graph. This problem occurs ...

We investigate the well-known NP-hard problem of finding an optimal communication subgraph in a given edge-weighted graph. This problem appears in different ...

We consider the problem of optimal communication tree construction in a given undirected weighted graph. Such a problem occurs while minimizing the power c...

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

La méthode de branch-cut-and-price est la plus performante pour une grande panoplie de problèmes de tournées de véhicules (PTV). Pour plusieurs d'entre eux...

In this paper we present our solution for the Challenge problem publicly announced by Railway Application Section (RAS), which operates within INFORMS. Varia...

We analyze a transboundary pollution differential game where pollution control is spatially distributed among a number of agents with predetermined spatial r...

Les heuristiques basées sur la théorie des graphes sont largement utilisées dans plusieurs domaines pour résoudre approximativement des problèmes d'optimisat...