arrow
Return

Multiple Linear Ordering Problem

delete2025-11-06
delete0
delete
OA
AI
M
Marc Benito-Marimón
R
Rafael Martı́
A
Anna Martı́nez-Gavara
DOI:10.1016/j.ejor.2025.10.040delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
• Extended model to find diverse optimal linear ordering problem rankings. • The new objective function improves ranking inter-distance. • Heuristic solves medium and large linear ordering problem instances. • Position ranges help users apply linear ordering problem solutions. • Extensive tests compare our methods to prior work.
Keywords:
Multiple optimal solutions
Linear Ordering Problem
variable neighborhood search
metaheuristics
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

European Journal of Operational Research cover
European Journal of Operational Research
IF:
6
Papers:
2.2W
Citations:
6.4W

Organization

U
Universitat de València
Scholars:
200
Papers: 85
Citations: 2.5W
Cited Papers

Cited Papers

On the linear ordering problem and the rankability of data
err2021-01-01
err0
errOAAI
errThomas R. Cameron; Sebastian Charmot; Jonad Pulaj
errShare
errSave
Fairness and the set of optimal rankings for the linear ordering problem
err2021-06-23
err0
PREAI
errPaul E. Anderson; Timothy P. Chartier; Amy N. Langville; Kathryn E. Pedings-Behling
errShare
errSave
Variable neighborhood search: basics and variants
err2017-09-01
err0
errOAAI
errPierre Hansen; Nenad Mladenović; Raca Todosijević; Saïd Hanafi
errShare
errSave