This paper addresses the non-linear programming problem of globally minimizing the real valued function x⟶d(x,Sx) where S is a generalized proximal contraction in the setting of a metric space. Eventually, one can obtain optimal approximate solutions to some fixed-point equations in the event...

We define generalized (preference) domains <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$\mathcal{D}$</EquationSource> </InlineEquation> as subsets of the hypercube {−1,1}<Superscript> D </Superscript>, where each of the D coordinates relates to a yes-no issue. Given a finite set of n individuals, a profile assigns each individual to an element of <InlineEquation ID="IEq2"> <EquationSource Format="TEX">$\mathcal{D}$</EquationSource> </InlineEquation>. We prove that, for any domain <InlineEquation ID="IEq3"> <EquationSource...</equationsource></inlineequation></equationsource></inlineequation></superscript></equationsource></inlineequation>

In this paper we consider the problem of locating an axis-parallel rectangle in the plane such that the sum of distances between the rectangle and a finite point set is minimized, where the distance is measured by the Manhattan norm ℓ <Subscript>1</Subscript>. In this way we solve an extension of the Weber problem...</subscript>

The main focus of this note is on the interval Shapley value for interval games introduced by Alparslan Gök et al. (Cent. Eur. J. Oper. Res. 18:131–140, <CitationRef CitationID="CR4">2010</CitationRef>). In the framework of interval games, we introduce the potential approach and prove that the interval Shapley value can be formulated...</citationref>

This paper presents a successful application of operations research techniques in guiding the decision making process to achieve a superior operational efficiency in core activities. We focus on a rich vehicle routing problem faced by a Portuguese food distribution company on a daily basis. This...

The paper under discussion is a well-written exposition on the performance modeling of communication systems by discrete-time queueing systems, and their analysis. It basically consists of two parts: a review of the literature, focusing on the modelling of information streams and on scheduling...

We develop a unified error bound theory to compare a given p-median, p-center or covering location model with continuously distributed demand points in R <Superscript> n </Superscript> to a corresponding given original model of the same type having a finite collection of demand points in R <Superscript> n </Superscript>. We give ways to construct...</superscript></superscript>

The mixture design problem for two products concerns finding simultaneously two recipes of a blending problem with linear, quadratic and semi-continuity constraints. A solution of the blending problem minimizes a linear cost objective and an integer valued objective that keeps track of the...

This paper studies the customers’ equilibrium and socially optimal joining–balking behavior in single-server Markovian queues with multiple working vacations. Different from the classical vacation policies, the server does not completely stop service but maintains a low service rate in...