This paper describes algorithms to perform optimal assignment of teams of robots translating in the plane from an initial formation to a variable goal formation. We consider the case when each robot is to be assigned a goal position, the individual robots are interchangeable, and the goal formation can be scaled or translated. We compute the costs for all candidate pairs of initial, goal robot ...

The quadratic assignment problem is a well studied and notoriously difficult combinatorial problem. Recently, a discrete linear formulation of the quadratic assignment problem was presented that solved five previously unsolved instances from the quadratic assignment library, QAPLIB, to optimality. That formulation worked especially well on sparse instances. In this paper we show how to tighten ...

the aim of this paper is to determine if the centrality degree and density of latin-american and caribbean countries (la-c) predicts their citation based performance in academic research in the management discipline. for our analysis, we use publication data of the social science citation index in the field of ‘‘management’’ between 1988 and 2013, extracted from isi web of science. the resultin...

In this paper, we present a simple algorithm to obtain mechanically SDP relaxations for any quadratic or linear program with bivalent variables, starting from an existing linear relaxation of the considered combinatorial problem. A significant advantage of our approach is that we obtain an improvement on the linear relaxation we start from. Moreover, we can take into account all the existing th...

this paper addresses the problem of design of variable length codes (VLC) that would allow to exploit higher-order source statistics while still being resilient to transmission errors. The codes introduced extend and generalize the family of codes called multiplexed codes, referred to as stationary multiplexed codes. The design principle consists in creating xed length codes (FLCs) for high pri...