The part families with precedence constraints problem (PFP) arises in industry, when flexible manufacturing systems are designed within a group technology approach. The aim of this problem is to arrange parts into families by imposing capacity constraints, concerning both the number of parts and processing times, besides precedence constraints in the building of families. Mixed binary linear pr...

There is a great resolution calling for smart grids in recent years. Introduction of new technologies, that make the network flexible and controllable, is a main part of smart grid concept and a key factor to its success. Transmission network as a part of system network has drawn less attention. Transmission switching as a transmission service can release us from load shedding and remove the co...

Optimal load of mobile robots, while carrying a load with predefined motion precision is an important consideration regarding their applications. In this paper a general formulation for finding maximum load carrying capacity of flexible joint mobile manipulators is presented. Meanwhile, overturning stability of the system and precision of the motion on the given end-effector trajectory are take...

Complete row and column symmetry breaking in constraint models using the lex leader method is generally prohibitively costly. Double lex, which is derived from lex leader, is commonly used in practice as an incomplete symmetrybreaking method for row and column symmetries. Double lex is based on a rowwise canonical variable ordering. However, this choice is arbitrary. We investigate other canoni...

This paper presents the implementation of an extension of the XQuery Full-Text language on top of the BaseX query engine. The proposed extension adds to the language two new flexible axes that allow users to express structural constraints that are evaluated in an approximate way with respect to a considered path; the constraints evaluation produces a scored set of elements. The implementation a...

Nonconcatenative constraints, such as the shuffle relation, are frequently employed in grammatical analyses of languages that have more flexible ordering of constituents than English. We show how it is possible to avoid searching the large space of permutations that results from a nondeterministic application of shuffle constraints. The results of our implementation demonstrate that determinist...

A block-iterative parallel decomposition method is proposed to solve general quadratic signal recovery problems under convex constraints. The proposed method proceeds by local linearizations of blocks of constraints and it is therefore not sensitive to their analytical complexity. In addition, it naturally lends itself to implementation on parallel computing architectures due to its flexible bl...

A low complexity dynamic subcarrier and power allocation methodology for downlink communication in an OFDM-based multiuser environment is developed. The problem of maximizing overall capacity with constraints on total power consumption, bit error rate and data rate proportionality among users requiring different QOS specifications is formulated. Assuming perfect knowledge of the instantaneo...