This paper describes an approach for generating lower bounds for the curriculum-based course timetabling problem, which was presented at the International Timetabling Competition (ITC-2007, Track 3). So far, several methods based on integer linear programming have been proposed for computing...

In this paper, we investigate the agency costs of government ownership and their impact on corporate governance and firm value. China is used as a laboratory because of the prevalent state shareholdings in exchange-listed firms. In this context, we specifically consider the trade-offs involved...

This paper presents an extraction and expansion approach for the graph coloring problem. The extraction phase transforms a large graph into a sequence of progressively smaller graphs by removing large independent sets from the graph. The expansion phase starts by generating an approximate...

In this paper we consider the simpler GMRES method augmented by approximate eigenvectors for solving nonsymmetric linear systems. We modify the augmented restarted simpler GMRES proposed by Boojhawon and Bhuruth to obtain a simpler GMRES with deflated restarting. Moreover, we also propose a...

The Maximum Diversity Problem (MDP) consists in selecting a subset of m elements from a given set of n elements (nm) in such a way that the sum of the pairwise distances between the m chosen elements is maximized. We present a hybrid metaheuristic algorithm (denoted by MAMDP) for MDP. The...

The maximum clique problem (MCP) is to determine in a graph a clique (i.e., a complete subgraph) of maximum cardinality. The MCP is notable for its capability of modeling other combinatorial problems and real-world applications. As one of the most studied NP-hard problems, many algorithms are...