A coloring of a graph is an assignment of colors to its vertices such that adjacent vertices have different colors. Two colorings are equivalent if they indu...

A training-image free, high-order sequential simulation method is proposed herein, which is based on the efficient inference of high-order spatial statistics...

We study the average number \(A(G)\) of colors in the non-equivalent colorings of a graph \(G\). We show some general properties of this graph invariant ...

The Bell numbers count the number of different ways to partition a set of \(n\) elements while the graphical Bell numbers count the number of non-equivalen...

We empirically test the prediction of Pastor, stambaugh, and Taylor (2020) that green firms outperform brown firms when concerns about climate change increas...

Scholars and practitioners have long recognised the importance of data-driven operations and supply chain management (OSCM), which typically centres on produ...

We consider the problem of designing vehicle routes in a distribution system that are at the same time cost-effective and visually attractive. In this pape...

This paper studies disjunctive cutting planes in Mixed-Integer Conic Programming. Building on conic duality, we formulate a cut-generating conic program for...

Data acquisition and recording in the form of databases are routine operations. The process of collecting data, however, may experience irregularities, res...

Conditional estimation given specific covariate values (i.e., local conditional estimation or functional estimation) is ubiquitously useful with applications...

Let \(G=(V,E)\) be a graph and let \(S\subseteq V\) be a subset of its vertices. If the subgraph of \(G\) induced by \(V\setminus S\) is acyclic, the...

Artificial Intelligence (AI) is the next society transformation builder. Massive AI-based applications include cloud servers, cell phones, cars, and pandemic...

The determinantal point process (DPP) provides a promising and attractive alternative to simple random sampling in cluster analysis or classification, for th...

The crew pairing problem is generally modelled as a set partitioning problem where the flights have to be partitioned in pairings. A pairing is a sequence of...

With sufficient layers, enough training data, enough time, and often a custom tailored architecture, modern deep learning methods can be extremely successf...

Deploying applications having many processes in a multi-cloud environment is challenging. The cloud manager has goals such as minimizing power consumption, w...

Les algorithmes de partitionnement de données aident à identifier des sous-groupes homogènes en ce sens que les données de chaque groupe partagent des caract...

A highly influential ingredient of many techniques designed to exploit sparsity in numerical optimization is the so-called chordal extension of a graph repre...

We introduce the conditional \(p\)-dispersion problem (c-pDP), an incremental variant of the \(p\)-dispersion problem (pDP). In the c-pDP, one is given a...

In this study, we develop a deterministic nonlinear filtering algorithm based on a high-dimensional version of Kitagawa (1987) to evaluate the likelihood fun...