swMATH1094MaRDI QIDQ13838FDOQ13838
Author name not available (Why is that?)
Official website: http://www2.research.att.com/~mgcr/grasp/gannbib/gannbib.html
Cited In (only showing first 100 items - show all)
- Graph domination, coloring and cliques in telecommunications
- Exploring grid implementations of parallel cooperative metaheuristics
- GRASP and VNS for solving the \(p\)-next center problem
- A sequential GRASP for the therapist routing and scheduling problem
- Diversification strategies in local search for a nonbifurcated network loading problem
- An approach for efficient ship routing
- Multi-depot vessel routing problem in a direction dependent wavefield
- A scheduling problem with unrelated parallel machines and sequence dependent setups
- Heuristics for multi-stage interdiction of stochastic networks
- Sequential search and its application to vehicle-routing problems
- Towards an efficient resolution of printing problems
- Combining probabilistic algorithms, constraint programming and Lagrangian relaxation to solve the vehicle routing problem
- A GRASP and path relinking heuristic for rural road network development
- Queueing maximal covering location-allocation problem: an extension with \textit{M/G/1} queueing systems
- Global optimization by continuous grasp
- An efficient GRASP algorithm for disassembly sequence planning
- Title not available (Why is that?)
- An efficient exact approach for the constrained shortest path tour problem
- Tabu search and GRASP for the capacitated clustering problem
- A hybrid data mining metaheuristic for the p‐median problem
- Hybridizations of GRASP with path relinking for the far from most string problem
- Strategies for the parallel implementation of metaheuristics
- Heuristics for the constrained incremental graph drawing problem
- Making a state-of-the-art heuristic faster with data mining
- Logic based methods for SNPs tagging and reconstruction
- Linear programming based meta-heuristics for the weighted maximal planar graph
- The maximum balanced subgraph of a signed graph: applications and solution approaches
- Using a greedy random adaptative search procedure to solve the cover printing problem
- Quadratic bottleneck knapsack problems
- A combined multistart random constructive heuristic and set partitioning based formulation for the vehicle routing problem with time dependent travel times
- Intelligent-guided adaptive search for the maximum covering location problem
- Using GRASP to solve the unit commitment problem
- A GRASP algorithm for the closest string problem using a probability-based heuristic
- The multi-vehicle cumulative covering tour problem
- A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem
- A GRASP heuristic for slab scheduling at continuous casters
- Improved heuristics for the regenerator location problem
- Metaheuristics in combinatorial optimization
- Guided construction search metaheuristics for the capacitated p-median problem with single source constraint
- A nonmonotone GRASP
- The constrained shortest path tour problem
- The Network Packing Problem in Terrestrial Broadcasting
- ON THE PERFORMANCE OF HEURISTICS FOR BROADCAST SCHEDULING
- Algorithms for sparsity-constrained optimization
- Packing items to feed assembly lines
- A GRASP-based approach for technicians and interventions scheduling for telecommunications
- ALNS
- A GRASP algorithm for the multi-criteria minimum spanning tree problem
- Tabu search versus GRASP for the maximum diversity problem
- MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems
- GRASP and path relinking for project scheduling under partially renewable resources
- Title not available (Why is that?)
- On location-allocation problems for dimensional facilities
- Expanding neighborhood search-GRASP for the probabilistic traveling salesman problem
- Restart strategies for GRASP with path-relinking heuristics
- SciMAT
- Bayesian stopping rules for greedy randomized procedures
- Comparison of metaheuristics for the \(k\)-labeled spanning forest problem
- An efficient GRASP-like algorithm for the multi-product straight pipeline scheduling problem
- Communication Models for a Cooperative Network of Autonomous Agents
- Un algorithme GRASP pour le problème de planification de techniciens et d'interventions pour les télécommunications
- A multi-product production/distribution system design problem with direct shipments and lateral transshipments
- The leader multipurpose shopping location problem
- Flow shop scheduling problem with position-dependent processing times
- A metaheuristic for security budget allocation in utility networks
- A GRASP with penalty objective function for the green vehicle routing problem with private capacitated stations
- A GRASP for simultaneously assigning and sequencing product families on flexible assembly lines
- Experimental and Efficient Algorithms
- Remark on Algorithm 815
- GRASP with strategic oscillation for the \(\alpha \)-neighbor \(p\)-center problem
- Efficient approaches for the flooding problem on graphs
- Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem
- Solution approaches for the vehicle routing problem with occasional drivers and time windows
- A distributed and hierarchical strategy for autonomic grid-enabled cooperative metaheuristics with applications
- Probabilistic stopping rules for GRASP heuristics and extensions
- A scatter search algorithm for project scheduling under partially renewable resources
- A Python/C library for bound-constrained global optimization with continuous GRASP
- A biased random-key genetic algorithm for data clustering
- Advanced scatter search for the max-cut problem
- On some optimization problems in molecular biology
- Evolutionary, constructive and hybrid procedures for the bi-objective set packing problem
- An annotated bibliography of GRASP-Part II: Applications
- A grasp interactive approach to the vehicle routing problem with backhauls
- Locating emergency services with different priorities: the priority queuing covering location problem
- A review of hyper-heuristics for educational timetabling
- An annotated bibliography of GRASP – Part I: Algorithms
- Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighbourhood search
- Applications of the DM‐GRASP heuristic: a survey
- GRASP for set packing problems.
- Heuristics for the mirrored traveling tournament problem
- Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem
- Randomized heuristics for the Max-Cut problem
- A hybrid Lagrangean heuristic with GRASP and path-relinking for set \(k\)-covering
- Multi-directional local search
- On the number of local minima for the multidimensional assignment problem
- Speeding up continuous GRASP
- A survey on optimization metaheuristics
- Solving a bus driver scheduling problem with randomized multistart heuristics
- Integer programming models for feature selection: new extensions and a randomized solution algorithm
- Heuristics for the generalized median graph problem
This page was built for software: GRASP
