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

DOI10.1007/S10589-010-9384-9zbMATH Open1245.90108OpenAlexW2150400602MaRDI QIDQ429522FDOQ429522

Authors: Rafael Martí, Gerhard Reinelt, Abraham Duarte 

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

Recommendations

• The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
• A new heuristic algorithm solving the linear ordering problem
• A Cutting Plane Algorithm for the Linear Ordering Problem
• The linear ordering problem: instances, search space analysis and algorithms
• Revised GRASP with path-relinking for the linear ordering problem

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)

Cites Work

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

Cited In (15)

• Rankability and linear ordering problem: probabilistic insight and algorithms
• The linear ordering problem: instances, search space analysis and algorithms
• ASlib: a benchmark library for algorithm selection
• The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
• An assignment problem and its application in education domain: a review and potential path
• A Cutting Plane Algorithm for the Linear Ordering Problem
• A new heuristic algorithm solving the linear ordering problem
• A semidefinite optimization approach to the target visitation problem
• Block-insertion-based algorithms for the linear ordering problem
• The linear ordering problem revisited
• An optimization model for the student-to-project supervisor assignment problem-the case of an engineering department
• Ranking with Hamiltonian dynamics
• Efficient local search algorithms for the linear ordering problem
• A linear ordering problem with weighted rank
• Title not available (Why is that?)

Uses Software

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

This page was built for publication: A benchmark library and a comparison of heuristic methods for the linear ordering problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q429522)