GRASP
From MaRDI portal
Software:13838
No author found.
Related Items (only showing first 100 items - show all)
Quadratic bottleneck knapsack problems ⋮ GRASP with Path Relinking for Three-Index Assignment ⋮ A review of hyper-heuristics for educational timetabling ⋮ Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem ⋮ Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach ⋮ A combinatorial algorithm for the TDMA message scheduling problem ⋮ Advanced Scatter Search for the Max-Cut Problem ⋮ Heuristics for the constrained incremental graph drawing problem ⋮ A Python/C library for bound-constrained global optimization with continuous GRASP ⋮ Making a state-of-the-art heuristic faster with data mining ⋮ Logic based methods for SNPs tagging and reconstruction ⋮ A GRASP with penalty objective function for the green vehicle routing problem with private capacitated stations ⋮ Integer programming models for feature selection: new extensions and a randomized solution algorithm ⋮ Heuristics for the generalized median graph problem ⋮ Packing items to feed assembly lines ⋮ An efficient GRASP algorithm for disassembly sequence planning ⋮ On some optimization problems in molecular biology ⋮ A parallel hybrid greedy branch and bound scheme for the maximum distance-2 matching problem ⋮ A hybrid Lagrangean heuristic with GRASP and path-relinking for set \(k\)-covering ⋮ A hybrid data mining GRASP with path-relinking ⋮ A GRASP with path-relinking heuristic for the survivable IP/MPLS-over-WSON multi-layer network optimization problem ⋮ Power optimization in ad hoc wireless network topology control with biconnectivity requirements ⋮ GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem ⋮ 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 ⋮ Branch and bound for the cutwidth minimization problem ⋮ Multi-directional local search ⋮ A nonmonotone GRASP ⋮ The constrained shortest path tour problem ⋮ A GRASP for simultaneously assigning and sequencing product families on flexible assembly lines ⋮ Heuristics for the mirrored traveling tournament problem ⋮ On the number of local minima for the multidimensional assignment problem ⋮ Evolutionary, constructive and hybrid procedures for the bi-objective set packing problem ⋮ A GRASP algorithm to solve the unicost set covering problem ⋮ Efficient approaches for the flooding problem on graphs ⋮ The leader multipurpose shopping location problem ⋮ Tabu search and GRASP for the capacitated clustering problem ⋮ GRASP with strategic oscillation for the \(\alpha \)-neighbor \(p\)-center problem ⋮ Hybrid Metaheuristics: An Introduction ⋮ A sequential GRASP for the therapist routing and scheduling problem ⋮ The multi-vehicle cumulative covering tour problem ⋮ Multi-depot vessel routing problem in a direction dependent wavefield ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Revised GRASP with path-relinking for the linear ordering problem ⋮ Combining probabilistic algorithms, constraint programming and Lagrangian relaxation to solve the vehicle routing problem ⋮ Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem ⋮ MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems ⋮ A metaheuristic for security budget allocation in utility networks ⋮ Bayesian stopping rules for greedy randomized procedures ⋮ A biased random-key genetic algorithm for data clustering ⋮ GRASP for set packing problems. ⋮ A GRASP metaheuristic to improve accessibility after a disaster ⋮ Tabu search versus GRASP for the maximum diversity problem ⋮ GRASP and VNS for solving the \(p\)-next center problem ⋮ Logic classification and feature selection for biomedical data ⋮ Simulation-based rolling horizon scheduling for operating theatres ⋮ A GRASP heuristic for slab scheduling at continuous casters ⋮ Global optimization by continuous grasp ⋮ A GRASP algorithm for the multi-criteria minimum spanning tree problem ⋮ Expanding neighborhood search-GRASP for the probabilistic traveling salesman problem ⋮ A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives ⋮ A survey on optimization metaheuristics ⋮ Balancing and scheduling tasks in assembly lines with sequence-dependent setup times ⋮ A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem ⋮ Restart strategies for GRASP with path-relinking heuristics ⋮ GRASP and path relinking for project scheduling under partially renewable resources ⋮ Efficient solutions for the far from most string problem ⋮ A GRASP algorithm for the closest string problem using a probability-based heuristic ⋮ A multi-product production/distribution system design problem with direct shipments and lateral transshipments ⋮ A GRASP-based approach for technicians and interventions scheduling for telecommunications ⋮ Sequential search and its application to vehicle-routing problems ⋮ A scheduling problem with unrelated parallel machines and sequence dependent setups ⋮ Expanding neighborhood GRASP for the traveling salesman problem ⋮ Heuristics for multi-stage interdiction of stochastic networks ⋮ A scatter search algorithm for project scheduling under partially renewable resources ⋮ Greedy random adaptive memory programming search for the capacitated clustering problem ⋮ Speeding up continuous GRASP ⋮ GRASP with hybrid heuristic-subproblem optimization for the multi-level capacitated minimum spanning tree problem ⋮ Flow shop scheduling problem with position-dependent processing times ⋮ Hybridizations of GRASP with path relinking for the far from most string problem ⋮ Using GRASP to solve the unit commitment problem ⋮ A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem. ⋮ A bus driver scheduling problem: A new mathematical model and a GRASP approximate solution ⋮ GRASP with path-relinking for the generalized quadratic assignment problem ⋮ Queueing maximal covering location-allocation problem: an extension with \textit{M/G/1} queueing systems ⋮ On location-allocation problems for dimensional facilities ⋮ 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 ⋮ Algorithms for Sparsity-Constrained Optimization ⋮ A GRASP and path relinking heuristic for rural road network development ⋮ Diversification strategies in local search for a nonbifurcated network loading problem ⋮ Probability distribution of solution time in GRASP: an experimental investigation ⋮ Towards an efficient resolution of printing problems ⋮ A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem ⋮ An approach for efficient ship routing ⋮ An efficient GRASP-like algorithm for the multi-product straight pipeline scheduling problem ⋮ The maximum balanced subgraph of a signed graph: applications and solution approaches ⋮ Metaheuristics in combinatorial optimization
This page was built for software: GRASP
