We present a branch-price-and-cut method to solve a maritime pickup and delivery problem with time windows and split loads. The fleet of ships is heterogen...

Classical control charts detect when a process loses its stability, but they do not give indications on the gravity of the instability and on the risk incu...

In chemical graph theory, many graph parameters, or topological indices, were proposed as estimators of molecular structural properties. Often several varian...

Operational problems arising in the planning of integrated supply chains have been increasingly studied in the past decade. Among these, the production rout...

We consider a class of infeasible, path-following methods for convex quadratric programming. Our methods are designed to be effective for solving both nonde...

A travelling deliveryman needs to find a tour, such that the total waiting time of all his customers is minimum. The Deliveryman starts his tour at a depot...

In this article we address the model order reduction problem for resistor networks by using methods from graph theory. We formulate this problem through gr...

Monte Carlo method for estimating multidimensional integrals, with applications to rare-event probability estimation. The method fuses two distinct and po...

Randomized quasi-Monte Carlo (RQMC) can be seen as a variance reduction method that provides an unbiased estimator of the integral of a function <i>f</i> ov...

It is now well known that in order to solve global environmental problems, such as global warming, a volunteer participation of sovereign countries to inte...

Let \(G\) be a connected graph, \(n\) the order of \(G\), and \(f\) (resp. \(t\)) the maximum order of an induced forest (resp. tree) in \(G\). ...

We propose an interior-point algorithm based on an elastic formulation of the \(\ell_1\)-penalty merit function for mathematical programs with complementar...

We present a new primal-dual interior-point algorithm for linear programming problems with equality and inequality constraints. The inequality constraints ar...

Carbon leakage and competitiveness concerns are some of the main reasons why an international environmental agreement is lacking to fight climate change. M...

This paper presents a non--technical account of the developments in tree--based methods for the analysis of survival data with censoring. This review desc...

The decomposition of the movement of the eye into different categories is critical to their study. According to the algorithm used, some movements may signi...

In this paper, we present an edge and vertex decomposition of the Wiener index (<i>W</i>) that is related to the concept of betweenness centrality used in so...

There are currently several systems to collect online writing data in keystroke logging. Each of these systems provides reliable and very precise data. Unf...

An <i>r</i>-equitable <i>k</i>-coloring <i>c</i> of a graph <i>G=(V,E)</i> is a partition of <i>V</i> into <i>k</i> stable sets <img src="/cgi-bin/mimetex.cg...

It is well known that some local search algorithms for <i>K</i>-clustering problems could stop at a solution with fewer clusters than the desired <i>K</i>....