A conceptual framework for evaluating designs for corporate innovation

Innovation is becoming mandatory for an increasing number of organizations in order to sustain competitive advantage. This paper explores how designs for corporate entrepreneurship fit within other dimensions of a strategy configuration. To do this, first, seven innovation-related problems are diagnosed. The specific problem patterns arising in three representative approaches to corporate innovation efforts (internal research and development, joint ventures, and acquisition) are discussed. Next, issues related to strategy configuration are examined. The problem-accommodating characteristics associated with specific environmental domain choices and with two routes to competitive advantage are proposed. Hypotheses that reflect the problem characteristics of innovation approaches with the problem propensities resulting from organizational choices of domain and competitive advantages are offered. Specific directions for future research, as well as the practical applications of these concepts, are discussed.     

A special combinatorial problem: pitch arrangement for pneumatic tires

In this paper, we introduce a combinatorial problem faced in the tire industry and then define it and optimize it by tabu search from the perspective of operational research. Such a problem is termed the pitch arrangement problem and involves both selecting and sequencing problems along with noninteger design variables. Pitch arrangement is an essential procedure for tires before their manufacture. Using this procedure, engineers have to choose an optimal groove distribution on tire treads for the purpose of manufacturing low-noise tires. Most research works on pitch arrangement are supported by tire companies, and their results are patented instead of being published. In this study, we define the abovementioned problem clearly and optimize it by tabu search. Two actual manufactured tires are chosen for the case studies. In addition, two patents and two types of pitch sequences optimized by genetic algorithms are also applied to these two tires for comparison. The pitch arrangement is optimized successfully and the performance of tabu search is found to be outstanding.     

A combinatorial proof for the circular chromatic number of Kneser graphs

Chen (J Combin Theory A 118(3):1062–1071, 2011) confirmed the Johnson–Holroyd–Stahl conjecture that the circular chromatic number of a Kneser graph is equal to its chromatic number. A shorter proof of this result was given by Chang et al. (J Combin Theory A 120:159–163, 2013). Both proofs were based on Fan’s lemma (Ann Math 56:431–437, 1952) in algebraic topology. In this article we give a further simplified proof of this result. Moreover, by specializing a constructive proof of Fan’s lemma by Prescott and Su (J Combin Theory A 111:257–265, 2005), our proof is self-contained and combinatorial.     

A combinatorial proof of the cyclic sieving phenomenon for faces of Coxeterhedra

For a Coxeter system (W,S), the subgroup W _J generated by a subset J?S is called a parabolic subgroup of W. The Coxeterhedron PW associated to (W,S) is the finite poset of all cosets {wW _J } _w∈W,J?S of all parabolic subgroups of W, ordered by inclusion. This poset can be realized by the face lattice of a simple polytope, constructed as the convex hull of the orbit of a generic point in ? ⁿ under an action of the reflection group W. In this paper, for the groups W=A _n?1, B _n and D _n in a case-by-case manner, we present an elementary proof of the cyclic sieving phenomenon for faces of various dimensions of PW under the action of a cyclic group generated by a Coxeter element. This result provides a geometric, enumerative and combinatorial approach to re-prove a theorem in Reiner et al. (J. Comb. Theory, Ser. A 108:17–50, 2004). The original proof is proved by an algebraic method that involves representation theory and Springer’s theorem on regular elements.     

A managerial assessment of the waiting-time performance for alternative service process designs

The paper develops an analytical model and, by applying it to a set of service process design alternatives, demonstrates the potential impact of process design on customer waiting-time performance. In doing so, it provides managers with some general tools and insights they can use in choosing the better service process design, adapting to changes in demand, and evaluating the impact of new technology application to the service process. It makes a case for flexibility in designing service processes by demonstrating that optimality of a design can depend on system parameter values. The various applications of this model and research findings can serve as guidelines for managers to use in designing their service processes so as to better serve their customers.     

A combinatorial model and algorithm for globally searching community structure in complex networks

Community structure is one of the important characteristics of complex networks. In the recent decade, many models and algorithms have been designed to identify communities in a given network, among which there is a class of methods that globally search the best community structure by optimizing some modularity criteria. However, it has been recently revealed that these methods may either fail to find known qualified communities (a phenomenon called resolution limit) or even yield false communities (the misidentification phenomenon) in some networks. In this paper, we propose a new model which is immune to the above phenomena. The model is constructed by restating community identification as a combinatorial optimization problem. It aims to partition a network into as many qualified communities as possible. This model is formulated as a linear integer programming problem and its NP-completeness is proved. A qualified min-cut based bisecting algorithm is designed to solve this model. Numerical experiments on both artificial networks and real-life complex networks show that the combinatorial model/algorithm has promising performance and can overcome the limitations in existing algorithms.     

