A new heuristic algorithm solving the linear ordering problem
type: Item
instance of: scholarly article
title: A new heuristic algorithm solving the linear ordering problem
zbMATH Open document ID: 0860.90100
DOI: 10.1007/BF00249646
author: Przemysław Kobylański
author: Stefan Chanas
published in: Computational Optimization and Applications
publication date: 1996-11-26T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 91B66
zbMATH DE Number: 949675
zbMATH Keywords: linear ordering problem
zbMATH Keywords: NP-hard combinatorial problem
zbMATH Keywords: heuristic algorithm
zbMATH Keywords: sorting through insertion
MaRDI profile type: Publication
cites work: Q4198056
cites work: Optimal Weighted Ancestry Relationships
cites work: A Cutting Plane Algorithm for the Linear Ordering Problem
cites work: On the acyclic subgraph polytope
cites work: Multiple attribute decision making. Methods and applications. A state-of- the-art survey
cites work: A branch and bound algorithm for the acyclic subgraph problem
cites work: Zwei Algorithmen zur Lösung eines komplexen Reihenfolgeproblems
cites work: Q4194705
full work available at URL: https://doi.org/10.1007/bf00249646
OpenAlex ID: W1979519377
Recommended article: Q3680289
Recommended article: The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
Recommended article: Algorithm for solving a problem on optimal linear ordering
Recommended article: The linear ordering problem: instances, search space analysis and algorithms
Recommended article: A benchmark library and a comparison of heuristic methods for the linear ordering problem
Recommended article: New Approximation Techniques for Some Linear Ordering Problems
Recommended article: The linear ordering problem revisited
Recommended article: A new heuristic for the linear placement problem
Recommended article: Efficient local search algorithms for the linear ordering problem
Recommended article: Q4418392
description: scientific article; zbMATH DE number 949675