Scatter Search
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Exploring relaxation induced neighborhoods to improve MIP solutions
- Pareto memetic algorithm with path relinking for bi-objective traveling salesperson problem
- The gamma extended Weibull distribution
- \(f\)-flip strategies for unconstrained binary quadratic programming
- Hybrid biobjective evolutionary algorithms for the design of a hospital waste management network
- A scatter search heuristic for the capacitated clustering problem
- Design and analysis of hybrid metaheuristics for the reliability \(p\)-median problem
- A hybrid multistart heuristic for the uncapacitated facility location problem
- Hybrid scatter search and path relinking for the capacitated \(p\)-median problem
- Principles of scatter search
- The \(p\)-median problem: a survey of metaheuristic approaches
- Heuristics for urban road network design: lane layout and signal settings
- Near-optimal solutions for the generalized max-controlled set problem
- CPU Benchmarks
- A benchmark library and a comparison of heuristic methods for the linear ordering problem
- A scatter search-based heuristic to locate capacitated transshipment points
- Meta-heuristic approaches with memory and evolution for a multi-product production/distribution system design problem
- An evolutionary method for complex-process optimization
- Fundamentals of scatter search and path relinking
- Hyperheuristics
- PSPLIB
- GRASP
- TSPLIB
- PERL
- GraphBase
- xQx
- DAGEN
- LSSPER
- RAMP
- CLOVES
- J-MEANS
- EVE-OPT
- PROMETHEE-MD
- COMPASS
- GALib
- OR-Library
- PAES
- NOMADm
- BoneRoute
- GRASP_QAP
- Genocop
- CirCut
- Knapsack
- LKH
- JOBSHOP
- MIPTS
- VRP
- METSlib
- MACS-VRPTW
- OptQuest
- MENU-OKF
- MOD-DIST
- SITATION
- SSPMO
- SDP_S
- TTTPLOTS
- Tabu search
- GPLAB
- AbYSS
- RELAX4
- MIRPLib
- LOLIB
- RanGen
- GOP
- A bi-objective reverse logistics network analysis for post-sale service
- A matheuristic for the truck and trailer routing problem
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
- CEC 05
- Octane
- HAS-QAP
- MOCell
- SimOpt
- DeMat
- npuScheduler
- GPMfit
- eaLib
- Evolvica
- R-SPLINE
- MCPSO
- PARPAP
- QMASM
- Heuristic Solutions to the Facility Location Problem with General Bernoulli Demands
- MATILDA
- outselect
- PortLib
- InstanceSpace
- A fast swap-based local search procedure for location problems
- Scatter search for the stochastic travel-time vehicle routing problem with simultaneous pick-ups and deliveries
- A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems
- An evolutionary approach for the nurse rerostering problem
- Scatter search for the single source capacitated facility location problem
- Metaheuristic applications on discrete facility location problems: a survey
- Path relinking for unconstrained binary quadratic programming
- A particle swarm optimization algorithm with path relinking for the location routing problem
- Experimental investigation of heuristics for resource-constrained project scheduling: an update
- Solving two location models with few facilities by using a hybrid heuristic: a real health resources case
- VNS heuristic
- Hybrid evolutionary search for the minimum sum coloring problem of graphs
- A hybrid metaheuristic method for the maximum diversity problem
- A review of metrics on permutations for search landscape analysis
This page was built for software: Scatter Search