A class of error-correcting pooling designs over complexes

As a generalization of d ^e -disjunct matrices and (w,r;d)-cover-free-families, the notion of (s,l) ^e -disjunct matrices is introduced for error-correcting pooling designs over complexes (or set pooling designs). We show that (w,r,d)-cover-free-families form a class of (s,l) ^e -disjunct matrices. Moreover, a decoding algorithm for pooling designs based on (s,l) ^e -disjunct matrices is considered.     

A general space-time model for combinatorial optimization problems (and not only)

We consider the problem of defining a strategy consisting of a set of facilities taking into account also the location where they have to be assigned and the time in which they have to be activated. The facilities are evaluated with respect to a set of criteria. The plan has to be devised respecting some constraints related to different aspects of the problem such as precedence restrictions due to the nature of the facilities. Among the constraints, there are some related to the available budget. We consider also the uncertainty related to the performances of the facilities with respect to considered criteria and plurality of stakeholders participating to the decision. The considered problem can be seen as the combination of some prototypical operations research problems: knapsack problem, location problem and project scheduling. Indeed, the basic brick of our model is a variable x_ilt which takes value 1 if facility i is activated in location l at time t, and 0 otherwise. Due to the conjoint consideration of a location and a time in the decision variables, what we propose can be seen as a general space-time model for operations research problems. We discuss how such a model permits to handle complex problems using several methodologies including multiple attribute value theory and multiobjective optimization. With respect to the latter point, without any loss of the generality, we consider the compromise programming and an interactive methodology based on the Dominance-based Rough Set Approach. We illustrate the application of our model with a simple didactic example.     

A certifying algorithm for lattice point feasibility in a system of UTVPI constraints

This paper is concerned with the design and analysis of a certifying algorithm for checking the lattice point feasibility of a class of constraints called unit two variable per inequality (UTVPI) constraints. A UTVPI constraint has at most two non-zero variables and the coefficients of the non-zero variables belong to the set \(\{+\,1,\ -\,1\}\). These constraints occur in a number of application domains, including but not limited to program verification, abstract interpretation, and operations research. As per the literature, the fastest known model generating algorithm for checking lattice point feasibility in UTVPI constraint systems runs in \(O(m \cdot n+n^{2} \cdot \log n)\) time and \(O(n^{2})\) space, where m represents the number of constraints and n represents the number of variables in the constraint system (Lahiri and Musuvathi, in: Proceedings of the 5th  international workshop on the frontiers of combining systems (FroCos), lecture notes in computer science, vol 3717, pp 168–183, 2005). In this paper, we design and analyze a new algorithm for checking the lattice point feasibility of UTVPI constraints. The presented algorithm runs in \(O(m \cdot n)\) time and \(O(m+n)\) space. Additionally it is certifying in that it produces a satisfying assignment in the event that it is presented with feasible instances and refutations in the event that it is presented with infeasible instances. The importance of providing certificates cannot be overemphasized, especially in mission-critical applications. Our approaches for the lattice point feasibility problem in UTVPI constraint systems is fundamentally different from existing approaches for this problem; indeed, it is based on new insights into combining well-known inference rules for these systems.     

A two-stage approach for surgery scheduling

A scheduling theory model is applied to study surgery scheduling in hospitals. If a surgical patient is regarded as a job waiting to be processed, and the related surgeons, anesthesiologists, nurses and surgical equipment as machines that are simultaneously needed for the processing of job, then the surgery scheduling can be described as a parallel machines scheduling problem in which a job is processed by multiple machines simultaneously. We adopt the two-stage approach to solve this scheduling problem and develop a computerized surgery scheduling system to handle such a task. This system was implemented in the Shanghai First People’s Hospital and increased the quantity of average monthly finished operations by 10.33 %, the utilization rate of expensive equipment by 9.66 % and the patient satisfaction degree by 1.12 %, and decreased the average length of time that patients wait for surgery by 0.46 day.     

模糊应急系统组合优化方案选择问题的研究

