Routines in International Business: A semi-systematic review of the concept

Routines are a crucial element in different streams of International Business (IB) research. This semi-systematic review examines articles published in top-ranked IB journals to analyze how the concept routines is used, in order to provide orientations for future research in the field. A systematic search process in three databases, followed by inductive text analysis and a cluster analysis, identifies three distinct research streams on routines in International Business: Global strategy, international organizational learning, and internationalization processes. A comprehensive analysis of the use of the concept in IB is presented by documenting qualities, types, dimensions, antecedents, and consequences of routines in the extant research. We integrate the fragmented and often implicit aspects ascribed to routines in IB research, so that future research can draw upon a defragmented, synthesized, and clarified concept. Opportunities for future contributions are highlighted in five broad areas: hierarchy and order in the MNE; agents, context, and time; distributing routines; distributed routines; and the non-routine.     

The paths embedding of the arrangement graphs with prescribed vertices in given position

Let n and k be positive integers with n?k≥2. The arrangement graph A _n,k is recognized as an attractive interconnection networks. Let x, y, and z be three different vertices of A _n,k . Let l be any integer with $d_{A_{n,k}}(\mathbf{x},\mathbf{y}) \le l \le \frac{n!}{(n-k)!}-1-d_{A_{n,k}}(\mathbf{y},\mathbf{z})$ . We shall prove the following existance properties of Hamiltonian path: (1)?for n?k≥3 or (n,k)=(3,1), there exists a Hamiltonian path R(x,y,z;l) from x to z such that d _R(x,y,z;l)(x,y)=l; (2) for n?k=2 and n≥5, there exists a Hamiltonian path R(x,y,z;l) except for the case that x, y, and z are adjacent to each other.     

Are there more almost separable partitions than separable partitions?

A partition of a set of n points in d-dimensional space into p parts is called an (almost) separable partition if the convex hulls formed by the parts are (almost) pairwise disjoint. These two partition classes are the most encountered ones in clustering and other partition problems for high-dimensional points and their usefulness depends critically on the issue whether their numbers are small. The problem of bounding separable partitions has been well studied in the literature (Alon and Onn in Discrete Appl. Math. 91:39–51, 1999; Barnes et al. in Math. Program. 54:69–86, 1992; Harding in Proc. Edinb. Math. Soc. 15:285–289, 1967; Hwang et al. in SIAM J. Optim. 10:70–81, 1999; Hwang and Rothblum in J. Comb. Optim. 21:423–433, 2011a). In this paper, we prove that for d≤2 or p≤2, the maximum number of almost separable partitions is equal to the maximum number of separable partitions.     

An extension of Stein-Lovász theorem and some of its applications

The Stein-Lovász theorem provides an algorithmic way to deal with the existence of certain good coverings, and thus offers bounds related to some combinatorial structures. An extension of the classical Stein-Lovász theorem for multiple coverings is given, followed by some applications for finding upper bounds of the sizes of (d,s out of r;z]-disjunct matrices and (k,m,c,n;z)-selectors, respectively. This gives a unified treatment for some previously known results relating to various models of group testing.     

The role of small firms in the emergence of new technologies

It is clear from research policy statements throughout Europe and in the USA and Japan that governments are becoming increasingly interested in the well-being of small firms. This is based on a belief in their ability to generate employment, their potential for the industrial regeneration of the so-called development areas and their ability to produce technological innovations. It is to this latter issue—the innovation potential of small firms—that this article is addressed. Further, while most studies of the role of small firms in innovation have been concerned with ‘innovation counts’ and have adopted a rather static approach, we are here concerned with their role in the dynamics of the introduction and diffusion of new technologies, specifically semiconductors and computer aided design (CAD). Moreover, there has in the past been a tendency to emphasize the role of the small firms or the role of large firms in innovation; we reject this rather sterile view and demonstrate the interrelationship between the two. In both areas—semiconductors and CAD—the initial breakthroughs were made in the R&D laboratories of large companies which produced components and equipment for their own use; it was through the actions of new technology-based small firms that these innovations were diffused into more general use. Again in both cases, the basic technological know-how, the entrepreneurs themselves and often the risk capital, derived from the original innovating large companies. Thus, policies that do not take into account the dynamic complementarities between the large and the small clearly are of only limited utility.     

Is there potential in assessing for high-potential? Evaluating the relationships between performance ratings,leadership assessment data,designated high-potential status and promotion outcomes in a global organization

