Revised GRASP with path-relinking for the linear ordering problem
DOI10.1007/S10878-010-9306-XzbMATH Open1236.90100OpenAlexW2062905002MaRDI QIDQ411258FDOQ411258
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
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
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Context-independent scatter and tabu search for permutation problems
- New Facets of the Linear Ordering Polytope
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Greedy randomized adaptive search procedures
- An annotated bibliography of GRASP – Part I: Algorithms
- GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
- Facets of the linear ordering polytope
- A Cutting Plane Algorithm for the Linear Ordering Problem
- Title not available (Why is that?)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Title not available (Why is that?)
- Intensification and diversification with elite tabu search solutions for the linear ordering problem
- New Approximation Techniques for Some Linear Ordering Problems
- Title not available (Why is that?)
- More facets from fences for linear ordering and acyclic subgraph polytopes
- GRASP with a new local search scheme for vehicle routing problems with time windows
- A new heuristic algorithm solving the linear ordering problem
- An experimental evaluation of a scatter search for the linear ordering problem
- A note on small linear-ordering polytopes
- Divide-and-conquer approximation algorithms via spreading metrics
- Title not available (Why is that?)
- Title not available (Why is that?)
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
- Title not available (Why is that?)
Uses Software
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)
