Block-insertion-based algorithms for the linear ordering problem

DOI10.1016/J.COR.2019.104861MaRDI QIDQ2289935zbMATH OpenOpenAlexWikidataFDO

Authors Yanjun Qian, Jun Lin, Dehong Li, Haihua Hu

Publication date 27 January 2020

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2019.104861

zbMATH Keywords

block insertioniterated local searchlinear ordering problemmemetic algorithm

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• The linear ordering problem revisited
• Revised GRASP with path-relinking for the linear ordering problem
• A new heuristic algorithm solving the linear ordering problem
• Intensification and diversification with elite tabu search solutions for the linear ordering problem
• scientific article; zbMATH DE number 1962001

Cites work

• 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
• A benchmark library and a comparison of heuristic methods for the linear ordering problem
• A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments
• A Cutting Plane Algorithm for the Linear Ordering Problem
• A new heuristic algorithm solving the linear ordering problem
• An effective approach for scheduling coupled activities in development projects
• An Efficient Heuristic Procedure for Partitioning Graphs
• An experimental evaluation of a scatter search for the linear ordering problem
• An updated survey on the linear ordering problem for weighted or unweighted tournaments
• Approaching rank aggregation problems by using evolution strategies: the case of the optimal bucket order problem
• Heuristics for the constrained incremental graph drawing problem
• scientific article; zbMATH DE number 2013555 (Why is no real title available?)
• scientific article; zbMATH DE number 1489805 (Why is no real title available?)
• Intensification and diversification with elite tabu search solutions for the linear ordering problem
• Lamarckian genetic algorithms applied to the aggregation of preferences
• New semidefinite programming relaxations for the linear ordering and the traveling salesman problem
• Optimal Weighted Ancestry Relationships
• Partial evaluation in rank aggregation problems
• Search Methodologies
• Semidefinite relaxations of ordering problems
• Solving real-world linear ordering problems using a primal-dual interior point cutting plane method
• Tabu search for the dynamic bipartite drawing problem
• Testing probabilistic models of choice using column generation
• The linear ordering problem revisited
• The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
• The linear ordering problem: instances, search space analysis and algorithms

Cited in

(7)

• Intensification and diversification with elite tabu search solutions for the linear ordering problem
• The linear ordering problem revisited
• Scheduling interrelated activities in complex projects under high-order rework: a DSM-based approach
• Revised GRASP with path-relinking for the linear ordering problem
• scientific article; zbMATH DE number 1962001 (Why is no real title available?)
• A linear ordering problem with weighted rank
• Finding small feedback arc sets on large graphs

This page was built for publication: Block-insertion-based 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 Q2289935)