scientific article; zbMATH DE number 2050708
From MaRDI portal
Publication:4452897
Recommendations
Cited in
(only showing first 100 items - show all)- Region-rejection based heuristics for the capacitated multi-source Weber problem
- A route set construction algorithm for the transit network design problem
- Heuristics for the bi-objective path dissimilarity problem
- A mathematical program to refine gene regulatory networks
- An effective solution for a real cutting stock problem in manufacturing plastic rolls
- Greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problem
- A hybrid multi-swarm particle swarm optimization algorithm for the probabilistic traveling salesman problem
- GRASP and path relinking for the max-min diversity problem
- 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
- Using scenario trees and progressive hedging for stochastic inventory routing problems
- Bubblesearch: a simple heuristic for improving priority-based greedy algorithms
- GRASP for set packing problems.
- Making a state-of-the-art heuristic faster with data mining
- The Boolean quadratic programming problem with generalized upper bound constraints
- Tabu search for the dynamic bipartite drawing problem
- Solving large-scale TSP using a fast wedging insertion partitioning approach
- A GRASP algorithm for solving large-scale single row facility layout problems
- Parametrized GRASP heuristics for three-index assignment
- A multi-threaded local search algorithm and computer implementation for the multi-mode, resource-constrained multi-project scheduling problem
- Models and algorithms for reliability-oriented dial-a-ride with autonomous electric vehicles
- A branch-and-cut-and-price approach for the capacitated \(m\)-ring-star problem
- Scatter search for the cutwidth minimization problem
- Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling
- Solving the vehicle routing problem with adaptive memory programming methodology
- Greedy randomized adaptive search procedures
- Probability distribution of solution time in GRASP: an experimental investigation
- Some heuristic methods for solving p-median problems with a coverage constraint
- The assembly line balancing and scheduling problem with sequence-dependent setup times: problem extension, model formulation and efficient heuristics
- GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times
- A metaheuristic algorithm and structured analysis for the Line-haul Feeder vehicle routing problem with time windows
- Exact and heuristic algorithms for the maximum weighted submatrix coverage problem
- Valid inequalities, preprocessing, and an effective heuristic for the uncapacitated three-level lot-sizing and replenishment problem with a distribution structure
- Embedding signed graphs in the line
- A multi-objective GRASP procedure for reactive power compensation planning
- Emergency response in natural disaster management: allocation and scheduling of rescue units
- Variable neighbourhood search for the minimum labelling Steiner tree problem
- Algorithms for the design of network topologies with balanced disjoint rings
- Solve-and-robustify
- A hybrid heuristic for the diameter constrained minimum spanning tree problem
- GRASP with hybrid heuristic-subproblem optimization for the multi-level capacitated minimum spanning tree problem
- Iterated greedy for the maximum diversity problem
- A greedy randomized adaptive search procedure for the orienteering problem with hotel selection
- Towards an efficient resolution of printing problems
- Quadratic bottleneck knapsack problems
- Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach
- Stability evaluation of a railway timetable at station level
- Logic based methods for SNPs tagging and reconstruction
- Packing items to feed assembly lines
- Local search-based hybrid algorithms for finding Golomb rulers
- Evolution-inspired local improvement algorithm solving orienteering problem
- Algorithms for single machine total tardiness scheduling with sequence dependent setups
- Bayesian stopping rules for greedy randomized procedures
- A biased random-key genetic algorithm for data clustering
- Global optimization by continuous grasp
- A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm
- Optimal placement of stereo sensors
- Balancing and scheduling tasks in assembly lines with sequence-dependent setup times
- TTT plots: a perl program to create time-to-target plots
- An improved ant colony optimisation heuristic for graph colouring
- A particle swarm optimization algorithm with path relinking for the location routing problem
- GRASP and path relinking for project scheduling under partially renewable resources
- Expanding neighborhood GRASP for the traveling salesman problem
- Maximizing breaks and bounding solutions to the mirrored traveling tournament problem
- Dependable virtual network mapping
- Scatter search --- wellsprings and challenges
- A GRASP and path relinking heuristic for rural road network development
- A hybrid genetic-GRASP algorithm using Lagrangean relaxation for the traveling salesman problem
- Ant colony system for a dynamic vehicle routing problem
- Multiobjective GRASP with path relinking
- Variable neighbourhood search for the k-labelled spanning forest problem
- Evolutionary, constructive and hybrid procedures for the bi-objective set packing problem
- Neighborhood decomposition-driven variable neighborhood search for capacitated clustering
- scientific article; zbMATH DE number 1703849 (Why is no real title available?)
- A reactive grasp for transmission network expansion planning
- GRASP: An annoted bibliography
- A review of hyper-heuristics for educational timetabling
- An efficient metaheuristic to improve accessibility by rural road network planning
- GRASP with path relinking for three-index assignment
- Domain reduction using GRASP construction phase for transmission expansion planning problem
- Optimization by GRASP. Greedy randomized adaptive search procedures
- An Integer Programming Formulation for the Maximum k-Subset Intersection Problem
- Computing minimum dilation spanning trees in geometric graphs
- 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
- The synchronized arc and node routing problem: application to road marking
- A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems
- GRASP and path relinking for the equitable dispersion problem
- Probabilistic GRASP-tabu search algorithms for the UBQP problem
- A GRASP metaheuristic for microarray data analysis
- 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
- Generalized route planning model for hazardous material transportation with VaR and equity considerations
- Location-arc routing problem: heuristic approaches and test instances
- 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)
