A new heuristic algorithm solving the linear ordering problem

DOI10.1007/BF00249646zbMath0860.90100MaRDI QIDQ1816404

Stefan Chanas, Przemysław Kobylański

Publication date: 26 November 1996

Published in: Computational Optimization and Applications (Search for Journal in Brave)

zbMATH Keywords

heuristic algorithm; linear ordering problem; NP-hard combinatorial problem; sorting through insertion

Mathematics Subject Classification ID

90C27: Combinatorial optimization

91B66: Multisectoral models in economics

Related Items

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?, An updated survey on the linear ordering problem for weighted or unweighted tournaments, On approximability of linear ordering and related NP-optimization problems on graphs., A new heuristic algorithm solving the linear ordering problem, Workload balancing and loop layout in the design of a flexible manufacturing system, Variable neighborhood search for the linear ordering problem, The linear ordering problem revisited, A 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

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