While leadership is a critical component of organizational success, organizations need to be more effective at classifying talent based on future potential vs current performance. This need raises the question as to whether the assessment of leadership potential is truly adding value or enhancing the talent review and classification process. Data from 9,784 participants in PepsiCo’s Leadership Assessment and Development (LeAD) program—a multi-trait, multi-method (MTMM) assessment and development process—are used to examine relationships between individual performance, assessed potential, organizationally designated potential, and promotion rates post assessment. Results from the analyses indicate that assessed potential provides unique variance above performance alone in determining process outcomes (i.e., designated potential and promotions), and therefore can be useful for making more informed talent management decisions. The applications of these measures within the current organization as well as limitations of the study and areas for future research are discussed.     

The subdivision-constrained routing requests problem

We are given a digraph D=(V,A;w), a length (delay) function w:A→R ⁺, a positive integer d and a set $\mathcal{P}=\{(s_{i},t_{i};B_{i}) | i=1,2,\ldots,k\}$ of k requests, where s _i ∈V is called as the ith source node, t _i ∈V is called the ith sink node and B _i is called as the ith length constraint. For a given positive integer d, the subdivision-constrained routing requests problem (SCRR, for short) is to find a directed subgraph D′=(V′,A′) of D, satisfying the two constraints: (1) Each request (s _i ,t _i ;B _i ) has a path P _i from s _i to t _i in D′ with length $w(P_{i})=\sum_{e\in P_{i}} w(e)$ no more than B _i ; (2) Insert some nodes uniformly on each arc e∈A′ to ensure that each new arc has length no more than d. The objective is to minimize the total number of the nodes inserted on the arcs in A′. We obtain the following three main results: (1) The SCRR problem is at least as hard as the set cover problem even if each request has the same source s, i.e., s _i =s for each i=1,2,…,k; (2) For each request (s,t;B), we design a dynamic programming algorithm to find a path from s to t with length no more than B such that the number of the nodes inserted on such a path is minimized, and as a corollary, we present a k-approximation algorithm to solve the SCRR problem for any k requests; (3) We finally present an optimal algorithm for the case where $\mathcal{P}$ contains all possible requests (s _i ,t _i ) in V×V and B _i is equal to the length of the shortest path in D from s _i to t _i . To the best of our knowledge, this is the first time that the dynamic programming algorithm within polynomial time in (2) is designed for a weighted optimization problem while previous optimal algorithms run in pseudo-polynomial time.     

The role of weighting in corporate governance ratings

This methodological paper highlights the differences and the resulting implications from the application of the three most commonly applied weighting index methods to measuring corporate governance quality at an aggregate level: the Dichotomous; the partial compliance (PC) unweighted; and the Experts’ methods. In particular, first, we demonstrate how each method is applied and provide the details needed for readers to replicate each method. Second, we employ these methods on a sample of companies and compare the corresponding scores by testing their differences statistically. Third, as an indicative example of the potential implications arising from the use of these measures, we test whether the relation between market value and corporate governance levels differs, depending on the method applied. We find that the three methods produce significantly different overall and relative (i.e., ranking order) scores and, consequently, the relation between market value and corporate governance levels differs, depending on the method applied. Thus, we contribute to the corporate governance literature by showing that weighting in corporate governance indices matters and we recommend simultaneous application of at least two methods (i.e., the PC unweighted and the Experts’ methods) for deriving robust findings.     

Programme budgeting in the health sector

The growth of the public sector has been accompanied by an increased interest in this sector among economists and non-economists alike. Much of this interest has been directed towards the overall size of the public sector, and the efficient allocation of resources within the public sector has remained comparatively neglected. This paper outlines some of the problems of resource allocation facing decision-makers in the public sector, and reviews the actual and potential uses of one decision-making tool—programme budgeting—in improving resource allocation. The health care sector is chosen to illustrate the technique of programme budgeting, the practical and conceptual problems of implementation, and the limitations as well as the possibilities offered by this approach.     

Internationalization,Innovation and Institutions: The 3 I's Underpinning the Competitiveness of Emerging Market Firms

