scientific article; zbMATH DE number 2050708
From MaRDI portal
Publication:4452897
Recommendations
Cited in
(only showing first 100 items - show all)- Optimal placement of stereo sensors
- Solving large-scale TSP using a fast wedging insertion partitioning approach
- A path-relinking approach for a bi-criteria disassembly sequencing problem
- A hybrid heuristic for the diameter constrained minimum spanning tree problem
- Heuristics for the bi-objective path dissimilarity problem
- Using horizontal cooperation concepts in integrated routing and facility‐location decisions
- A GRASP heuristic for slab scheduling at continuous casters
- A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives
- A constraint programming approach to the additional relay placement problem in wireless sensor networks
- Neighborhood decomposition-driven variable neighborhood search for capacitated clustering
- scientific article; zbMATH DE number 714537 (Why is no real title available?)
- Metaheuristics in combinatorial optimization
- Tabu search and GRASP for the maximum diversity problem
- Evolution-inspired local improvement algorithm solving orienteering problem
- A nonmonotone GRASP
- Greedy randomized adaptive search procedures
- Logic classification and feature selection for biomedical data
- A particle swarm optimization algorithm with path relinking for the location routing problem
- A quadratic simplex algorithm for primal optimization over zero-one polytopes
- GRASP with hybrid heuristic-subproblem optimization for the multi-level capacitated minimum spanning tree problem
- GRASP and path relinking for the max-min diversity problem
- GRASP with path-relinking for the generalized quadratic assignment problem
- scientific article; zbMATH DE number 1703849 (Why is no real title available?)
- A GRASP-based approach for technicians and interventions scheduling for telecommunications
- Packing items to feed assembly lines
- Greedy randomized adaptive search procedures
- Honey bees mating optimization algorithm for large scale vehicle routing problems
- A mathematical program to refine gene regulatory networks
- GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem
- Using scenario trees and progressive hedging for stochastic inventory routing problems
- GRASP with path relinking for three-index assignment
- A hybrid ACO-GRASP algorithm for clustering analysis
- Dependable virtual network mapping
- Probability distribution of solution time in GRASP: an experimental investigation
- GRASP: An annoted bibliography
- Applying multiple objective tabu search to continuous optimization problems with a simple neighbourhood strategy
- A branch-and-cut-and-price approach for the capacitated \(m\)-ring-star problem
- An improved ant colony optimisation heuristic for graph colouring
- GRASP and path relinking for project scheduling under partially renewable resources
- An Integer Programming Formulation for the Maximum k-Subset Intersection Problem
- Some heuristic methods for solving p-median problems with a coverage constraint
- Exact and heuristic algorithms for the maximum weighted submatrix coverage problem
- Scatter search for the cutwidth minimization problem
- A hybrid multi-swarm particle swarm optimization algorithm for the probabilistic traveling salesman problem
- Variable neighbourhood search for the minimum labelling Steiner tree problem
- Expanding neighborhood search-GRASP for the probabilistic traveling salesman problem
- Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach
- GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times
- A multi-threaded local search algorithm and computer implementation for the multi-mode, resource-constrained multi-project scheduling problem
- Solve-and-robustify
- TTT plots: a perl program to create time-to-target plots
- Algorithms for the design of network topologies with balanced disjoint rings
- Restart strategies for GRASP with path-relinking heuristics
- Ant colony system for a dynamic vehicle routing problem
- A greedy randomized adaptive search procedure for the orienteering problem with hotel selection
- Multiobjective GRASP with path relinking
- Local search-based hybrid algorithms for finding Golomb rulers
- Improving Cutting-Stock Plans with Multi-objective Genetic Algorithm
- Greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problem
- Algorithms for single machine total tardiness scheduling with sequence dependent setups
- Global Optimization for 2D SLAM Problem
- Iterated greedy for the maximum diversity problem
- Maximizing breaks and bounding solutions to the mirrored traveling tournament problem
- Probabilistic stopping rules for GRASP heuristics and extensions
- A hybrid stochastic genetic-GRASP algorithm for clustering analysis
- scientific article; zbMATH DE number 709816 (Why is no real title available?)
- An efficient metaheuristic to improve accessibility by rural road network planning
- Bayesian stopping rules for greedy randomized procedures
- Parallel Greedy Randomized Adaptive Search Procedures
- Optimization by GRASP. Greedy randomized adaptive search procedures
- Efficient algorithms for cluster editing
- Embedding signed graphs in the line
- PILOT, GRASP, and VNS approaches for the static balancing of bicycle sharing systems
- Multi-depot vessel routing problem in a direction dependent wavefield
- On the incorporation of adversarial reasoning in course of action analysis and resource allocation
- 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 biased random-key genetic algorithm for data clustering
- Probabilistic GRASP-tabu search algorithms for the UBQP problem
- Reactive GRASP for the prize-collecting covering tour problem
- Towards an efficient resolution of printing problems
- Tabu search for the dynamic bipartite drawing problem
- A GRASP algorithm for solving large-scale single row facility layout problems
- Un algorithme GRASP pour le problème de planification de techniciens et d'interventions pour les télécommunications
- Evolutionary, constructive and hybrid procedures for the bi-objective set packing problem
- Solving the vehicle routing problem with adaptive memory programming methodology
- Bubblesearch: a simple heuristic for improving priority-based greedy algorithms
- A review of hyper-heuristics for educational timetabling
- A hybrid multistart heuristic for the uncapacitated facility location problem
- Scatter search --- wellsprings and challenges
- A GRASP and path relinking heuristic for rural road network development
- A GRASP approach for the extended car sequencing problem
- A hybrid genetic-GRASP algorithm using Lagrangean relaxation for the traveling salesman problem
- Global optimization by continuous grasp
- Parametrized GRASP heuristics for three-index assignment
- An annotated bibliography of GRASP – Part I: Algorithms
- A guided reactive GRASP for the capacitated multi-source Weber problem
- An improved GRASP based circuit partitioning algorithm
- A hybrid data mining metaheuristic for the p‐median problem
- GRASP for set packing problems.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4452897)
