The linear ordering problem: instances, search space analysis and algorithms

DOI10.1007/S10852-005-2583-1MaRDI QIDQ1774626zbMATH OpenOpenAlexFDO

Authors Tommaso Schiavinotto, Thomas Stützle

Publication date 17 May 2005

Published in JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10852-005-2583-1

zbMATH Keywords

benchmark instancesiterated local searchlinear ordering problemmemetic algorithmssearch space analysis

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Search theory (90B40) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• scientific article; zbMATH DE number 1962001
• The linear ordering problem revisited
• A benchmark library and a comparison of heuristic methods for the linear ordering problem
• A memetic algorithm for the linear ordering problem with cumulative costs
• A new heuristic algorithm solving the linear ordering problem

Cites work

• A branch and bound algorithm for the acyclic subgraph problem
• A Cutting Plane Algorithm for the Linear Ordering Problem
• An experimental evaluation of a scatter search for the linear ordering problem
• Autocorrelation coefficient for the graph bipartitioning problem
• Correlated and uncorrelated fitness landscapes and how to tell the difference
• Intensification and diversification with elite tabu search solutions for the linear ordering problem
• Landscapes and their correlation functions
• On the classification of NP-complete problems in terms of their correlation coefficient
• Optimization by simulated annealing
• The landscape of the traveling salesman problem

Cited in

(24)

• Comparing Two Samples Through Stochastic Dominance: A Graphical Approach
• Descent with mutations applied to the linear ordering problem
• A memetic algorithm for the linear ordering problem with cumulative costs
• A new heuristic algorithm solving the linear ordering problem
• Fairness and the set of optimal rankings for the linear ordering problem
• Block-insertion-based algorithms for the linear ordering problem
• A heuristic framework on a common generalization of the vehicle routing problem and the linear ordering problem
• The linear ordering problem revisited
• A survey on the linear ordering problem for weighted or unweighted tournaments
• New results of ant algorithms for the linear ordering problem
• Efficient local search algorithms for the linear ordering problem
• Approximating Minimum Linear Ordering Problems
• Metaheuristics for Score-and-Search Bayesian Network Structure Learning
• Generating new test instances by evolving in instance space
• A benchmark library and a comparison of heuristic methods for the linear ordering problem
• scientific article; zbMATH DE number 1962001 (Why is no real title available?)
• scientific article; zbMATH DE number 1757965 (Why is no real title available?)
• Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis
• Randomized algorithms for lexicographic inference
• An experimental comparison of algebraic crossover operators for permutation problems
• Linearizing partial search orders
• A linear ordering problem with weighted rank
• A review of distances for the Mallows and generalized Mallows estimation of distribution algorithms
• An updated survey on the linear ordering problem for weighted or unweighted tournaments

Describes a project that uses

Uses Software

• GraphBase
• LOLIB

This page was built for publication: The linear ordering problem: instances, search space analysis and algorithms

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