Block-insertion-based algorithms for the linear ordering problem

DOI10.1016/j.cor.2019.104861zbMath1458.90559WikidataQ126626546 ScholiaQ126626546MaRDI QIDQ2289935

Haihua Hu, Dehong Li, Yanjun Qian, Jun Lin

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

memetic algorithm; iterated local search; linear ordering problem; block insertion

Mathematics Subject Classification ID

90C59: Approximation methods and heuristics in mathematical programming

90C27: Combinatorial optimization

Related Items

A linear ordering problem with weighted rank, Scheduling interrelated activities in complex projects under high-order rework: a DSM-based approach

Cites Work

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