The Linear Ordering Problem with cumulative costs

Several optimization problems require finding a permutation of a given set of items that minimizes a certain cost function. These problems are naturally modelled in graph-theory terms by introducing a complete digraph G = (V, A) whose vertices v V := {1,

• Type: Journal
• Year: 2008
• Where: EOR
• Authors: Livio Bertacco, Lorenzo Brunetta, Matteo Fischetti
• Keywords: Cost Function, EOR 2008, Optimization Problems, Permutation