Efficient local search algorithms for the linear ordering problem

DOI10.1111/J.1475-3995.2010.00778.XMaRDI QIDQ3002554zbMATH OpenOpenAlexFDO

Authors Celso Satoshi Sakuraba, Mutsunori Yagiura

Publication date 20 May 2011

Published in International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1111/j.1475-3995.2010.00778.x

zbMATH Keywords

balanced search tree

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• The linear ordering problem revisited
• Linear time algorithms to solve the linear ordering problem for oriented tree based graphs
• A new heuristic algorithm solving the linear ordering problem
• Revised GRASP with path-relinking for the linear ordering problem
• A benchmark library and a comparison of heuristic methods for the linear ordering problem

Cites work

• A survey on the linear ordering problem for weighted or unweighted tournaments
• An experimental evaluation of a scatter search for the linear ordering problem
• Analyses on the 2 and 3-flip neighborhoods for the MAX SAT
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• Intensification and diversification with elite tabu search solutions for the linear ordering problem
• The linear ordering problem: instances, search space analysis and algorithms
• Variable neighborhood search for the linear ordering problem

Cited in

(11)

• Partial evaluation in rank aggregation problems
• A new heuristic algorithm solving the linear ordering problem
• The linear ordering problem with cumulative costs
• The linear ordering problem revisited
• Linear time algorithms to solve the linear ordering problem for oriented tree based graphs
• New results of ant algorithms for the linear ordering problem
• Efficient algorithms for local ranking
• scientific article; zbMATH DE number 1948960 (Why is no real title available?)
• Multilevel algorithms for linear ordering problems
• A novel iterated greedy algorithm for no-wait permutation flowshop scheduling to minimize weighted quadratic tardiness
• An updated survey on the linear ordering problem for weighted or unweighted tournaments

This page was built for publication: Efficient local search algorithms for the linear ordering problem

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