The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
type: Item
instance of: scholarly article
title: The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
zbMATH Open document ID: 1213.90005
DOI: 10.1007/978-3-642-16729-4
author: Rafael Martí
author: Gerhard Reinelt
published in: Applied Mathematical Sciences
publication date: 2010-12-16T00:00:00Z
review text: The book is devoted to the linear ordering problem. The authors survey state-of-the-art optimization methods, approximation results and discuss open questions concerning the linear ordering problem. The reader is provided with the basic definitions and basic heuristic methods in optimization. The set of publicly available benchmark instances for conducting computational experiments is described. Separate chapters discuss meta-heuristics and branch-and-cut methods. The authors study the convex hull of feasible solutions of the linear ordering problem and present a special version of branch-and-cut algorithm based on polyhedral combinatorics. Computational experiments comparing different methods for the linear ordering problem are reported.
reviewed by: Svetlana A. Kravchenko
Mathematics Subject Classification ID: 90-02
Mathematics Subject Classification ID: 90-01
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 5827306
zbMATH Keywords: heuristic
zbMATH Keywords: branch-and-cut
zbMATH Keywords: linear ordering polytope
describes a project that uses: GraphBase
describes a project that uses: ABACUS
describes a project that uses: Concorde
describes a project that uses: PORTA
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1007/978-3-642-16729-4
OpenAlex ID: W2489850449
description: scientific article; zbMATH DE number 5827306