Revised GRASP with path-relinking for the linear ordering problem

DOI10.1007/S10878-010-9306-XMaRDI QIDQ411258zbMATH OpenOpenAlexFDO

Authors Carlos A. S. Oliveira, Bruno Chiarini, Panos M. Pardalos, Mauricio G. C. Resende, Wanpracha A. Chaovalitwongse

Publication date 4 April 2012

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-010-9306-x

zbMATH Keywords

heuristicGRASPpath-relinkinglinear ordering problem

Mathematics Subject Classification ID

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

Recommendations

• Intensification and diversification with elite tabu search solutions for the linear ordering problem
• Block-insertion-based algorithms for the linear ordering problem
• The linear ordering problem revisited
• A benchmark library and a comparison of heuristic methods for the linear ordering problem
• A new heuristic algorithm solving the linear ordering problem

Cites work

• scientific article; zbMATH DE number 3888925 (Why is no real title available?)
• scientific article; zbMATH DE number 3902051 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1062113 (Why is no real title available?)
• scientific article; zbMATH DE number 2013555 (Why is no real title available?)
• scientific article; zbMATH DE number 1489805 (Why is no real title available?)
• scientific article; zbMATH DE number 1757965 (Why is no real title available?)
• A Cutting Plane Algorithm for the Linear Ordering Problem
• A new heuristic algorithm solving the linear ordering problem
• A note on small linear-ordering polytopes
• An annotated bibliography of GRASP – Part I: Algorithms
• An experimental evaluation of a scatter search for the linear ordering problem
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Context-independent scatter and tabu search for permutation problems
• Divide-and-conquer approximation algorithms via spreading metrics
• Facets of the linear ordering polytope
• GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
• GRASP with a new local search scheme for vehicle routing problems with time windows
• Greedy randomized adaptive search procedures
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Intensification and diversification with elite tabu search solutions for the linear ordering problem
• More facets from fences for linear ordering and acyclic subgraph polytopes
• New Approximation Techniques for Some Linear Ordering Problems
• New Facets of the Linear Ordering Polytope

Cited in

(10)

• A benchmark library and a comparison of heuristic methods for the linear ordering problem
• Experimental and Efficient Algorithms
• Lagrangian relaxation and pegging test for linear ordering problems
• Structural propagation in a production network with restoring substitution elasticities
• An updated survey on the linear ordering problem for weighted or unweighted tournaments
• A hybrid data mining GRASP with path-relinking
• Block-insertion-based algorithms for the linear ordering problem
• The linear ordering problem revisited
• Efficient local search algorithms for the linear ordering problem
• scientific article; zbMATH DE number 1962001 (Why is no real title available?)

Describes a project that uses

Uses Software

• LOLIB
• Tabu search
• GRASP

This page was built for publication: Revised GRASP with path-relinking for the linear ordering problem

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