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

Given a complete directed graph \(G\) with weights on the vertices and on the arcs, a \(\theta\)-improper \(k\)-coloring of \(G\) is an assignment of...

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

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

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

Graph theoretical heuristics are used extensively in many fields to solve approximately large scale optimization problems. Graph theoretical heuristics can a...

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

The Dial-a-Ride Problem (DARP) consists of designing a set of routes to transport clients from pickup node to delivery node, taking into account vehicle capa...

An electronic nose (e-nose), or artificial olfactometer, is a device that analyzes the air to quantify odor concentration using an array of gas sensors. Thi...

We study distributed methods for online prediction and stochastic optimization. Our approach is iterative: in each round nodes first perform local computatio...

The maximum \(k\)-colorable subgraph problem (\(k\)-MCSP) is to color as many vertices as possible with at most \(k\) colors, such that no two adjacent...

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

The Mesh Adaptive Direct Search algorithm (MADS) is an iterative method for constrained blackbox optimization problems. One of the optional MADS features i...

Two-level orthogonal designs play an important role in industrial screening experiments, in which the primary goal is to identify the treatment factors with ...

Recent developments in the global rare earth elements (REE) sector have caused a surge in motivation for nations outside of China to secure their own REE sup...