In Part I (Rodriguez, et al., 2013 an optimization model was proposed to redesign the supply chain of spare parts industry under demand uncertainty in a specified planning horizon. To address large industrial problems, a Lagrangean scheme is proposed to decompose the MINLP of Part I according to the warehouses by dualizing the logic constraints that assign the warehouses to different customers,...

This paper presents a Lagrangean relaxation approach for solving a parallel machine scheduling problem where the objective function is to minimize the weighted number of late jobs. The approach is an extension of an approach that has been successfully applied to the one-machine case. It is the first method that gives lower bounds to the problem when an exact solution cannot be found.

In this paper we address a parallel version of subgradient algorithm to maximize Lagrangean dual function for the p-median problem. The parallelization is performed according to the sceme master-slave and using the Message Passing Interface. Computational results for very large-scale instances are given, showing the efficacy of the designed algorithm.

In search for a microscopic description of “droplet-like” properties for the Ising spin glass (single component order parameter, zero modes i.e. correlation functions vanishing at infinity) we reconsider the two-packet model of Bray and Moore, which is effectively Replica-Symmetric and enjoys zero modes but only up to one-loop. We show how an appropriate change in the limits of the basic parame...

The wellknown CLSP problem is generalized including sequence dependent setup times and overtimes and modeling it as a quadratic mixed 0-1 integer programming problem called Capacitated Lot Sizing Problem with Sequence Dependent Setups and Overtimes. We develop a heuristics based on Lagrangean relaxation and tabu search for solving the problem. At the end, some computational results are presented.

Erdös and Turán* proved important properties of the interpolating polynomial for the case when the zeros of 0„(x) are taken for abscissas of interpolation . The theorems so deduced enabled the authors cited to draw important conclusions concerning the distribution of the roots of orthogonal polynomials . The proofs of Erdös and Turin are based on some properties of the fundamental functions of ...

Abstract: Various combinatorial problems are effectively modelled in terms of (0,1) matrices. Origins are coming from n-cube geometry, hypergraph theory, inverse tomography problems, or directly from different models of application problems. Basically these problems are NP-complete. The paper considers a set of such problems and introduces approximation algorithms for their solutions applying L...

In this paper we present a benchmark problem for data association based on a real-world networked surveillance system, and compare the behavior of several multidimensional assignment (MDA) algorithms. The problem consists of a set of Ns observers which transmit track/event reports to a fusion center through a particular (real-world based) communication network among one of Nn networks. The netw...

A new method Is described for calculating bounds for a special class of 0-1 Integer programning problems. This met lod includes features of both Lagrangean and surrogate relaxation approaches. Certain binary knapsack calculations carried out in appropriate combinations together with an additivity principle provide the basis for computing the bounds.