The distance energy of a graph <i>G</i> is defined as <img src="/cgi-bin/mimetex.cgi?ED(G) = \sum |\mui |">, where <img src="/cgi-bin/mimetex.cgi?\mu_i"> i...

<p>The introduction of new applications that require high bandwidth, high service availability and reliability has generated many researches in the design of...

In this work we develop new methods and algorithms for building networks with high synchronizability of dynamical processes occurring at their nodes. In addi...

This paper evaluates the changes in efficiency and productivity of coal-fired electricity generation of 30 Chinese administrative regions from 1999 to 2007. ...

<p>With the increasing concern for global warming, the impact of Internet power consumption is gaining interest. In this paper, we explore, for the first ti...

The issue of Internet energy consumption and its contribution to global warming has been gaining importance lately. In this paper we present a compilation of...

The Traveling Salesman Problem and the Vehicle Routing Problem are two of the most popular problems in the field of combinatorial optimization. The purpose ...

As of April 2007, the European Union has new regulations concerning driver working hours. These rules force the placement of breaks and rests into the vehicl...

The <i>proximity</i> <img src="/cgi-bin/mimetex.cgi?\pi = \pi (G)"> of a connected graph <i>G</i> is the minimum, over all vertices, of the average distance ...

A <i>k</i>-edge-coloring of a graph <i>G=(V,E)</i> is a function <i>c</i> that assigns an integer <i>c(e)</i> (called color) in <i>{0,1, ..., k-1}</i> to eve...

This paper presents a general framework for formulating cutting planes in the context of column generation for integer programs. Valid inequalities can be de...

<p>We propose a new design scheme of resilient Wavelength Division Multiplexing (WDM) networks by extending and reshaping pre-configured protection tree (<i...

We consider a marketing channel with a single manufacturer and a single retailer, where both advertising and quality improvement contribute to the build-up o...

In this paper we extend some results in Cramér (1955) by considering the expected discounted penalty function as a generalization of the infinite time ruin p...

A discretization scheme for nonnegative diffusion processes is proposed and the convergence of the corresponding sequence of approximate processes is proved ...

This paper aims at developing omnibus procedures for testing for serial correlation using spectral density estimation and wavelet shrinkage. We derive the as...

We address the problem of locating in the plane objects such as segments, arcs of circumferences, arbitrary convex sets, their complements or their boundarie...

Harmonic means clustering is a variant of Minimum sum of squares clustering (which is sometimes called <i>K</i>-means clustering), designed to alleviate the ...

Variable neighborhood search (VNS) is a metaheuristic for solving combinatorial and global optimization problems whose basic idea is a systematic change o...

Let <i>Q = D + A</i> denote the signless Laplacian matrix of a graph <i>G</i> of order <i>n</i>, where <i>D</i> is the diagonal matrix of the degrees and <i...