Benefitting from the unequaled precision of pulsar timing technique, binary pulsars are important testbeds gravity theories, providing some tightest bounds on alternative theories gravity. One class well-motivated scalar-tensor gravity, predict large deviations general relativity for neutron stars through a nonperturbative phenomenon known as spontaneous scalarization. This effect, which cannot...

We present a new family of exact black hole configurations, which is solution to generalized Einstein-Maxwell-Dilaton setup in arbitrary dimension. These solutions are asymptotically Lifshitz for any dynamical critical exponent $z\ensuremath{\ge}1$. It turns out that the existence nontrivial scalar field direct consequence breaking spacetime isotropic scaling symmetry. This accepts various inte...

K. Decker1, M. Fisher2, M. Luck3, M. Tennenholtz4, and UKMAS’98 Contributorsy y UKMAS’98 Contributors: M.D. Beer, T.J.M. Bench-Capon and A. Sixsmith; C. Ghidini and L. Serafini; E. Alonso; T.J. Norman, C. Sierra and N.R. Jennings; B. Edmonds; M. Schroeder, I. Mora and J. Alferes; R.M. van Eijk. F.S. de Boer, W. van der Hoek and J-J.Ch. Meyer 1. Computer and Information Sciences, University of D...

Gerardo Adesso, Alessio Serafini and Fabrizio Illuminati Dipartimento di Fisica “E. R. Caianiello”, Università degli Studi di Salerno; CNR-Coherentia, Gruppo di Salerno; and INFN Sezione di Napoli-Gruppo Collegato di Salerno; Via S. Allende, 84081 Baronissi (SA), Italy Centre for Quantum Computation, DAMTP, Centre for Mathematical Sciences, University of Cambridge, Wilberforce Road, Cambridge C...

A new parameterized binary relation is used to define minimality concepts in vector optimization. To simplify the problem of determining minimal elements the method of scalarization is applied. Necessary and sufficient conditions for the existence of minimal elements with respect to the scalarized problems are given. The multiplier rule of Lagrange is generalized. As a necessary minimality cond...

It is known that vector variational inequality models arises from vector optimization and vector traac equilibria. In this paper, existence results of a solution for a generalized pre-vector variational inequality and a generalized pre-quasi-vector variational inequality are established. The main condition used is that the underlying vector-valued function is assumed to be cone-quasi-convex. Th...

Our goal in this talk is to present unifying concepts for both stochastic and robust optimization problems involving infinite uncertainty sets. We apply methods from vector optimization in general spaces, set-valued optimization and scalarization techniques to develop a unified characterization of different concepts of robust optimization and stochastic programming. These methods provide new in...

In this paper we extend to the vector case the notion of increasing along rays function. The proposed definition is given by means of a nonlinear scalarization through the so-called oriented distance function from a point to a set. We prove that the considered class of functions enjoys properties similar to those holding in the scalar case, with regard to optimization problems, relations with (...

The concepts of well-posedness of l-set optimization problem under variable order structure are introduced, the metric characterizations and sufficient criteria of well-posedness of a l-set optimization problem are proposed, and the equivalent relations between the well-posedness of l-set optimization problem and that of a scalarization minimization problem are established. Finally, by discussi...

Web service composition combines available services to provide new functionality. The various available services have different quality-of-service (QoS) attributes. Building a QoS-optimal web service composition is a multi-criteria NP-hard problem. Most of the existing approaches reduce this problem to a single-criterion problem by aggregating different criteria into a unique global score (scal...