A new heuristic algorithm solving the linear ordering problem
From MaRDI portal
Recommendations
- Publication:3680289
- 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
- Publication:4418392
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
(29)- Efficient local search algorithms for the linear ordering problem
- Variable neighborhood search for the linear ordering problem
- The linear ordering problem revisited
- Descent with mutations applied to the linear ordering problem
- scientific article; zbMATH DE number 3902379 (Why is no real title available?)
- The linear ordering problem with clusters: a new partial ranking
- On the linear ordering problem and the rankability of data
- On VLSI interconnect optimization and linear ordering problem
- A branch-and-bound algorithm for the linear ordering problem with cumulative costs
- 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
- Lagrangian relaxation and pegging test for linear ordering problems
- Revised GRASP with path-relinking for the linear ordering problem
- On approximability of linear ordering and related NP-optimization problems on graphs.
- SOLO: A Linear Ordering Approach to Path Analysis of Web Site Traffic
- An updated survey on the linear ordering problem for weighted or unweighted tournaments
- Experiments with Kemeny ranking: What works when?
- scientific article; zbMATH DE number 2243086 (Why is no real title available?)
- A memetic algorithm for the linear ordering problem with cumulative costs
- A new heuristic algorithm solving the linear ordering problem
- Subproblem ordering heuristics for AND/OR best-first search
- New results of ant algorithms for the linear ordering problem
- The linear ordering problem: instances, search space analysis and algorithms
- Block-insertion-based algorithms for the linear ordering problem
- On the hardness of approximating some NP-optimization problems related to minimum linear ordering problem
- The linear ordering problem with cumulative costs
- scientific article; zbMATH DE number 4116248 (Why is no real title available?)
- A survey on the linear ordering problem for weighted or unweighted tournaments
- Applying mod-\(k\)-cuts for solving linear ordering problems
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)
