A benchmark library and a comparison of heuristic methods for the linear ordering problem

DOI10.1007/s10589-010-9384-9zbMath1245.90108OpenAlexW2150400602MaRDI QIDQ429522

Rafael Martí, Abraham Duarte, Gerhard Reinelt

Publication date: 19 June 2012

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-010-9384-9

zbMATH Keywords

metaheuristicslibraryempirical comparison

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

The linear ordering problem revisited, Rankability and linear ordering problem: probabilistic insight and algorithms, A semidefinite optimization approach to the target visitation problem, A linear ordering problem with weighted rank, An optimization model for the student-to-project supervisor assignment problem-the case of an engineering department, An assignment problem and its application in education domain: a review and potential path, Block-insertion-based algorithms for the linear ordering problem, Ranking with Hamiltonian dynamics

Uses Software

• GraphBase
• PORTA
• Scatter Search
• Tabu search
• LOLIB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Intensification and diversification with elite tabu search solutions for the linear ordering problem
• The linear ordering problem: instances, search space analysis and algorithms
• Greedy randomized adaptive search procedures
• Combinatorial optimization and small polytopes
• A new heuristic algorithm solving the linear ordering problem
• Future paths for integer programming and links to artificial intelligence
• An experimental evaluation of a scatter search for the linear ordering problem
• Scatter search. Methodology and implementation in C. With CD-ROM.
• Variable neighborhood search for the linear ordering problem
• A survey on the linear ordering problem for weighted or unweighted tournaments
• A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs
• A Cutting Plane Algorithm for the Linear Ordering Problem
• Optimal Weighted Ancestry Relationships
• An Efficient Heuristic Procedure for Partitioning Graphs
• 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
• Variable Neighborhood Search