Greedy randomized adaptive search procedures
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2050708
- Greedy randomized adaptive search procedures
- Parallel Greedy Randomized Adaptive Search Procedures
- Optimization by GRASP. Greedy randomized adaptive search procedures
- Greedy algorithms for adaptive approximation
- scientific article; zbMATH DE number 4029304
- Adaptive stochastic search
- Adaptive greedy approximations
- Adaptive approximations by greedy algorithms
- Greedy search of optimal approximate solutions
Cites work
- scientific article; zbMATH DE number 3898613 (Why is no real title available?)
- scientific article; zbMATH DE number 3550465 (Why is no real title available?)
- scientific article; zbMATH DE number 709816 (Why is no real title available?)
- scientific article; zbMATH DE number 714537 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- scientific article; zbMATH DE number 956862 (Why is no real title available?)
- A GRASP for a difficult single machine scheduling problem
- A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
- A Greedy Randomized Adaptive Search Procedure for the Two-Partition Problem
- A grasp for single machine scheduling with sequence dependent setup costs and linear delay penalties
- A probabilistic heuristic for a computationally difficult set covering problem
- Algorithm 754: Fortran subroutines for approximate solution of dense quadratic assignment problems using GRASP
- An Efficient Heuristic Procedure for Partitioning Graphs
- An exact algorithm for the maximum clique problem
- Avoiding local optima in the p-hub location problem using tabu search and GRASP
- Computational results of an interior point algorithm for large scale linear programming
- Facility-Wide Planning and Scheduling of Printed Wiring Board Assembly
- Note—Operations Sequencing in Discrete Parts Manufacturing
- QAPLIB-A quadratic assignment problem library
- STABULUS: A technique for finding stable sets in large graphs with tabu search
- Single machine scheduling to minimize weighted earliness subject to no tardy jobs
- Tabu Search—Part I
- Tabu Search—Part II
- The Fixed Job Schedule Problem with Spread-Time Constraints
- The Intermodal Trailer Assignment Problem
Cited in
(only showing first 100 items - show all)- Metaheuristic algorithms for the hybrid flowshop scheduling problem
- Local search-based hybrid algorithms for finding Golomb rulers
- Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP
- Greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problem
- A variable neighborhood search approach for the vertex bisection problem
- Combining metaheuristics with mathematical programming, constraint programming and machine learning
- scientific article; zbMATH DE number 2230204 (Why is no real title available?)
- Computational study of a branching algorithm for the maximum \(k\)-cut problem
- Probabilistic stopping rules for GRASP heuristics and extensions
- GRASP and VNS approaches for a vehicle routing problem with step cost functions
- Mathematical models and heuristic algorithms for pallet building problems with practical constraints
- A hybrid stochastic genetic-GRASP algorithm for clustering analysis
- Efficient computation of shortest paths in networks using particle swarm optimization and noising metaheuristics
- scientific article; zbMATH DE number 709816 (Why is no real title available?)
- Exact and heuristic algorithms for minimizing the makespan on a single machine scheduling problem with sequence-dependent setup times and release dates
- A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem
- Search with evolutionary ruin and stochastic rebuild: a theoretic framework and a case study on exam timetabling
- Bayesian stopping rules for greedy randomized procedures
- Parallel Greedy Randomized Adaptive Search Procedures
- ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms
- GRASP and VNS for solving the \(p\)-next center problem
- Optimization by GRASP. Greedy randomized adaptive search procedures
- Finding efficient make-to-order production and batch delivery schedules
- Diversification strategies in local search for a nonbifurcated network loading problem
- Embedding signed graphs in the line
- A scatter search approach for the minimum sum-of-squares clustering problem
- Solving the wire-harness design problem at a European car manufacturer
- Reducing the bandwidth of a sparse matrix with tabu search.
- Integration of routing into a resource-constrained project scheduling problem
- Hybridization of GRASP metaheuristic with data mining techniques
- A review of vehicle routing with simultaneous pickup and delivery
- A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem
- A GRASP for parallel machine scheduling with time windows
- Multi-depot vessel routing problem in a direction dependent wavefield
- An evolutionary approach to a combined mixed integer programming model of seaside operations as arise in container ports
- A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
- An approach for efficient ship routing
- A local search algorithm for large maximum weight independent set problems
- An efficient GRASP-like algorithm for the multi-product straight pipeline scheduling problem
- Iterated local search with ejection chains for the space-free multi-row facility layout problem
- A hybrid and adaptive evolutionary approach for multitask optimization of post-disaster traveling salesman and repairman problems
- Minimizing the makespan on two parallel machines with a common server in charge of loading and unloading operations
- Evolution of the population of a genetic algorithm using particle swarm optimization: application to clustering analysis
- Multiple phase neighborhood search---GRASP based on Lagrangean relaxation, random backtracking Lin-Kernighan and path relinking for the TSP
- A greedy randomized adaptive search procedure (GRASP) for the multi-vehicle prize collecting arc routing for connectivity problem
- A biased random-key genetic algorithm for data clustering
- A survey of recent research on location-routing problems
- Exact and metaheuristic approaches to solve the integrated production scheduling, berth allocation and storage yard allocation problem
- Multi-armed bandit for the cyclic minimum sitting arrangement problem
- Two-phase GRASP for the multi-constraint graph partitioning problem
- Discrete facility location in machine learning
- An efficient two-phase metaheuristic algorithm for the time dependent traveling salesman problem
- A grasp algorithm for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness
- The production routing problem: a review of formulations and solution algorithms
- A GRASP with evolutionary path relinking for the truck and trailer routing problem
- A hybrid metaheuristic for routing on multicast networks
- Analysis of stochastic local search methods for the unrelated parallel machine scheduling problem
- Towards an efficient resolution of printing problems
- Local Search Based on Genetic Algorithms
- A GRASP algorithm for solving large-scale single row facility layout problems
- Solving the yard crane scheduling problem with dynamic assignment of input/output points
- Formulations and heuristic for the long-term preventive maintenance order scheduling problem
- Piecewise linear time series estimation with GRASP
- Fixed set search matheuristic applied to the knapsack problem with forfeits
- Combining probabilistic algorithms, constraint programming and Lagrangian relaxation to solve the vehicle routing problem
- A multi-product production/distribution system design problem with direct shipments and lateral transshipments
- Partitioning of supply/demand graphs with capacity limitations: an ant colony approach
- A cumulative unmanned aerial vehicle routing problem approach for humanitarian coverage path planning
- Fifty years of metaheuristics
- Strategic flood impact mitigation in developing countries' urban road networks: application to Hanoi
- Revenue maximization for multiple advertisements placement on a web banner using a pixel-price model
- On some optimization problems in molecular biology
- A variable neighborhood search for graph coloring.
- Continuous GRASP with a local active-set method for bound-constrained global optimization
- Exact Solution Algorithms for the Chordless Cycle Problem
- The leader multipurpose shopping location problem
- Queueing maximal covering location-allocation problem: an extension with \textit{M/G/1} queueing systems
- Heuristic ranking classification method for complex large-scale survival data
- Memetic algorithms
- A GRASP and path relinking heuristic for rural road network development
- The \(p\)-median problem: a survey of metaheuristic approaches
- scientific article; zbMATH DE number 2050708 (Why is no real title available?)
- Heuristic Solutions to the Facility Location Problem with General Bernoulli Demands
- Global optimization by continuous grasp
- Heuristics for matrix bandwidth reduction
- An efficient GRASP algorithm for disassembly sequence planning
- Adaptive tunning of all parameters in a multi-swarm particle swarm optimization algorithm: an application to the probabilistic traveling salesman problem
- A greedy randomized adaptive search procedure (GRASP) for inferring logical clauses from examples in polynomial time and some extensions
- Scatter search for the single source capacitated facility location problem
- An iterated ``hyperplane exploration approach for the quadratic knapsack problem
- Parametrized GRASP heuristics for three-index assignment
- A matheuristic for the cell formation problem
- An annotated bibliography of GRASP – Part I: Algorithms
- A GRASP\(\times \)ELS approach for the capacitated location-routing problem
- A hybrid evolution strategy for the open vehicle routing problem
- Adaptive memory programming for the robust capacitated international sourcing problem
- Heuristics for a project management problem with incompatibility and assignment costs
- A benchmark library and a comparison of heuristic methods for the linear ordering problem
- A hybrid heuristic approach to minimize number of tardy jobs in group technology systems
- A Metropolis algorithm combined with Hooke-Jeeves local search method applied to global optimization
This page was built for publication: Greedy randomized adaptive search procedures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1804580)
