The linear ordering problem (LOP) has a wide range of applications in several fields, such as scheduling, sports, social sciences, and economics. Due to its combinatorial nature, it has been shown to be NP-hard. Like many other computationally hard problems, the linear ordering problem has captured the researcher attention for developing efficient solution procedures. The scope of this article is to introduce the reader to this problem, providing its definition and some of the algorithms proposed in literature for solving it efficiently.
Linear ordering problem / Festa, Paola. - STAMPA. - (2009), pp. 1881-1883. [10.1007/978-0-387-74759-0_335]
Linear ordering problem
FESTA, PAOLA
2009
Abstract
The linear ordering problem (LOP) has a wide range of applications in several fields, such as scheduling, sports, social sciences, and economics. Due to its combinatorial nature, it has been shown to be NP-hard. Like many other computationally hard problems, the linear ordering problem has captured the researcher attention for developing efficient solution procedures. The scope of this article is to introduce the reader to this problem, providing its definition and some of the algorithms proposed in literature for solving it efficiently.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
