Revised GRASP with path-relinking for the linear ordering problem
From MaRDI portal
Publication:411258
DOI10.1007/s10878-010-9306-xzbMath1236.90100OpenAlexW2062905002MaRDI QIDQ411258
Mauricio G. C. Resende, Bruno Chiarini, Carlos A. S. Oliveira, Panos M. Pardalos, Wanpracha Art 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
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
Structural propagation in a production network with restoring substitution elasticities, A hybrid data mining GRASP with path-relinking, An updated survey on the linear ordering problem for weighted or unweighted tournaments
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Intensification and diversification with elite tabu search solutions for the linear ordering problem
- 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
- Greedy randomized adaptive search procedures
- 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
- Context-Independent Scatter and Tabu Search for Permutation Problems
- Divide-and-conquer approximation algorithms via spreading metrics
- A Cutting Plane Algorithm for the Linear Ordering Problem
- An annotated bibliography of GRASP – Part I: Algorithms
- Facets of the linear ordering polytope
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
- New Approximation Techniques for Some Linear Ordering Problems
- New Facets of the Linear Ordering Polytope
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
