The Quadratic Assignment Problem is one of the hardest combinatorial optimization problems known. We present two new classes of instances of the Quadratic Assignment Problem that can be reduced to the Linear Assignment Problem and give polynomial time procedures to check whether or not an instance is an element of these classes. © 2011 Elsevier B.V. All rights reserved.

The hierarchical superposition based theorem proving calculus of Bachmair, Ganzinger, and Waldmann enables the hierarchic combination of a theory with full first-order logic. If a clause set of the combination enjoys a sufficient completeness criterion, the calculus is even complete. We instantiate the calculus for the theory of linear arithmetic. In particular, we develop new effective version...

Mutant human interleukin-la proteins were constructed by oligonucleotide directed mutagenesis. Six different mutants were tested for receptor binding activity and showed no alteration with respect to the wild-type protein. Analysis of these mutants by nuclear magnetic resonance spectroscopy confirmed the structural integrity of the mutant proteins and pcrmitted the sequence specific assignment ...

In this paper, we consider the Routing and Wavelength Assignment (RWA) problem in Wavelength Division Multiplexing (WDM) networks. Firstly, we propose separate linear programming (LP) formulations for the lightpath routing and the wavelength assignment subproblems. Then, an iterative algorithm that integrates both formulations is also proposed for solving the complete RWA problem. The objective...

l’homme est toujours sous le regard des 'autres', c’est sa condition permanente au cours de  son existence. pour montrer cette situation humaine, sartre, philosophe existentialiste et écrivain français le plus connu du xxe siècle, a choisit le théâtre duquel nous avons choisi deux pièces: huis clos et les mouches. dans ces pièces, chaque personnage tente de juger 'l’autre' en le comparant à lui...

We extend the classical linear assignment problem to the case where the cost of assigning agent j to task i is a multiplication of task i’s cost parameter by a cost function of agent j. The cost function of agent j is a linear function of the amount of resource allocated to the agent. A solution for our assignment problem is de…ned by the assignment of agents to tasks and by a resource allocati...

In this paper, we presents a comfortable fully typed lambda calculus based on the well-known intersection type system discipline where proof are not only feasible but easy; the present system is the counterpart à la Church of the type assignment system as invented by Coppo and Dezani.

This paper presents a method of determining, from Present State Next State Present Output the flow table of an autonomous sequential machine, whether the machine can be realized by a linear circuit which uses the minimum sI SI possible number of secondary variables. The method is based on a ssz z class of binary partitions of states, which are used to find a minimal 2 assignment of the secondar...

We construct an ascending auction for heterogeneous objects by applying a primal-dual algorithm to a linear program that represents the efficient-allocation problem for this setting. The auction assigns personalized prices to bundles, and asks bidders to report their preferred bundles in each round. A bidder’s prices are increased when he belongs to a “minimally undersupplied” set of bidders. W...

time-delays are important components of many dynamical systems that describe coupling or interconnection between dynamics, propagation or transport phenomena, and heredity and competition in population dynamics. the stabilization with time delay in observation or control represents difficult mathematical challenges in the control of distributed parameter systems. it is well-known that the stabi...