本文讨论有资源需求约束的多出救点应急组合调度方案的求取问题.受许多因素影响,平息事故所需的应急资源量有时是不确定的,通过引入模糊集的概念,从决策者的角度,任何方案的应急资源数量都对应一个需求约束满意度.另一方面,应急问题客观上要求方案的应急开始时间尽可能早,这样,任一方案又对应一个时间约束满意度.通过运用模糊优化的技术方法,本文给出了该问题的优化模型及相应求解方法.并且,考虑到方案稳定性或费用,文中的算法解是所有最大满意度方案中出救点数目最少的.     

A graph coloring approach for image segmentation

In this paper we develop a segmentation scheme for digital images based upon an iterative binary coloring technique that takes into account changing behavior of adjacent pixels. The output is a hierarchical structure of images which allows a better understanding of complex images. In particular, we propose two algorithms that should be considered as image preprocessing techniques.     

A specific accounting approach for public universities

Many universities in Germany and other countries have introduced financial (or commercial) accounting to manage effectively their finances. It aligns with so-called new public sector management reforms worldwide. In this paper we analyze whether the components of this type of financial accounting reform suit the nature and objectives of German public universities. While the analysis mainly relates to the German situation, there are likely to be implications for public universities universally. Drawing on an analysis of the reports of two well known German-speaking universities, Heidelberg and Vienna, we analyze whether the components of the new financial accounting reforms suit the nature and objectives of those public universities. While we argue that cash-flow statements and balance sheets remain important, it is shown that it is necessary for state-run educational institutions to change several key elements of traditional commercial accounting. Because the success goals of such universities are non-profit-oriented, their financial accounting should be augmented by a ‘change in value statement’, replacing the traditional income statement. As their valuation cannot be correlated with the definition of profit in (German) public universities this term is suggested. By change in value we mean specifically that assets may experience a total loss or a decrease in value. In management accounting output measures and performance indicators should substitute revenues as the counterpart of costs. Furthermore, long-term financial decisions play a crucial role in universities. Therefore, a form of investment accounting is very important for them. The conventional form has to be modified by ‘investment statements’ and ‘knowledge balances’ of their intellectual capital. In this paper we also show how the concept of a balanced scorecard can be applied to public universities and how specific accounting instruments can be integrated into it.     

A multi-criteria approach for managing inter-enterprise collaborative relationships

Collaboration amongst enterprises is a common strategy used to increase competitiveness. Thus, enterprises that are collaborating need to define and use performance measurement/management frameworks composed of performance elements (objectives, performance indicators, etc.) that facilitate the management of their activity, as well as monitor their strategy and processes. There are many factors, e.g. trust, interoperability of Information Systems, etc. that need to be managed properly in order to support collaborative success. However, such factors and performance are not usually managed together. Furthermore, these factors and performance elements are interrelated but these influences are commonly overlooked. This paper aims to present an approach based on the Analytic Network Process (ANP) to manage collaborative relationships under an integrated approach by considering not only the inter-enterprise performance elements, but also the factors that influence collaboration. The approach is then applied to a collaborative enterprise network belonging to the renewable energy sector. With this innovative approach, enterprises will obtain significant information for the decision-making process, regarding which are the factors and performance elements that have the greatest impact on their competitiveness, and therefore should be prioritized.     

A minimized-rule based approach for improving data currency

Repairing obsolete data items to the up-to-date values faces great challenges in the area of improving data quality. Previous methods of data repairing are based on either quality rules or statistical techniques, but both of the two types of methods have their limitations. To overcome the shortages of the previous methods, this paper focuses on combining quality rules and statistical techniques to improve data currency. (1) A new class of currency repairing rules (CRR for short) is proposed to express both domain knowledge and statistical information. Domain knowledge is expressed by the rule pattern, and the statistical information is described by the conditional probability distribution corresponding to each rule. (2) The problem of generating minimized CRRs is studied in both static and dynamic world. In the static world, the problem of generating minimized CRR patterns is proved to be NP-hard, and two approximate algorithms are provided to solve the problem. In dynamic world, methods are provided to update the CRRs without recomputing the whole CRR set in case of data being changed. In some special cases, the updates can be finished in \(O(1)\) time. In both cases, the methods for learning conditional probabilities for each CRR pattern are provided. (3) Based on the CRRs, the problems of finding optimal repairing plans with and without cost budget is studied, and methods are provided to solve them. (4) The experiments based on both real and synthetic data sets show that the proposed methods are efficient and effective.     

