Displaying similar documents to “Lower bounds for summability matrices on weighted sequence spaces.”

Weighted composition operators on weighted Lorentz spaces

İlker Eryilmaz (2012)

Colloquium Mathematicae

Similarity:

The boundedness, compactness and closedness of the range of weighted composition operators acting on weighted Lorentz spaces L(p,q,wdμ) for 1 < p ≤ ∞, 1 ≤ q ≤ ∞ are characterized.

New lower bounds on the weighted chromatic number of a graph

Massimiliano Caramia, Jirí Fiala (2004)

Discussiones Mathematicae Graph Theory

Similarity:

In this paper we present theoretical and algorithmic results for the computation of lower bounds on the chromatic number of a weighted graph. In particular, we study different ways of a possible improvement of the lower bound offered by a maximum weighted clique. Based on our findings we devise new algorithms and show their performance on random graphs.

Some inequalities involving upper bounds for some matrix operators. I

R. Lashkaripour, D. Foroutannia (2007)

Czechoslovak Mathematical Journal

Similarity:

In this paper we consider the problem of finding upper bounds of certain matrix operators such as Hausdorff, Nörlund matrix, weighted mean and summability on sequence spaces l p ( w ) and Lorentz sequence spaces d ( w , p ) , which was recently considered in [9] and [10] and similarly to [14] by Josip Pecaric, Ivan Peric and Rajko Roki. Also, this study is an extension of some works by G. Bennett on l p spaces, see [1] and [2].

Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions

Imed Kacem, Nizar Souayah, Mohamed Haouari (2012)

RAIRO - Operations Research

Similarity:

This paper deals with the parallel-machine scheduling problem with the aim of minimizing the total (weighted) tardiness under the assumption of different release dates. This problem has been proven to be NP-hard. We introduce some new lower and upper bounds based on different approaches. We propose a branch-and-bound algorithm to solve the weighted and unweighted total tardiness. Computational experiments were performed on a large set of ...

Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions

Imed Kacem, Nizar Souayah, Mohamed Haouari (2012)

RAIRO - Operations Research

Similarity:

This paper deals with the parallel-machine scheduling problem with the aim of minimizing the total (weighted) tardiness under the assumption of different release dates. This problem has been proven to be NP-hard. We introduce some new lower and upper bounds based on different approaches. We propose a branch-and-bound algorithm to solve the weighted and unweighted total tardiness. Computational experiments were performed on a large set of ...

On weighted composition operators acting between weighted Bergman spaces of infinite order and weighted Bloch type spaces

Elke Wolf (2011)

Annales Polonici Mathematici

Similarity:

Let ϕ: → and ψ: → ℂ be analytic maps. They induce a weighted composition operator ψ C ϕ acting between weighted Bergman spaces of infinite order and weighted Bloch type spaces. Under some assumptions on the weights we give a characterization for such an operator to be bounded in terms of the weights involved as well as the functions ψ and ϕ