A new heuristic algorithm solving the linear ordering problem

DOI10.1007/BF00249646MaRDI QIDQ1816404zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

heuristic algorithmlinear ordering problemNP-hard combinatorial problemsorting through insertion

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Multisectoral models in economics (91B66)

Recommendations

• scientific article; zbMATH DE number 3902051
• The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
• Algorithm for solving a problem on optimal linear ordering
• The linear ordering problem: instances, search space analysis and algorithms
• A benchmark library and a comparison of heuristic methods for the linear ordering problem
• New Approximation Techniques for Some Linear Ordering Problems
• The linear ordering problem revisited
• A new heuristic for the linear placement problem
• Efficient local search algorithms for the linear ordering problem
• scientific article; zbMATH DE number 1962001

Cites work

• scientific article; zbMATH DE number 3633982 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A Cutting Plane Algorithm for the Linear Ordering Problem
• A branch and bound algorithm for the acyclic subgraph problem
• A new heuristic algorithm solving the linear ordering problem
• Multiple attribute decision making. Methods and applications. A state-of- the-art survey
• On the acyclic subgraph polytope
• Optimal Weighted Ancestry Relationships
• Zwei Algorithmen zur Lösung eines komplexen Reihenfolgeproblems

Cited in

(30)

• scientific article; zbMATH DE number 4116248 (Why is no real title available?)
• Applying mod-\(k\)-cuts for solving linear ordering problems
• The linear ordering problem with clusters: a new partial ranking
• The linear ordering problem: instances, search space analysis and algorithms
• Finding small feedback arc sets on large graphs
• scientific article; zbMATH DE number 2243086 (Why is no real title available?)
• Subproblem ordering heuristics for AND/OR best-first search
• A benchmark library and a comparison of heuristic methods for the linear ordering problem
• Workload balancing and loop layout in the design of a flexible manufacturing system
• On approximability of linear ordering and related NP-optimization problems on graphs.
• Lagrangian relaxation and pegging test for linear ordering problems
• On the linear ordering problem and the rankability of data
• A new heuristic algorithm solving the linear ordering problem
• scientific article; zbMATH DE number 3902379 (Why is no real title available?)
• Descent with mutations applied to the linear ordering problem
• An updated survey on the linear ordering problem for weighted or unweighted tournaments
• On VLSI interconnect optimization and linear ordering problem
• Revised GRASP with path-relinking for the linear ordering problem
• Variable neighborhood search for the linear ordering problem
• Experiments with Kemeny ranking: What works when?
• Block-insertion-based algorithms for the linear ordering problem
• A survey on the linear ordering problem for weighted or unweighted tournaments
• The linear ordering problem revisited
• New results of ant algorithms for the linear ordering problem
• On the hardness of approximating some NP-optimization problems related to minimum linear ordering problem
• SOLO: A Linear Ordering Approach to Path Analysis of Web Site Traffic
• Efficient local search algorithms for the linear ordering problem
• A memetic algorithm for the linear ordering problem with cumulative costs
• The linear ordering problem with cumulative costs
• A branch-and-bound algorithm for the linear ordering problem with cumulative costs

This page was built for publication: A new heuristic algorithm solving the linear ordering problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1816404)