The linear ordering problem with clusters: a new partial ranking

DOI10.1007/s11750-020-00552-3zbMath1467.90046OpenAlexW3012317009MaRDI QIDQ828738

Javier Alcaraz, Eva M. García-Nové, Mercedes Landete, Juan Francisco Monge

Publication date: 5 May 2021

Published in: Top (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11000/6277

zbMATH Keywords

metaheuristicslinear ordering problemrank aggregation problembucket ordering problem

Mathematics Subject Classification ID

Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (2)

The target visitation arc routing problem ⋮ A linear ordering problem with weighted rank

Uses Software

• Scatter Search
• Tabu search
• LOLIB

Cites Work

• A survey on optimization metaheuristics
• Rank aggregation in cyclic sequences
• The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
• A Bayesian approach to seriation problems in archaeology
• An experimental evaluation of a scatter search for the linear ordering problem
• Scatter search. Methodology and implementation in C. With CD-ROM.
• Design and analysis of hybrid metaheuristics for the reliability \(p\)-median problem
• A linear ordering problem of sets
• Multi-objective evolutionary algorithms for a reliability location problem
• A Cutting Plane Algorithm for the Linear Ordering Problem
• Optimal Weighted Ancestry Relationships
• Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
• A NEW MEASURE OF RANK CORRELATION
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The linear ordering problem with clusters: a new partial ranking