Efficient local search algorithms for the linear ordering problem

DOI10.1111/j.1475-3995.2010.00778.xzbMath1220.90154OpenAlexW2051481976MaRDI QIDQ3002554

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)

Related Items (3)

Partial evaluation in rank aggregation 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

Cites Work

• Unnamed Item
• Intensification and diversification with elite tabu search solutions for the linear ordering problem
• Analyses on the 2 and 3-flip neighborhoods for the MAX SAT
• The linear ordering problem: instances, search space analysis and algorithms
• An experimental evaluation of a scatter search for the linear ordering problem
• Variable neighborhood search for the linear ordering problem
• A 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