Search results for "Management Science"
showing 10 items of 1017 documents
Design management capability and product innovation in SMEs
2013
[Purpose]: The aim of this paper is to present design management as a dynamic capability and to analyze its mediating role between organizational learning capability and product innovation performance in small and medium enterprises (SMEs). [Design/methodology/approach]: Structural equation modeling is used to test the research hypotheses based on data from the Italian and Spanish ceramic tile industries. The data are derived from the responses of 182 companies (50 percent of the target population) to a questionnaire addressed to Product Development Managers and Human Resource Managers. [Findings]: The results suggest that organizational learning capability enhances product innovation throu…
Examining the Quality of Evolution Frameworks and Metamodeling Paradigms of Information Systems Development Methodologies
2011
Information systems development methodologies and associated CASE tools have been considered cornerstones for building quality into an information system. The construction and evaluation of methodologies are usually carried out by evaluation frameworks and metamodels, both considered as meta-methodologies. This chapter investigates and reviews representative metamodels and evaluation frameworks for assessing the capability of methodologies to contribute to high-quality outcomes. It presents a summary of their quality features, strengths, and weaknesses. The chapter ultimately leads to a comparison and discussion of the functional and formal quality properties that traditional meta-methodolo…
Collaboration within Social Dimension of Computing
2011
A proper development of computing which penetrate our society more thoroughly with the availability of broadband services is provided by varied cooperative networks. However, the success of social dimension of computing requires collaboration within a multicultural environment to be considered. Aim of the following chapter is to analyze collaboration within the social dimension of computing on the pedagogical discourse. The meaning of the key concepts of social dimension of computing, collaboration and its factors is studied within the search for the success of social dimension. The manuscript introduces the study conducted within the Baltic Summer School Technical Informatics and Informati…
Analyzing Stakeholder Diversity in G2G Efforts: Combining Descriptive Stakeholder Theory and Dialectic Process Theory
2008
Author's version of an article published in e-Service Journal, 6 (2), 3-23. Previous research indicates that the benefits of e-government initiatives are slower to realize than initially expected. This has partly been ascribed to the particularly complex settings of e-government projects, consisting of a variety of stakeholders promoting different and often conflicting objectives. Yet few studies have explicitly addressed the inherent challenges of this diversity. This study presents an analytical approach for investigating contradictory stakeholder interests by combining descriptive stakeholder theory and dialectic process theory. Descriptive stakeholder theory is concerned with why some s…
R&D subsidies & external collaborative breadth: Differential gains and the role of collaboration experience
2018
The file attached to this record is the author's final peer reviewed version. External collaboration breadth is important for firms to acquire the knowledge needed to innovate. In this paper, we combine cross-sectional and longitudinal data from the Spanish Panel of Technological Innovation Survey (PITEC) to examine the indirect impact of R&D subsidies on firm external collaboration breadth. We contribute to understanding of the indirect impacts of R&D subsidies by first providing strong evidence of an economically significant average positive impact of R&D subsidies on firm external collaboration breadth. Second, our results advance understanding of the differential impacts of R&D subsidie…
Modelling mode choice for freight transport using advanced choice experiments
2015
Abstract In this paper we use advanced choice modelling techniques to analyse demand for freight transport in a context of modal choice. To this end, a stated preference (SP) survey was conducted in order to estimate freight shipper preferences for the main attributes that define the service offered by the different transport modes. From a methodological point of view, we focus on two critical issues in the construction of efficient choice experiments. Firstly, in obtaining good quality prior information about the parameters; and secondly, in the improved quality of the experimental data by tailoring a specific efficient design for every respondent in the sample. With these data, different …
An exact method for graph coloring
2006
International audience; We are interested in the graph coloring problem. We propose an exact method based on a linear-decomposition of the graph. The complexity of this method is exponential according to the linearwidth of the entry graph, but linear according to its number of vertices. We present some experiments performed on literature instances, among which COLOR02 library instances. Our method is useful to solve more quickly than other exact algorithms instances with small linearwidth, such as mug graphs. Moreover, our algorithms are the first to our knowledge to solve the COLOR02 instance 4-Inser_3 with an exact method.
The Steiner Traveling Salesman Problem and its extensions
2019
Abstract This paper considers the Steiner Traveling Salesman Problem, an extension of the classical Traveling Salesman Problem on an incomplete graph where not all vertices have demand. Some extensions including several depots or location decisions are introduced, modeled and solved. A compact integer linear programming formulation is proposed for each problem, where the routes are represented with two-index decision variables, and parity conditions are modeled using cocircuit inequalities. Exact branch-and-cut algorithms are developed for all formulations. Computational results obtained confirm the good performance of the algorithms. Instances with up to 500 vertices are solved optimally.
General duality in vector optimization
1993
Vector minimization of a relation F valued in an ordered vector space under a constraint A consists in finding x 0 ∊ A w,0 ∊ Fx$0 such that w,0 is minimal in FA. To a family of vector minimization problemsminimize , one associates a Lagrange relation where ξ belongs to an arbitrary class Ξ of mappings, the main purpose being to recover solutions of the original problem from the vector minimization of the Lagrange relation for an appropriate ξ. This ξ turns out to be a solution of a dual vector maximization problem. Characterizations of exact and approximate duality in terms of vector (generalized with respect to Ξ) convexity and subdifferentiability are given. They extend the theory existin…
Polyhedral results for a vehicle routing problem
1991
Abstract The Vehicle Routing Problem is a well known, and hard, combinatorial problem, whose polyhedral structure has deserved little attention. In this paper we consider the particular case in which all the demands are equal (since in the general case the associated polytope may be empty). From a known formulation of the problem we obtain the dimension of the corresponding polytope and we study the facetial properties of every inequality in it.