Block-insertion-based algorithms for the linear ordering problem.

lFour properties of the Linear Ordering Problem.lThree new local search schemes.lThe block-insertion-based iterated local search and memetic algorithm that frequently produce better solutions than the state-of-the-art meta-heuristics.lA parallel computing framework that can further improve the solutions derived by local search schemes and/or meta-heuristics.