The Minimum Linear Arrangement Problem


Description:The MINLA problem is a classified NPhard optimization problem. It can be defined as: Input: Output: 

QuestionIn the MINLA problem, the goal is to arrange the vertices of a given graph on an integer line ( label assignment) , so as to minimize the following cost formuma C:


Problem InstancesIn order to define an instance of this problem we need to provide all the information about the Graph. This means: his Vertex Set and the associated Edge Set between pairs of vertexs. The edges are unweighted. 

Related Bibliography and Papers


