Search results for "routing"
showing 10 items of 587 documents
Stancu–Schurer–Kantorovich operators based on q-integers
2015
The goal of this paper is to introduce and study q analogue of Stancu-Schurer-Kantorovich operators. A convergence theorem using the well known Bohman-Korovkin criterion is proven and the rate of convergence involving the modulus of continuity is established. The estimate of the rate of convergence by means of the Lipshitz function is considered. Furthermore, we obtained a Voronovskaja type result for these operators. Also, we investigate the statistical approximation properties of these operators using Korovkin type statistical approximation theorem.
Polyhedral results for a vehicle routing problem
1991
Abstract The Vehicle Routing Problem is a well known, and hard, combinatorial problem, whose polyhedral structure has deserved little attention. In this paper we consider the particular case in which all the demands are equal (since in the general case the associated polytope may be empty). From a known formulation of the problem we obtain the dimension of the corresponding polytope and we study the facetial properties of every inequality in it.
The mixed general routing polyhedron
2003
[EN] In Arc Routing Problems, ARPs, the aim is to find on a graph a minimum cost traversal satisfying some conditions related to the links of the graph. Due to restrictions to traverse some streets in a specified way, most applications of ARPs must be modeled with a mixed graph. Although several exact algorithms have been proposed, no polyhedral investigations have been done for ARPs on a mixed graph. In this paper we deal with the Mixed General Routing Problem which consists of finding a minimum cost traversal of a given link subset and a given vertex subset of a mixed graph. A formulation is given that uses only one variable for each link (edge or arc) of the graph. Some properties of the…
Convergence of GBS Operators
2018
In [59, 60], Bogel introduced a new concept of Bogel-continuous and Bogel-differentiable functions and also established some important theorems using these concepts. Dobrescu and Matei [80] showed the convergence of the Boolean sum of bivariate generalization of Bernstein polynomials to the B-continuous function on a bounded interval. Subsequently, Badea and Cottin [46] obtained Korovkin theorems for GBS operators.
The computational complexity of the relative robust shortest path problem with interval data
2004
Abstract The paper deals with the relative robust shortest path problem in a directed arc weighted graph, where arc lengths are specified as intervals containing possible realizations of arc lengths. The complexity status of this problem has been unknown in the literature. We show that the problem is NP -hard.
A class of label-correcting methods for the K shortest paths problem
2001
In this paper we deal with the problem of finding the first K shortest paths from a single origin node to all other nodes of a directed graph. In particular, we define the necessary and sufficient conditions for a set of distance label vectors, on the basis of which we propose a class of methods which can be viewed as an extension of the generic label-correcting method for solving the classical single-origin all-destinations shortest path problem. The data structure used is characterized by a set of K lists of candidate nodes, and the proposed methods differ in the strategy used to select the node to be extracted at each iteration. The computational results show that: 1. some label-correct…
A General Algorithm to Calculate the Inverse Principal $p$-th Root of Symmetric Positive Definite Matrices
2019
We address the general mathematical problem of computing the inverse p-th root of a given matrix in an efficient way. A new method to construct iteration functions that allow calculating arbitrary p-th roots and their inverses of symmetric positive definite matrices is presented. We show that the order of convergence is at least quadratic and that adaptively adjusting a parameter q always leads to an even faster convergence. In this way, a better performance than with previously known iteration schemes is achieved. The efficiency of the iterative functions is demonstrated for various matrices with different densities, condition numbers and spectral radii.
Henstock–Kurzweil–Pettis integrability of compact valued multifunctions with values in an arbitrary Banach space
2013
Abstract The aim of this paper is to describe Henstock–Kurzweil–Pettis (HKP) integrable compact valued multifunctions. Such characterizations are known in case of functions (see Di Piazza and Musial (2006) [16] ). It is also known (see Di Piazza and Musial (2010) [19] ) that each HKP-integrable compact valued multifunction can be represented as a sum of a Pettis integrable multifunction and of an HKP-integrable function. Invoking to that decomposition, we present a pure topological characterization of integrability. Having applied the above results, we obtain two convergence theorems, that generalize results known for HKP-integrable functions. We emphasize also the special role played in …
Weighted-Power p Nonlinear Subdivision Schemes
2012
In this paper we present and analyze a generalization of the Powerp subdivision schemes proposed in [3,12]. The Weighted-Powerp schemes are based on a harmonic weighted version of the Power<emp average considered in [12], and their development is motivated by the desire to generalize the nonlinear analysis in [3,5] to interpolatory subdivision schemes with higher than second order accuracy.
Analysis of properties of recombination operators proposed for the node-depth encoding
2011
The node-depth encoding is a representation for evolutionary algorithms applied to tree problems. Its represents trees by storing the nodes and their depth in a proper ordered list. The original formulation of the node-depth encoding has only mutation operators as the search mechanism. Although it is computationally efficient, the exclusive use of mutation restricts the exploration of the search space and the algorithm convergence. Then, this work proposes two specific recombination operators to improve the convergence of the algorithm using the node-depth encoding representation. These operators are based on recombination operators for permutation representations. Analysis of the proposed …