Linear Ordering Problem: Time for a Change

arXiv:2605.31051 · cs.NE, cs.AI · Submitted 2026-05-29 · Read on arXiv

cs.NE, cs.AI

Submitted: 2026-05-29

Updated: 2026-06-05

Comments: Accepted for publication at PPSN 2026 - Conference on Parallel Problem Solving

Journal ref: In: Iacca, G., et al. (eds), Parallel Problem Solving from Nature - PPSN XIX. PPSN 2026. Lecture Notes in Computer Science, vol. 16985. Springer, Cham (2027)

DOI: 10.1007/978-3-032-36214-8_25

Code: https://github.com/sgpceurj/EJOR2015

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Terminology

Linear Ordering Problem — 32× in this paper
Benchmark — 30× in this paper · explained in 2 episodes
Sparsity — 14× in this paper · explained in 4 episodes
Combinatorial Optimization — 9× in this paper · explained in 2 episodes
Objective Function — 4× in this paper · explained in 2 episodes
Aggregation — 3× in this paper · explained in 1 episode
Benchmarking — 3× in this paper · explained in 3 episodes
Core — 3× in this paper · explained in 2 episodes
Adaptation — 1× in this paper · explained in 1 episode
Generative AI — 1× in this paper · explained in 2 episodes
International Standard Industrial Classification — 1× in this paper
Multi-objective Optimization — 1× in this paper · explained in 4 episodes
Prompt Engineering — 1× in this paper · explained in 4 episodes
Robustness — 1× in this paper · explained in 5 episodes

Terminology

Related papers