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
- A GRASP for a difficult single machine scheduling problem
- A grasp for single machine scheduling with sequence dependent setup costs and linear delay penalties
- A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
- A Greedy Randomized Adaptive Search Procedure for the Two-Partition Problem
- 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
- 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?)
- Note—Operations Sequencing in Discrete Parts Manufacturing
- QAPLIB-A quadratic assignment problem library
- Single machine scheduling to minimize weighted earliness subject to no tardy jobs
- STABULUS: A technique for finding stable sets in large graphs with tabu search
- 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)- A route set construction algorithm for the transit network design problem
- Analysis of new variable selection methods for discriminant analysis
- Developing work schedules for an inter-city transit system with multiple driver types and fleet types
- The equitable dispersion problem
- Heuristics for the bi-objective path dissimilarity problem
- A mathematical program to refine gene regulatory networks
- Solving systems of nonlinear equations with continuous GRASP
- Greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problem
- A hybrid multi-swarm particle swarm optimization algorithm for the probabilistic traveling salesman problem
- A hybrid evolution strategy for the open vehicle routing problem
- GRASP and path relinking for the max-min diversity problem
- A cross entropy based algorithm for reliability problems
- Using a greedy random adaptative search procedure to solve the cover printing problem
- GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem
- A GRASP for a difficult single machine scheduling problem
- A GRASP for the biquadratic assignment problem
- Heuristics for the flow line problem with setup costs
- Variable neighborhood search for the degree-constrained minimum spanning tree problem
- Computational aspects of the maximum diversity problem
- A minimax assignment problem in treelike communication networks
- A variable neighborhood search for graph coloring.
- GRASP and path relinking for the matrix bandwidth minimization.
- GRASP for set packing problems.
- The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations
- New strategies for stochastic resource-constrained project scheduling
- Heuristics for the constrained incremental graph drawing problem
- Detecting robust cliques in graphs subject to uncertain edge failures
- A combined multistart random constructive heuristic and set partitioning based formulation for the vehicle routing problem with time dependent travel times
- An iterated ``hyperplane exploration approach for the quadratic knapsack problem
- Intelligent-guided adaptive search for the maximum covering location problem
- GRASP with exterior path-relinking and restricted local search for the multidimensional two-way number partitioning problem
- A quality and distance guided hybrid algorithm for the vertex separator problem
- Generic Pareto local search metaheuristic for optimization of targeted offers in a bi-objective direct marketing campaign
- Efficient local search limitation strategy for single machine total weighted tardiness scheduling with sequence-dependent setup times
- Algorithms for job scheduling problems with distinct time windows and general earliness/tardiness penalties
- Bi-objective orienteering for personal activity scheduling
- A meta-heuristic based goal-selection strategy for mobile robot search in an unknown environment
- Carousel greedy: a generalized greedy algorithm with applications in optimization
- Computational study of valid inequalities for the maximum \(k\)-cut problem
- Solving large-scale TSP using a fast wedging insertion partitioning approach
- Minimum energy target tracking with coverage guarantee in wireless sensor networks
- Optimal location of RFID reader antennas in a three dimensional space
- Evaluating balancing on social networks through the efficient solution of correlation clustering problems
- Variable neighborhood scatter search for the incremental graph drawing problem
- A batch-oblivious approach for complex job-shop scheduling problems
- A cluster-first route-second approach for the swap body vehicle routing problem
- Partitioning of supply/demand graphs with capacity limitations: an ant colony approach
- Simulated annealing based GRASP for Pareto-optimal dissimilar paths problem
- A hybrid GRASP+VND heuristic for the two-echelon vehicle routing problem arising in city logistics
- GRASP and VNS for solving the \(p\)-next center problem
- An evolutionary approach to a combined mixed integer programming model of seaside operations as arise in container ports
- A GRASP algorithm for solving large-scale single row facility layout problems
- Median and covering location problems with interconnected facilities
- Minimizing latency in post-disaster road clearance operations
- Parametrized GRASP heuristics for three-index assignment
- A matheuristic for the cell formation problem
- An iterated greedy heuristic for a market segmentation problem with multiple attributes
- A hybrid particle swarm optimization -- variable neighborhood search algorithm for constrained shortest path problems
- Sequential testing of n-out-of-n systems: precedence theorems and exact methods
- Scatter search for the cutwidth minimization problem
- Efficient solutions for the far from most string problem
- An improved multi-staged algorithmic process for~the~solution of the examination timetabling problem
- A GRASP algorithm for the closest string problem using a probability-based heuristic
- Capacitated clustering problem in computational biology: combinatorial and statistical approach for sibling reconstruction
- Hybrid VNS heuristics for the production scheduling of costumes for Brazilian carnival samba schools
- The multiple traveling salesman problem with backup coverage
- Guided local search and its application to the traveling salesman problem
- Heuristics and meta-heuristics for 2-layer straight line crossing minimization
- A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem.
- Semi-greedy heuristics: An empirical study
- Randomized parallel algorithms for the multidimensional assignment problem
- A GRASP heuristic for the mixed Chinese postman problem
- Diversification strategies in local search for a nonbifurcated network loading problem
- Probability distribution of solution time in GRASP: an experimental investigation
- A fuzzy genetic algorithm for driver scheduling
- A crane scheduling method for port container terminals
- Metaheuristics: A bibliography
- Designing and reporting on computational experiments with heuristic methods
- A simple and effective metaheuristic for the minimum latency problem
- Fuzzy optimization for distribution of frozen food with imprecise times
- A GRASP heuristic for the manufacturing cell formation problem
- GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times
- MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems
- Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP
- Solving the wire-harness design problem at a European car manufacturer
- A multi-product production/distribution system design problem with direct shipments and lateral transshipments
- GRASP with variable neighborhood descent for the online order batching problem
- Revenue maximization of Internet of Things provider using variable neighbourhood search
- Joint optimization of container slot planning and truck scheduling for tandem quay cranes
- A metaheuristic algorithm and structured analysis for the Line-haul Feeder vehicle routing problem with time windows
- A metaheuristic for the delivery man problem with time windows
- A multi-objective parallel variable neighborhood search for the bi-objective obnoxious p-median problem
- An infeasible space exploring matheuristic for the production routing problem
- Exact and heuristic algorithms for the maximum weighted submatrix coverage problem
- Two-echelon vehicle routing problems: a literature review
- An efficient GRASP-like algorithm for the multi-product straight pipeline scheduling problem
- A cumulative unmanned aerial vehicle routing problem approach for humanitarian coverage path planning
- A branch-and-price algorithm for the ring-tree facility location problem
- A GRASP for the convex recoloring problem in graphs
- Assembly line balancing: what happened in the last fifteen years?
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)
