Mushi, Allen2018-11-232018-11-232005-061607-9949http://hdl.handle.net/20.500.11810/5001In this paper we describe and implement an algorithm for the exact solution of the Linear Ordering problem. Linear Ordering is the problem of finding a linear order of the nodes of a graph such that the sum of the weights which are consistent with this order is as large as possible. It is an NP - Hard combinatorial optimisation problem with a large number of applications, including triangulation of input - output matrices in Economics, aggregation of individual preferences and ordering of teams in sports. We implement an algorithm for the exact solution using cutting plane and branch and bound procedures. The program developed is then applied to the triangulation problem for the input - output tables. We have been able to triangulate input - output matrices of size up to 41 x 41.enLinear Ordering Problem, Combinatorial Optimization, Input-Output TablesJournal Article