A new heuristic algorithm solving the linear ordering problem
From MaRDI portal
Publication:1816404
DOI10.1007/BF00249646zbMath0860.90100OpenAlexW1979519377MaRDI QIDQ1816404
Przemysław Kobylański, Stefan Chanas
Publication date: 26 November 1996
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00249646
Related Items (14)
The linear ordering problem revisited ⋮ A survey on the linear ordering problem for weighted or unweighted tournaments ⋮ SOLO: A Linear Ordering Approach to Path Analysis of Web Site Traffic ⋮ Revised GRASP with path-relinking for the linear ordering problem ⋮ A benchmark library and a comparison of heuristic methods for the linear ordering problem ⋮ Experiments with Kemeny ranking: What works when? ⋮ On approximability of linear ordering and related NP-optimization problems on graphs. ⋮ An updated survey on the linear ordering problem for weighted or unweighted tournaments ⋮ On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem ⋮ Variable neighborhood search for the linear ordering problem ⋮ Block-insertion-based algorithms for the linear ordering problem ⋮ A new heuristic algorithm solving the linear ordering problem ⋮ On the linear ordering problem and the rankability of data ⋮ Workload balancing and loop layout in the design of a flexible manufacturing system
Cites Work
- Unnamed Item
- Unnamed Item
- Multiple attribute decision making. Methods and applications. A state-of- the-art survey
- A branch and bound algorithm for the acyclic subgraph problem
- A new heuristic algorithm solving the linear ordering problem
- A Cutting Plane Algorithm for the Linear Ordering Problem
- On the acyclic subgraph polytope
- Optimal Weighted Ancestry Relationships
- Zwei Algorithmen zur Lösung eines komplexen Reihenfolgeproblems
This page was built for publication: A new heuristic algorithm solving the linear ordering problem