A data envelopment analysis approach for ranking journals

We create a data envelopment analysis (DEA) model to rank business journals, using data from the Thomson Reuters Journal Citation Reports^® (JCR). As opposed to previous models that ranked journals in only one field and mostly relied on survey data, this model is used to rank 358 business journals from five different JCR categories according to such citation-based factors as the number of articles, the number of citations, impact factor, five-year impact factor, immediacy index, eigenfactor score, and article influence score. We compute relative efficiencies of the journals and thereby create plausible journal rankings that largely, but not completely, corroborate three widely used business publication journal ranking lists. In addition, we show how the different characteristics of the JCR data impact the DEA ranking model. Finally, we identify journals that are not on the business publication lists but consistently perform very well relative to those benchmark journals, and should possibly be included in the business publication ranking lists. We also identify journals whose inclusion in widely used business publication rankings cannot be justified by our methodology.     

A network DEA approach for series multi-stage processes

We present in this paper a general network DEA approach to deal with efficiency assessments in multi-stage processes. Our approach complies with the composition paradigm, where the efficiencies of the stages are estimated first and the overall efficiency of the system is obtained ex post. We use multi-objective programming as modeling framework. This provides us the means to assess unique and unbiased efficiency scores and, if required, to drive the efficiency assessments effectively in line with specific priorities given to the stages. A direct comparison with the multiplicative decomposition approach on data drawn from the literature brings into light the advantages of our method and some critical points that one should be concerned about when using the multiplicative efficiency decomposition.     

Evolution of strategic management: The need for new dominant designs

The development of strategic management is explained from an evolutionary perspective on the basis of cycles of variation, selection and retention. In industry, breakthrough innovations, or technological discontinuities, initiate eras of ferment that end when a generally accepted standard, or dominant design, starts an era of incremental change. In strategic management, the original definition of strategy initiated an era of ferment characterized by a focus on the environment. The attention to the environment of firms and the integration with other areas of inquiry reached a point of maturity with development of a widely accepted model for analyzing industry and with the definition of generic strategies. The resource-based view of the firm created a new era of ferment by affirming that the main sources of sustainable competitive advantages reside in the development and use of valuable resources. A new period, marked by swift advances in technology and increasingly blurred boundaries among industries, markets and competitors as well as diverse and more complex sources of competitive advantages, imposes on scholars and practitioners an imperative need to conceive new dominant designs. This paper illustrates the evolution toward new directions and challenges of creating new dominant paradigms in strategic management that revolve around the concepts of knowledge, learning, and innovation.     

New organizational designs for promoting creativity: A case study of virtual teams with anonymity and structured interactions

Companies organize teams to enhance creativity and innovation. Creativity refers to the generation of new and novel ideas, whereas innovation encompasses both idea generation and the commercialization of these ideas to add value to the enterprises. Standard teams are those, wherein participants meet face-to-face to develop new ideas and/or to commercialize them. Asynchronous virtual teams are those which allow participants to interact via digital means without face-to-face meetings. Asynchronous virtual teams are especially convenient for participants at global locations.The objective of this paper is to outline a third kind of teams, the virtual teams with anonymity and structured interactions (VTASIs), in which participants remain anonymous, follow a modified Delphi brainstorming process, communicate with one another asynchronously via electronic means, apply a set of streamlined idea generation strategies (the Combinatorial Heuristic and Normatively Generic Method), and conduct multiple rounds of structured interactions under the guidance of a knowledgeable team leader. Individual team member works alone, yet interacts indirectly with all others in a group setting.After having briefly reviewed the factors that are known to constraint the performance of both the standard and asynchronous virtual teams, this paper describes a study conducted in Spring 2009 Semester at University at Buffalo, involving eight VTASI teams of a total of 72 graduate engineering students who worked on generating new ideas for improving four specific projects. Key results are discussed.For global operations, the asynchronous virtual teams represent an improvement over the standard teams in terms of reach, costs, and execution. The VTASI teams advocated in this paper represent yet a further improvement over the Asynchronous virtual teams, and hold promise to be the most effective among the three types of teams in promoting creativity.     

Approximation algorithms for constructing required subgraphs using stock pieces of fixed length

Journal of Combinatorial Optimization - In this paper, we address the problem of constructing required subgraphs using stock pieces of fixed length (CRS-SPFL, for short), which is a new variant of...