The linear ordering problem with clusters: a new partial ranking
From MaRDI portal
Recommendations
- A new heuristic algorithm solving the linear ordering problem
- Analysis of a generalized linear ordering problem via integer programming
- A benchmark library and a comparison of heuristic methods for the linear ordering problem
- Strong Condorcet criterion for the linear ordering problem
- The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
Cites work
- scientific article; zbMATH DE number 3902051 (Why is no real title available?)
- scientific article; zbMATH DE number 3497315 (Why is no real title available?)
- scientific article; zbMATH DE number 1054674 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- scientific article; zbMATH DE number 894762 (Why is no real title available?)
- A Bayesian approach to seriation problems in archaeology
- A Cutting Plane Algorithm for the Linear Ordering Problem
- A NEW MEASURE OF RANK CORRELATION
- A linear ordering problem of sets
- A survey on optimization metaheuristics
- An experimental evaluation of a scatter search for the linear ordering problem
- Design and analysis of hybrid metaheuristics for the reliability \(p\)-median problem
- Fundamentals of scatter search and path relinking
- Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
- Multi-objective evolutionary algorithms for a reliability location problem
- Optimal Weighted Ancestry Relationships
- Rank aggregation in cyclic sequences
- Scatter search. Methodology and implementation in C. With CD-ROM.
- The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
Cited in
(4)
This page was built for publication: The linear ordering problem with clusters: a new partial ranking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q828738)
