A column generation approach for the timetabling problem of Greek high schools

A column generation (CG) approach for the solution of timetabling problems is presented. This methodology could be used for various instances of the timetabling problem, although in this paper the solution of the high-school situation in Greece is presented. The results obtained show clearly that the CG approach that has been extremely successful in recent years in the solution of airline crew scheduling problems could also be very efficient and robust for the solution of timetabling problems. Several large timetabling problems corresponding to real problems have been successfully solved, with the solutions obtained feasible and of very high quality in accordance with the problem definition. In addition, none of the solutions contained any idle hour for any of the teachers, which was one of the main goals of this optimization effort.     

Die Entwicklung kausaler Hypothesen in der qualitativen Sozialforschung

The disregard of causal inference in the methodological literature about qualitative research is highly problematic, since the category of causality is closely linked to the concept of social action. However, it is also clear that causal analysis is burdened with certain difficulties and methodological challenges in the realm of social research. Some of these problems are discussed in this article using Mackie—s concept of 3 “INUS”-conditions. Thereby it will be shown that strategies of causal analysis based on comparative methods proposed for qualitative research, namely “Analytic Induction” and “Qualitative Comparative Analysis” have great difficulties in dealing adequately with these problems. They can only be solved, if case-comparative methods are combined with explorative research strategies which support the researcher in gaining access to the local knowledge of the research field.     

Covalent functionalization of multi-walled carbon nanotubes by lipase

Lipase from Candida rugosa was covalently anchored onto acid-treated multi-walled carbon nanotubes (MWNTs) through a self-catalytic mechanism. A variety of characterization techniques including FTIR, Raman spectroscopy, and XPS were employed to demonstrate the formation of the ester linkage between lipase and MWNTs. The MWNTs-lipase biocomposites showed significantly increased solubility in some common-used organic solvents, such as THF, DMF and chloroform. This study may offer a novel and facile route for covalent modification of carbon nanotubes, and expand the potential utilization of both lipases and MWNTs in the fields of biocatalyst and biosensor.     

Dihedral crossed products of exponent 2 are abelian

We prove that assuming enough roots of unity in the base field, a central simple algebra of exponent 2 which is split by a dihedral group, is also split by certain abelian groups.     

Algorithms for ham-sandwich cuts

Given disjoint setsP ₁,P ₂, ...,P _d inR ^d withn points in total, ahamsandwich cut is a hyperplane that simultaneously bisects theP _i . We present algorithms for finding ham-sandwich cuts in every dimensiond>1. Whend=2, the algorithm is optimal, having complexityO(n). For dimensiond>2, the bound on the running time is proportional to the worst-case time needed for constructing a level in an arrangement ofn hyperplanes in dimensiond−1. This, in turn, is related to the number ofk-sets inR ^d−1 . With the current estimates, we get complexity close toO(n ^3/2 ) ford=3, roughlyO(n ^8/3 ) ford=4, andO(n ^d−1−a(d) ) for somea(d)>0 (going to zero asd increases) for largerd. We also give a linear-time algorithm for ham-sandwich cuts inR ³ when the three sets are suitably separated. A preliminary version of the results of this paper appeared in [16] and [17]. Part of this research by J. Matoušek was done while he was visiting the School of Mathematics, Georgia Institute of Technology, Atlanta, and part of his work on this paper was supported by a Humboldt Research Fellowship. W. Steiger expresses gratitude to the NSF DIMACS Center at Rutgers, and his research was supported in part by NSF Grants CCR-8902522 and CCR-9111491.     

A Note on an Input Control Model of a Predictive Regression Interval

A well-known problem of prediction in linear regression models is to find a confidence interval for the random value of the dependent variable when the values of the independent variables are given. Such a situation may arise in economic quality control models when the independent variables are costly inputs and the dependent variable is some measure of quality or production. In such a circumstance, an important control objective may be to find values for the inputs that will maximize the lower limit of the prediction confidence interval for a fixed budget, or alternatively, to minimize the cost of the inputs for a fixed lower limit of the confidence interval. In this paper, we shall show that global optima can be found using known algorithms. The special case of simple linear regression is discussed and an illustrative example is provided.     

A characterization of certain irreducible symplectic 4-folds

 We give a characterization of irreducible symplectic fourfolds which are given as Hilbert scheme of points on a K3 surface. Received: 26 June 2002 / Revised version: 9 September 2002 Published online: 14 February 2003 Mathematics Subject Classification (2000): Primary 14J32, Secondary 32Q20