The past decade has seen an increase in the extent of research focused on and around emerging market firms (EMFs) and their rising levels of competitiveness in both their home markets and more importantly in the global market place. At the same time, the practitioner-oriented literature has been documenting a growing number of corporate success stories that originate in emerging market economies. We posit that the growing prominence of EMFs is a result of three interrelated phenomena: the fast-paced internationalization of EMFs into both developing and developed market economies; the rapidly increasing extent to which business enterprises in emerging economies are focusing on knowledge-intensive processes and innovation; and the continuous evolution of institutions in these markets, particularly in terms of economic liberalization.     

„Ich lade Sie ein, in die Kloake zu springen“

Language users use their language experienced and automatically. They do not have to think about the meaning of what they have said, as the respective conversational context generally guarantees communication. This also applies—it seems—to the advisory context. The following article exemplifies single word analyses of the frequently used German verbs anbieten (en. offer) and einladen (en. invite), allowing a different perspective to advisory language. Very often, historical roots and the centuries-long development of word usage offer the key to the words’ use and function in the advisory context, thus inspiring a (more) conscious observation of language and a different language comprehension.     

Using Sustainable Production Indicators to Measure Progress in ISO 14001, EHS System and EPA Achievement Track

This case study presents results from testing a new tool — indicators of sustainable production (ISPs) — at Acushnet Rubber of New Bedford, Massachusetts. The authors demonstrate how the tool can be used to measure continual improvement and how it fits within the current system for reporting compliance to regulations; and performance under ISO 14001 (environmental management system standard), the environmental, health and safety (EHS) system, and EPA Achievement Track.Developed at the Lowell Center for Sustainable Production (LCSP), this tool includes both core (common for all companies) and supplemental (production-specific) indicators, and aims to raise awareness, support decision-making, and promote continuous improvement toward sustainability. Indicators such as energy use, water use, global warming potential, lost work time case rate, turnover rate, community spending and charitable contributions, among others, were tested at both facility and corporate levels. Results showed the company's progress in EHS as well as the areas that need improvement. The paper concludes with a summary of key lessons learned and recommendations for further use of the tool.     

Cultural intelligence: An identity lens on the influence of cross-cultural experience

Cultural intelligence (CQ) is an increasingly valuable asset for managers, employees, entrepreneurs, and their organizations. While there is now considerable evidence for its benefits, knowledge remains cloudy surrounding its antecedents. Drawing on identity theory, we develop a model unpacking the relationship between cross-cultural experience—a core antecedent with mixed findings in extant research—and CQ. We advance multicultural identity as a pivotal intervening variable and probe the role of self-verification striving as an identity-based boundary condition. Across two interlocking studies, we find evidence for how CQ can be cultivated from a range of increasingly common forms of cross-cultural experiences. In doing so, we shed light on the mixed results in prior research and provide key implications for future research; namely, multicultural identity helps to better account for when and how individuals translate their cross-cultural experiences into CQ.     

Reflections on knowledge-based approaches to the organization of production

Knowledge-based approaches to the firm offer valuable insights into some of the central issues of governance and organizational design—especially into long neglected problems of coordination. I start from the assumption that the fundamental problem of economic organization is reconciling efficiency in knowledge development with efficiency in knowledge application. The paper extends the knowledge-based view of the firm and knowledge integration approach to organizational capability that I outlined in earlier papers (Grant in Strategic Management Journal, 1996a; Grant in Journal of Management Studies 7(4)375–387, 1996b) and draws upon subsequent contributions to the literature. From this basis, I derive implications for the relative efficiencies of alternative institutions of economic organization and for the design of firm structures.     

An improved parameterized algorithm for the <Emphasis Type="Italic">p</Emphasis>-cluster vertex deletion problem

In the p-Cluster Vertex Deletion problem, we are given a graph \(G=(V,E)\) and two parameters k and p, and the goal is to determine if there exists a subset X of at most k vertices such that the removal of X results in a graph consisting of exactly p disjoint maximal cliques. Let \(r=p/k\). In this paper, we design a branching algorithm with time complexity \(O(\alpha ^k+|V||E|)\), where \(\alpha \) depends on r and has a rough upper bound \(\min \{1.618^{1+r},2\}\). With a more precise analysis, we show that \(\alpha =1.28\cdot 3.57^{r}\) for \(r\le 0.219\); \(\alpha =(1-r)^{r-1}r^{-r}\) for \(0.219< r<1/2\); and \(\alpha =2\) for \(r\ge 1/2\), respectively. Our algorithm also works with the same time complexity for the variant that the number of clusters is at most p. Our result improves the previous best time complexity \(O^*(1.84^{p+k})\) and implies that for fixed p the problem can be solved as efficiently as Vertex Cover.     

