On the <Emphasis Type="Italic">m</Emphasis>-clique free interval subgraphs polytope: polyhedral analysis and applications

In this paper we study the m-clique free interval subgraphs. We investigate the facial structure of the polytope defined as the convex hull of the incidence vectors associated with these subgraphs. We also present some facet-defining inequalities to strengthen the associated linear relaxation. As an application, the generalized open-shop problem with disjunctive constraints (GOSDC) is considered. Indeed, by a projection on a set of variables, the m-clique free interval subgraphs represent the solution of an integer linear program solving the GOSDC presented in this paper. Moreover, we propose exact and heuristic separation algorithms, which are exploited into a Branch-and-cut algorithm for solving the GOSDC. Finally, we present and discuss some computational results.     

New lower bounds for the second variable Zagreb index

The aim of this paper is to obtain new sharp inequalities for a large family of topological indices, including the second variable Zagreb index \(M_2^{\alpha }\), and to characterize the set of extremal graphs with respect to them. Our main results provide lower bounds on this family of topological indices involving just the minimum and the maximum degree of the graph. These inequalities are new even for the Randi?, the second Zagreb and the modified Zagreb indices.     

The matching extension problem in general graphs is co-NP-complete

A simple connected graph G with 2n vertices is said to be k-extendable for an integer k with \(0<k<n\) if G contains a perfect matching and every matching of cardinality k in G is a subset of some perfect matching. Lakhal and Litzler (Inf Process Lett 65(1):11–16, 1998) discovered a polynomial algorithm that decides whether a bipartite graph is k-extendable. For general graphs, however, it has been an open problem whether there exists a polynomial algorithm. The new result presented in this paper is that the extendability problem is co-NP-complete.     

Reliability evaluation of a multicast over coded packet networks

Network coding is a generalization of conventional routing methods that allows a network node to code information flows before forwarding them. While it has been theoretically proved that network coding can achieve maximum network throughput, theoretical results usually do not consider the stochastic nature in information processing and transmission, especially when the capacity of each arc becomes stochastic due to failure, attacks, or maintenance. Hence, the reliability measurement of network coding becomes an important issue to evaluate the performance of the network under various system settings. In this paper, we present analytical expressions to measure the reliability of multicast communications in coded networks, where network coding is most promising. We define the probability that a multicast rate can be transmitted through a coded packet network under a total transmission cost constraint as the reliability metric. To do this, we first introduce an exact mathematical formulation to construct multicast connections over coded packet networks under a limited transmission cost. We then propose an algorithm based on minimal paths to calculate the reliability measurement of multicast connections and analyze the complexity of the algorithm. Our results show that the reliability of multicast routing with network coding improved significantly compared to the case of multicast routing without network coding.     

FPT-algorithms for some problems related to integer programming

This paper studies a new version of the location problem called the mixed center location problem. Let P be a set of n points in the plane. We first consider the mixed 2-center problem, where one of the centers must be in P, and we solve it in \(O(n^2\log n)\) time. Second, we consider the mixed k-center problem, where m of the centers are in P, and we solve it in \(O(n^{m+O(\sqrt{k-m})})\) time. Motivated by two practical constraints, we propose two variations of the problem. Third, we present a 2-approximation algorithm and three heuristics solving the mixed k-center problem (\(k>2\)).     

Can Private Donations Help Public Universities Build Bridges Over Troubled Waters?: Practical Lessons for Administrators and Donors

With decreasing appropriations, some public organizations seek donations, often from large donors who may want to generate a return on investment by transforming the institution. As such, an interesting question emerges about institutions’ ability to meet donors’ expectations. Long fundraising histories, combined with a political and decentralized nature, make state universities an interesting venue to study the use of donations to create institutional change. Based on two single-state case studies, this research argues that real and perceived organizational barriers must be overcome. It concludes with implications for both administrator and donors.     

Modelling period fertility: Schooling and intervals following a birth in Eastern Africa

We describe a regression-based approach to the modelling of age-, order-, and duration-specific period fertility, using retrospective survey data. The approach produces results that are free of selection biases and can be used to study differential fertility. It is applied to Demographic and Health Survey data for Ethiopia, Kenya, Tanzania, and Zimbabwe to investigate differential trends in fertility by education. Parity progression fell and the intervals following each birth lengthened between the 1970s and 2000s in all four countries. Fertility fell most among women with secondary education. In contrast to other world regions, postponement of successive births for extended periods accounted for much of the initial drop in fertility in these African countries. However, family size limitation by women with secondary education in Ethiopia and Kenya and longer birth spacing in Zimbabwe also played significant roles. Thus, birth control is being adopted in Eastern Africa in response to diverse changes in fertility preferences.     

Probabilistic population projections for countries with generalized HIV/AIDS epidemics

In 2015, the United Nations (UN) issued probabilistic population projections for all countries up to 2100, by simulating future levels of total fertility and life expectancy and combining the results using a standard cohort component projection method. For the 40 countries with generalized HIV/AIDS epidemics, the mortality projections used the Spectrum/Estimation and Projection Package (EPP) model, a complex, multistate model designed for short-term projections of policy-relevant quantities for the epidemic. We propose a simpler approach that is more compatible with existing UN projection methods for other countries. Changes in life expectancy are projected probabilistically using a simple time series regression and then converted to age- and sex-specific mortality rates using model life tables designed for countries with HIV/AIDS epidemics. These are then input to the cohort component method, as for other countries. The method performed well in an out-of-sample cross-validation experiment. It gives similar short-run projections to Spectrum/EPP, while being simpler and avoiding multistate modelling.     

Coopetition in coworking-spaces: value creation and appropriation tensions in an entrepreneurial space

Coopetition has the potential to improve entrepreneurship and innovation. It will be prevalent in coworking-spaces building a growing field for individual and corporate entrepreneurship. The individuals’ physical closeness in the professional and social space of the coworking-space eases multifaceted transfers of explicit and implicit knowledge, stimulating creation, transfer, overhaul, and implementation of entrepreneurial ideas. While entrepreneurs in these coworking-spaces collaborate on sharing knowledge and resources and on finding creative ideas from which can breed new venture concepts, they simultaneously compete on the appropriation of values. Thus, entrepreneurs in coworking-spaces face coopetitive tensions of creating and appropriating the values. Based  on  interview data and secondary sources, this paper explains four different prototype institutions of coworking-spaces: the corporate coworking-space, the open corporate coworking-space, the consultancy coworking-space, and the independent coworking-space. Study explains different tensions of value creation and appropriation that occur within the coopetition in the different forms of coworking-spaces.