Greedy randomized adaptive search procedures
type: Item
instance of: scholarly article
title: Greedy randomized adaptive search procedures
zbMATH Open document ID: 0822.90110
DOI: 10.1007/BF01096763
author: Thomas A. Feo
author: Mauricio G. C. Resende
published in: Journal of Global Optimization
publication date: 1995-05-15T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 90-08
zbMATH DE Number: 755306
zbMATH Keywords: computer implementation
zbMATH Keywords: greedy randomized adaptive search procedures
zbMATH Keywords: heuristic
zbMATH Keywords: iterative randomized sampling technique
describes a project that uses: DIMACS
MaRDI profile type: Publication
cites work: Note—Operations Sequencing in Discrete Parts Manufacturing
cites work: QAPLIB-A quadratic assignment problem library
cites work: An exact algorithm for the maximum clique problem
cites work: Single machine scheduling to minimize weighted earliness subject to no tardy jobs
cites work: Facility-Wide Planning and Scheduling of Printed Wiring Board Assembly
cites work: The Intermodal Trailer Assignment Problem
cites work: A probabilistic heuristic for a computationally difficult set covering problem
cites work: A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
cites work: A grasp for single machine scheduling with sequence dependent setup costs and linear delay penalties
cites work: A GRASP for a difficult single machine scheduling problem
cites work: The Fixed Job Schedule Problem with Spread-Time Constraints
cites work: STABULUS: A technique for finding stable sets in large graphs with tabu search
cites work: Q4124603
cites work: Tabu Search—Part I
cites work: Tabu Search—Part II
cites work: Q4692508
cites work: Computational results of an interior point algorithm for large scale linear programming
cites work: An Efficient Heuristic Procedure for Partitioning Graphs
cites work: Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP
cites work: Q4319219
cites work: A Greedy Randomized Adaptive Search Procedure for the Two-Partition Problem
cites work: Q3677509
cites work: Q4321558
cites work: Q4739657
cites work: Q5687270
cites work: Algorithm 754: Fortran subroutines for approximate solution of dense quadratic assignment problems using GRASP
full work available at URL: https://doi.org/10.1007/bf01096763
OpenAlex ID: W2997776631
Recommended article: Q4452897
Recommended article: Q5431864
Recommended article: Parallel Greedy Randomized Adaptive Search Procedures
Recommended article: Optimization by GRASP
Recommended article: Q3636119
Recommended article: Q3770313
Recommended article: Adaptive stochastic search
Recommended article: Adaptive greedy approximations
Recommended article: Q5190844
Recommended article: Q6167825
description: scientific article; zbMATH DE number 755306