A benchmark library and a comparison of heuristic methods for the linear ordering problem
From MaRDI portal
(Redirected from Publication:429522)
Recommendations
- The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
- A new heuristic algorithm solving the linear ordering problem
- A Cutting Plane Algorithm for the Linear Ordering Problem
- The linear ordering problem: instances, search space analysis and algorithms
- Revised GRASP with path-relinking for the linear ordering problem
Cites work
- scientific article; zbMATH DE number 437527 (Why is no real title available?)
- scientific article; zbMATH DE number 3850790 (Why is no real title available?)
- scientific article; zbMATH DE number 3902051 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- scientific article; zbMATH DE number 1178278 (Why is no real title available?)
- scientific article; zbMATH DE number 2013555 (Why is no real title available?)
- scientific article; zbMATH DE number 1489805 (Why is no real title available?)
- 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
- A Cutting Plane Algorithm for the Linear Ordering Problem
- A hybrid GRASP with perturbations for the Steiner problem in graphs
- A new heuristic algorithm solving the linear ordering problem
- A survey on the linear ordering problem for weighted or unweighted tournaments
- An Efficient Heuristic Procedure for Partitioning Graphs
- An experimental evaluation of a scatter search for the linear ordering problem
- Combinatorial optimization and small polytopes
- Future paths for integer programming and links to artificial intelligence
- Greedy randomized adaptive search procedures
- Intensification and diversification with elite tabu search solutions for the linear ordering problem
- Optimal Weighted Ancestry Relationships
- Scatter search. Methodology and implementation in C. With CD-ROM.
- The linear ordering problem: instances, search space analysis and algorithms
- Variable Neighborhood Search
- Variable neighborhood search for the linear ordering problem
Cited in
(17)- Rankability and linear ordering problem: probabilistic insight and algorithms
- The linear ordering problem with clusters: a new partial ranking
- The linear ordering problem: instances, search space analysis and algorithms
- ASlib: a benchmark library for algorithm selection
- The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
- An assignment problem and its application in education domain: a review and potential path
- A Cutting Plane Algorithm for the Linear Ordering Problem
- A semidefinite optimization approach to the target visitation problem
- A new heuristic algorithm solving the linear ordering problem
- Revised GRASP with path-relinking for the linear ordering problem
- Block-insertion-based algorithms for the linear ordering problem
- The linear ordering problem revisited
- An optimization model for the student-to-project supervisor assignment problem-the case of an engineering department
- Ranking with Hamiltonian dynamics
- Efficient local search algorithms for the linear ordering problem
- A linear ordering problem with weighted rank
- scientific article; zbMATH DE number 1962001 (Why is no real title available?)
This page was built for publication: A benchmark library and a comparison of heuristic methods for the linear ordering problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q429522)