A model of e-commerce use by internationalizing SMEs

Globalization and e-commerce pose new challenges and provide new competitive opportunities, especially for small- and medium-sized enterprises (SMEs) seeking to broaden their involvement into new international markets. Yet, SMEs are only beginning to embrace these new opportunities. The authors derive a model describing the use of e-commerce by internationalizing SMEs, developed by integrating findings from case studies of 12 Canadian SMEs exporting to Japan with a broad range of management theories. The cases represent two very different sectors: hospitality/tourism and high tech. The research first describes how the firms use e-commerce internationally, by examining resource commitment, web function and cultural adaptation. It then explains why the firms use e-commerce, by relating two types of environmental variables — market changes and industry norms — and three firm factors — technical capability, cultural capability and firm size — to the firms' adoption of e-commerce. Implications for SME managers are discussed and nine propositions are put forth to guide and focus future research.     

Towards the price of leasing online

We consider online optimization problems in which certain goods have to be acquired in order to provide a service or infrastructure. Classically, decisions for such problems are considered as final: one buys the goods. However, in many real world applications, there is a shift away from the idea of buying goods. Instead, leasing is often a more flexible and lucrative business model. Research has realized this shift and recently initiated the theoretical study of leasing models (Anthony and Gupta in Proceedings of the integer programming and combinatorial optimization: 12th International IPCO Conference, Ithaca, NY, USA, June 25–27, 2007; Meyerson in Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 23–25 Oct 2005, Pittsburgh, PA, USA, 2005; Nagarajan and Williamson in Discret Optim 10(4):361–370, 2013) We extend this line of work and suggest a more systematic study of leasing aspects for a class of online optimization problems. We provide two major technical results. We introduce the leasing variant of online set multicover and give an \(O\left( \log (mK)\log n\right) \)-competitive algorithm (with n, m, and K being the number of elements, sets, and leases, respectively). Our results also imply improvements for the non-leasing variant of online set cover. Moreover, we extend results for the leasing variant of online facility location. Nagarajan and Williamson (Discret Optim 10(4):361–370, 2013) gave an \(O\left( K\log n\right) \)-competitive algorithm for this problem (with n and K being the number of clients and leases, respectively). We remove the dependency on n (and, thereby, on time). In general, this leads to a bound of \(O\left( l_{\text {max}} \log l_{\text {max}} \right) \) (with the maximal lease length \(l_{\text {max}} \)). For many natural problem instances, the bound improves to \(O\left( K^2\right) \).     

Separating NE from some nonuniform nondeterministic complexity classes

We investigate the question whether NE can be separated from the reduction closures of tally sets, sparse sets and NP. We show that (1) \(\mathrm{NE}\not\subseteq R^{\mathrm{NP}}_{n^{o(1)}-T}(\mathrm{TALLY})\); (2) \(\mathrm{NE}\not\subseteq R^{SN}_{m}(\mathrm{SPARSE})\); (3) \(\mathrm{NEXP}\not\subseteq \mathrm{P}^{\mathrm{NP}}_{n^{k}-T}/n^{k}\) for all k≥1; and (4) \(\mathrm{NE}\not\subseteq \mathrm{P}_{btt}(\mathrm{NP}\oplus\mathrm{SPARSE})\). Result (3) extends a previous result by Mocas to nonuniform reductions. We also investigate how different an NE-hard set is from an NP-set. We show that for any NP subset A of a many-one-hard set H for NE, there exists another NP subset A′ of H such that A′? A and A′?A is not of sub-exponential density.     

Minimum common string partition revisited

Minimum Common String Partition (MCSP) has drawn much attention due to its application in genome rearrangement. In this paper, we investigate three variants of MCSP: MCSP ^c , which requires that there are at most c elements in the alphabet; d-MCSP, which requires the occurrence of each element to be bounded by d; and x-balanced MCSP, which requires the length of blocks being in range (n/k?x,n/k+x), where n is the length of the input strings, k is the number of blocks in the optimal common partition and x is a constant integer. We show that MCSP ^c is NP-hard when c≥2. As for d-MCSP, we present an FPT algorithm which runs in O ^?((d!)^2k ) time. As it is still unknown whether an FPT algorithm only parameterized on k exists for the general case of MCSP, we also devise an FPT algorithm for the special case x-balanced MCSP parameterized on both k and x.