Sentence examples for covering constraints from inspiring English sources

We review and compare covering constraints formulations, provide new insight into connectivity constraints, improve the model formulation and its solution procedure, and report computational results.

It is specially designed to produce a set of routes that fulfils demand covering constraints, while taking into account the interests of both users and operators.

This paper discusses the graph covering problem in which a set of edges in an edge- and node-weighted graph is chosen to satisfy some covering constraints while minimizing the sum of the weights.

In this paper, we propose a novel approach of formulating the routing problem as a shortest path problem with covering constraints (SPCC) and we also propose three algorithms for the SPCC.

The algorithm proposed, called Pair Insertion Algorithm (PIA) can be used to generate initial solutions for a local improvement or evolutionary algorithm, as well as to complete an unfeasible solution with respect to demand covering constraints.

This paper presents a new formulation to the problem based on set covering constraints.

Considering the covering constraint, for a specified O/D pair, if the total transportation cost in a given path is less than the determined covering radius it will be covered.

According to the dimer covering constraint, two dimers cannot touch each other, but can be located at opposite links of a lattice plaquette.

total demand density of the route considered direct trips and transfers Fixed Ant colony optimization Dalian City Yan et al. [29] Demand covering Feasibility constraints Load factor Fleet size Travel time reliability Min.

In BEAST, we used normal distributions with 95% confidence intervals covering these constraints as calibration priors with a birth-death process on the tree.

A LogNormal distribution with 95% confidence interval covering this constraint (42.7-15.9 mya) was used for the calibration prior, using next values for the offset: 15.9, standard deviation in log space: 2.0 and mean in log space: 0. We understand the limitations and uncertainties of dating with a few calibration points [ 61, 62].