Customer-Company Identification : a Study of Relational Consequences in the Non-Profit Sector.

A transdisciplinary literature review enabled us to identify a new construct in the marketing research field, i.e. Customer-Company Identification. It is defined as the process whereby customer’s beliefs about a company become self-defining and whereby he defines himself by the same attributes he believes define the other customers of this company. This research aims at developing a measurement scale of the construct and showing its relational consequences, such as knowledge about the company, empathy, relationship investment and attachment.Relations avec la clientèle; Identification; Relationship marketing;

Customer-Company Identification: A Study of Relational Consequences in the Non-Profit Sector

In the first section, a literature review on identification enables a clear definition of the "Customer-Company Identification" construct to be given. Then in the second section, the conceptual framework and the main hypothesis are exposed. In the third section, an empirical investigation into a non-profit sector (i.e. higher education) is presented. Finally, in the last section the results are discussed.relationship marketing; customer-company identification; relationship investment; attachment

La ordenación de costas en el derecho comparado

La costa no es sólo un sustrato de carácter dinámico que se resiste a la implantación de los aprovechamientos, sino que también es un recurso natural y un espacio reconocido como de libre disfrute por parte de todos. Estos aspectos, que desde siempre han regido las relaciones entre la costa y las comunidades humanas, han adquirido en las últimas cuatro décadas una gran relevancia debido a dos factores principales: la explosión de la industria turística por una parte, y la consagracion en los años 70 del medio ambiente como bien jurídico a proteger por otra. En este contexto nace una disciplina nueva, la llamada gestión integrada de zonas costeras, de marcado carácter multidisciplinar y que por su falta relativa de madurez carece aún de fundamentos racionales nítidos, discutiéndose en la actualidad hasta la definición de sus objetivos a alcanzar

On the complexity of the multiple stack TSP, kSTSP

The multiple Stack Travelling Salesman Problem, STSP, deals with the collect and the deliverance of n commodities in two distinct cities. The two cities are represented by means of two edge-valued graphs (G1,d2) and (G2,d2). During the pick-up tour, the commodities are stored into a container whose rows are subject to LIFO constraints. As a generalisation of standard TSP, the problem obviously is NP-hard; nevertheless, one could wonder about what combinatorial structure of STSP does the most impact its complexity: the arrangement of the commodities into the container, or the tours themselves? The answer is not clear. First, given a pair (T1,T2) of pick-up and delivery tours, it is polynomial to decide whether these tours are or not compatible. Second, for a given arrangement of the commodities into the k rows of the container, the optimum pick-up and delivery tours w.r.t. this arrangement can be computed within a time that is polynomial in n, but exponential in k. Finally, we provide instances on which a tour that is optimum for one of three distances d1, d2 or d1+d2 lead to solutions of STSP that are arbitrarily far to the optimum STSP