Graffiti's conjecture 105 states that for any tree the range of transmissions of distance is greater than or equal to the range of degrees. After using the ...

During the last decade, reverse logistics has been introduced into the manufacturing language. Companies' and public's awareness of environmental issues are...

Thrackleation of graphs and global optimization for quadratically constrained quadratic programming are used to find the octagon with unit diameter and larg...

This paper considers a case of strongly monotone variational inequality problems defined over a convex set which is given by a "separation oracle". An analy...

This paper presents a decomposition approach for the solution of the dynamic programming formulation of the Unit Loading Problem in hydroplant management. T...

Proposed just a few years ago, Variable Neighborhood Search (VNS) is a new metaheuristic for combinatorial and global optimization, based upon systematic ch...

This paper solves the problem of designing an access tree network for which the users are connected to the switches through SONET channels on fiber optics l...

Reduction of some classes of global optimization programs to bilinear programs may be done in various ways, and the choice of method clearly influences the ...

This paper presents the problem of optimally dimensioning a new geographically distributed computer system that handles all communications between aircraft ...

In the literature, thermal insulation systems with a fixed number of heat intercepts have been optimized with respect to intercept locations and temperature...

In this paper we illustrate a new methodology for the design of fault-tolerant logical topologies in wavelength-routed optical networks exploiting wavelengt...

This paper addresses the problem whether a cooperative agreement, made at the start of a game, can be sustained over time. The players can reopen negotiatio...

We analyze the extent to which intergenerational teams provide information on workers' productivity in the long run. We use a dynamic stochastic framework ...

The Esau-Williams algorithm is one of the best known heuristics for the Capacitated Minimum Spanning Tree Problem. This research note describes a simple en...

Inspired by previous results on asymptotic minimax estimation for a ball of increasing radius in R^<i>n</i>, we study the analogous problem for do...

In this article we propose a model for the topological design problem of multitechnology networks that includes the location of switches and their port conf...

This paper presents a novel integration of interior point cutting plane methods within branch-and-price algorithms. Unlike the classical method, columns are...

This paper deals with sensitivity analysis (gradient estimation) of random horizon performance measures of Markov chains. More precisely, we consider genera...

This article reports on some recent algorithmic development for the <i>Rural Postman Problem</i> (CPP) and for the <i>Capacitated Arc Routing Problem</i> (C...

The <i>p</i>-Center problem consists in locating <i>p</i> facilities and assigning clients to them in order to minimize the maximum distance between a clien...