scientific article; zbMATH DE number 2050708
From MaRDI portal
Publication:4452897
Recommendations
Cited in
(only showing first 100 items - show all)- 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.
- A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems
- Location-arc routing problem: heuristic approaches and test instances
- Making a state-of-the-art heuristic faster with data mining
- A survey of search methodologies and automated system development for examination timetabling
- Logic based methods for SNPs tagging and reconstruction
- Heuristics for the mirrored traveling tournament problem
- A reactive grasp for transmission network expansion planning
- Region-rejection based heuristics for the capacitated multi-source Weber problem
- Models and algorithms for reliability-oriented dial-a-ride with autonomous electric vehicles
- Domain reduction using GRASP construction phase for transmission expansion planning problem
- A robust P2P streaming architecture and its application to a high quality live-video service
- A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
- Meta-heuristics and artificial intelligence
- A Greedy Randomized Adaptive Search Procedure for the Two-Partition Problem
- A multi-objective GRASP procedure for reactive power compensation planning
- Using a greedy random adaptative search procedure to solve the cover printing problem
- Two-machine flow shop problems with a single server
- Quadratic bottleneck knapsack problems
- A hybrid Lagrangean heuristic with GRASP and path-relinking for set k-covering
- A tabu search approach for solving a difficult forest harvesting machine location problem
- Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
- A metaheuristic algorithm and structured analysis for the Line-haul Feeder vehicle routing problem with time windows
- Valid inequalities, preprocessing, and an effective heuristic for the uncapacitated three-level lot-sizing and replenishment problem with a distribution structure
- The Boolean quadratic programming problem with generalized upper bound constraints
- A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm
- A route set construction algorithm for the transit network design problem
- Speeding up continuous GRASP
- Emergency response in natural disaster management: allocation and scheduling of rescue units
- Container sequencing for quay cranes with internal reshuffles
- A hybrid genetic algorithm for the weight setting problem in OSPF/IS‐IS routing
- A survey on optimization metaheuristics
- Heuristics for the generalized median graph problem
- Orienteering problem: a survey of recent variants, solution approaches and applications
- Capacitated m two-node survivable star problem
- Generalized route planning model for hazardous material transportation with VaR and equity considerations
- Branch and bound for the cutwidth minimization problem
- Stability evaluation of a railway timetable at station level
- Reactive GRASP for the strip-packing problem
- Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling
- Balancing and scheduling tasks in assembly lines with sequence-dependent setup times
- Computing minimum dilation spanning trees in geometric graphs
- Expanding neighborhood GRASP for the traveling salesman problem
- An effective solution for a real cutting stock problem in manufacturing plastic rolls
- A combinatorial algorithm for the TDMA message scheduling problem
- The assembly line balancing and scheduling problem with sequence-dependent setup times: problem extension, model formulation and efficient heuristics
- Variable neighbourhood search for the \(k\)-labelled spanning forest problem
- A GRASP metaheuristic for microarray data analysis
- 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
- GRASP and path relinking for the equitable dispersion problem
- GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem
- A GRASP algorithm to solve the unicost set covering problem
- The synchronized arc and node routing problem: application to road marking
- Power optimization in ad hoc wireless network topology control with biconnectivity requirements
- Minimizing weighted earliness-tardiness on parallel machines using hybrid metaheuristics
- Iterated local search based on multi-type perturbation for single-machine earliness/tardiness scheduling
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)
