scientific article

Publication date: 8 July 2002

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

combinatorial optimization metaheuristic greedy randomized adaptive search procedure annotated bibliography

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to operations research and mathematical programming (90-00)

Related Items (57)

Quadratic bottleneck knapsack problems ⋮ A review of hyper-heuristics for educational timetabling ⋮ A combinatorial algorithm for the TDMA message scheduling problem ⋮ Logic based methods for SNPs tagging and reconstruction ⋮ Solution approaches for the vehicle routing problem with occasional drivers and time windows ⋮ 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 ⋮ Community detection by modularity maximization using GRASP with path relinking ⋮ A hybrid Lagrangean heuristic with GRASP and path-relinking for set \(k\)-covering ⋮ Multi-directional local search ⋮ A nonmonotone GRASP ⋮ The constrained shortest path tour problem ⋮ 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 ⋮ Efficient approaches for the flooding problem on graphs ⋮ Hybrid Metaheuristics: An Introduction ⋮ A sequential GRASP for the therapist routing and scheduling problem ⋮ Multi-depot vessel routing problem in a direction dependent wavefield ⋮ The constrained forward shortest path tour problem: Mathematical modeling and GRASP approximate solutions ⋮ MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems ⋮ Bayesian stopping rules for greedy randomized procedures ⋮ A biased random-key genetic algorithm for data clustering ⋮ GRASP for set packing problems. ⋮ Tabu search versus GRASP for the maximum diversity problem ⋮ Logic classification and feature selection for biomedical data ⋮ Simulation-based rolling horizon scheduling for operating theatres ⋮ Global optimization by continuous grasp ⋮ Balancing and scheduling tasks in assembly lines with sequence-dependent setup times ⋮ 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 GRASP-based approach for technicians and interventions scheduling for telecommunications ⋮ Sequential search and its application to vehicle-routing problems ⋮ Heuristics for multi-stage interdiction of stochastic networks ⋮ A scatter search algorithm for project scheduling under partially renewable resources ⋮ Speeding up continuous GRASP ⋮ GRASP with hybrid heuristic-subproblem optimization for the multi-level capacitated minimum spanning tree problem ⋮ A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem. ⋮ An efficient exact approach for the constrained shortest path tour problem ⋮ Solving systems of nonlinear equations with continuous GRASP ⋮ Un algorithme GRASP pour le problème de planification de techniciens et d'interventions pour les télécommunications ⋮ A bus driver scheduling problem: A new mathematical model and a GRASP approximate solution ⋮ GRASP with path-relinking for the generalized quadratic assignment problem ⋮ 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 ⋮ A GRASP and path relinking heuristic for rural road network development ⋮ Towards an efficient resolution of printing problems ⋮ A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem ⋮ The maximum balanced subgraph of a signed graph: applications and solution approaches ⋮ Metaheuristics in combinatorial optimization

Uses Software

Unnamed Item

This page was built for publication: