Search results for "Special case"
showing 10 items of 45 documents
A Scatter Search Algorithm for the Split Delivery Vehicle Routing Problem
2008
In this chapter we present a metaheuristic procedure constructed for the special case of the Vehicle Routing Problem in which the demands of clients can be split, i.e., any client can be serviced by more than one vehicle. The proposed algorithm, based on the scatter search methodology, produces a feasible solution using the minimum number of vehicles. The quality of the obtained results is comparable to the best results known up to date on a set of instances previously published in the literature.
A New Metaheuristic for the Vehicle Routing Problem with Split Demands
2007
In this paper we present a metaheuristic procedure constructed for the special case of the Vehicle Routing Problem in which the demands of the clients can be split, i.e., any client can be serviced by more than one vehicle. The proposed algorithm, based on the scatter search methodology, produces a feasible solution using the minimum number of vehicles. The results obtained compare with the best results known up to date on a set of instances previously published in the literature.
A proof of bistability for the dual futile cycle
2014
Abstract The multiple futile cycle is an important building block in networks of chemical reactions arising in molecular biology. A typical process which it describes is the addition of n phosphate groups to a protein. It can be modelled by a system of ordinary differential equations depending on parameters. The special case n = 2 is called the dual futile cycle. The main result of this paper is a proof that there are parameter values for which the system of ODE describing the dual futile cycle has two distinct stable stationary solutions. The proof is based on bifurcation theory and geometric singular perturbation theory. An important entity built of three coupled multiple futile cycles is…
Zur numerischen Lösung gewöhnlicher Differential-gleichungen mit Splines in einem Sonderfall
1980
In an earlier paper [1] a general procedure has been presented to obtain polynomial spline approximations for the solution of the initial value problem for ordinary differential equations. In this paper the general procedure is described by an equivalent one step method. Furthermore two convergence theorems are proved for a special case which is not included in the general convergence or divergence theory given in [1].
Cotas inferiores para el QAP-Arbol
1985
The Tree-QAP is a special case of the Quadratic Assignment Problem where the flows not equal zero form a tree. No condition is required for the distance matrix. In this paper we present an integer programming formulation for the Tree-QAP. We use this formulation to construct four Lagrangean relaxations that produce several lower bounds for this problem. To solve one of the relaxed problems we present a Dynamic Programming algorithm which is a generalization of the algorithm of this type that gives a lower bound for the Travelling Salesman Problem. A comparison is given between the lower bounds obtained by each ralaxation for examples with size from 12 to 25.
On decoupling in Banach spaces
2021
AbstractWe consider decoupling inequalities for random variables taking values in a Banach space X. We restrict the class of distributions that appear as conditional distributions while decoupling and show that each adapted process can be approximated by a Haar-type expansion in which only the pre-specified conditional distributions appear. Moreover, we show that in our framework a progressive enlargement of the underlying filtration does not affect the decoupling properties (in particular, it does not affect the constants involved). As a special case, we deal with one-sided moment inequalities for decoupled dyadic (i.e., Paley–Walsh) martingales and show that Burkholder–Davis–Gundy-type in…
A loop-free two-close Gray-code algorithm for listing k-ary Dyck words
2006
AbstractP. Chase and F. Ruskey each published a Gray code for length n binary strings with m occurrences of 1, coding m-combinations of n objects, which is two-close—that is, in passing from one binary string to its successor a single 1 exchanges positions with a 0 which is either adjacent to the 1 or separated from it by a single 0. If we impose the restriction that any suffix of a string contains at least k−1 times as many 0's as 1's, we obtain k-suffixes: suffixes of k-ary Dyck words. Combinations are retrieved as special case by setting k=1 and k-ary Dyck words are retrieved as a special case by imposing the additional condition that the entire string has exactly k−1 times as many 0's a…
A Logic of Discovery
1998
A logic of discovery is introduced. In this logic, true sentences are discovered over time based on arriving data. A notion of expectation is introduced to reflect the growing certainty that a universally quantified sentence is true as more true instances are observed. The logic is shown to be consistent and complete. Monadic predicates are considered as a special case
Towards efficient inductive synthesis: Rapid construction of local regularities
2006
Given several input/output examples of some function we can state the problem: what is the “simplest” function which complies with these examples. This problem is well studied and is known to be very hard in the general case. In this paper we address a special case of the problem, when the target function can be expressed as a simple composition of known functions. We propose a new inductive synthesis algorithm for this case and show that it is efficient enough to synthesize complex geometry formulas.
Min-max control of uncertain multi-inventory systems with multiplicative uncertainties
2001
In this note, we consider production-distribution systems with buffer and capacity constraints. For such systems, we assume that the model is not known exactly. More precisely, the entries of the matrix representing the system structure may be affine functions of some uncertain time-varying parameters that take values within assigned bounds. We give stabilizability conditions that can be checked, in principle, by solving a min-max problem on the surface of the state-space (buffer level space) unit ball. Then, we consider a special case in which each uncertain parameter affects a single column of the system matrix and is independent of all the other ones. In this case, we propose a mixed int…