Cited in
(only showing first 100 items - show all)- Adaptive memory programming for matrix bandwidth minimization
- Local search-based hybrid algorithms for finding Golomb rulers
- Scatter Search and Path Relinking: Advances and Applications
- Teams of global equilibrium search algorithms for solving the weighted maximum cut problem in parallel
- A simple filter-and-fan approach to the facility location problem
- A simulation-optimization approach for integrated sourcing and inventory decisions
- Path relinking and GRG for artificial neural networks
- A hybrid scatter search/electromagnetism meta-heuristic for project scheduling
- Continuous scatter search: an analysis of the integration of some combination methods and improvement strategies
- Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking
- Scatter search for project scheduling with resource availability cost
- Evaluation of multitype mathematical models for CFSE-labeling experiment data
- An iterative path-breaking approach with mutation and restart strategies for the MAX-SAT problem
- A cooperative parallel tabu search algorithm for the quadratic assignment problem
- Metaheuristic applications on discrete facility location problems: a survey
- Tabu search -- uncharted domains
- The linear ordering problem with clusters: a new partial ranking
- A branch and bound algorithm for the matrix bandwidth minimization
- A scatter search approach for the minimum sum-of-squares clustering problem
- A bill of materials-based approach for end-of-life decision making in design for the environment
- ``MOSS multiobjective scatter search applied to nonlinear multiple criteria optimization
- A path relinking approach with ejection chains for the generalized assignment problem
- Genetic local search for multi-objective flowshop scheduling problems
- Scatter search for the vehicle routing problem with time windows
- Comparing metaheuristic algorithms for SONET network design problems
- The scatter search based algorithm for beam angle optimization in intensity-modulated radiation therapy
- Minimizing weighted tardiness of jobs with stochastic interruptions in parallel machines
- A novel hybrid multi-objective algorithm to solve the generalized cubic cell formation problem
- The gamma extended Weibull distribution
- f-flip strategies for unconstrained binary quadratic programming
- Multiple phase neighborhood search---GRASP based on Lagrangean relaxation, random backtracking Lin-Kernighan and path relinking for the TSP
- An unconstrained quadratic binary programming approach to the vertex coloring problem
- GRASP with path relinking heuristics for the antibandwidth problem
- Methods to compare expensive stochastic optimization algorithms with random restarts
- Robust optimization models for project scheduling with resource availability cost
- Experimental investigation of heuristics for resource-constrained project scheduling: an update
- Quantum bridge analytics. I: A tutorial on formulating and using QUBO models
- Enhanced multi-directional local search for the bi-objective heterogeneous vehicle routing problem with multiple driving ranges
- The use of frontier techniques to identify efficient solutions for the berth allocation problem solved with a hybrid evolutionary algorithm
- A comparison of algorithms for finding an efficient theme park tour
- About extracting dynamic information of unknown complex systems by neural networks
- A project portfolio selection problem in a group decision-making context
- Soft car sequencing with colors: lower bounds and optimality proofs
- Memetic self-adaptive evolution strategies applied to the maximum diversity problem
- An empirical study of learning speed in back-propagation networks
- A heuristic for the stability number of a graph based on convex quadratic programming and tabu search
- Two-level evolutionary approach to the survivable mesh-based transport network topological design
- Solving the vehicle routing problem with adaptive memory programming methodology
- Multilayer neural networks: an experimental evaluation of on-line training methods
- A hybrid multistart heuristic for the uncapacitated facility location problem
- Scatter search --- wellsprings and challenges
- Memetic algorithms
- A GRASP and path relinking heuristic for rural road network development
- The \(p\)-median problem: a survey of metaheuristic approaches
- Landscape analysis and efficient metaheuristics for solving the \(n\)-queens 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
- Heuristic Solutions to the Facility Location Problem with General Bernoulli Demands
- New heuristic algorithms for the windy rural postman problem
- A new bi-objective fuzzy portfolio selection model and its solution through evolutionary algorithms
- Scatter search for the single source capacitated facility location problem
- Adaptive memory programming for the robust capacitated international sourcing problem
- A benchmark library and a comparison of heuristic methods for the linear ordering problem
- Path relinking approach for multiple allocation hub maximal covering problem
- An evolutionary method for complex-process optimization
- Bilayer local search enhanced particle swarm optimization for the capacitated vehicle routing problem
- Quantum bridge analytics. I: A tutorial on formulating and using QUBO models
- An empirical investigation on parallelization strategies for scatter search
- A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems
- An evolutionary approach for the nurse rerostering problem
- Hybridizations of GRASP with path relinking for the far from most string problem
- Scatter search for minimizing weighted tardiness in a single machine scheduling with setups
- A hybrid adaptive iterated local search with diversification control to the capacitated vehicle routing problem
- Pareto memetic algorithm with path relinking for bi-objective traveling salesperson problem
- Effective metaheuristic algorithms for the minimum differential dispersion problem
- An effective heuristic for project scheduling with resource availability cost
- Dynamic optimisation of preventative and corrective maintenance schedules for a large scale urban drainage system
- A hybrid particle swarm optimization -- variable neighborhood search algorithm for constrained shortest path problems
- A parallel evolutionary multiple-try Metropolis Markov chain Monte Carlo algorithm for sampling spatial partitions
- Estimation of constant and time-varying dynamic parameters of HIV infection in a nonlinear differential equation model
- A hybrid meta-heuristic for the batching problem in just-in-time flow shops
- A scatter search algorithm for the distributed permutation flowshop scheduling problem
- A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems
- Making a state-of-the-art heuristic faster with data mining
- Scatter search in software testing, comparison and collaboration with estimation of distribution algorithms
- Parallel metaheuristics for workforce planning
- Variable neighborhood scatter search for the incremental graph drawing problem
- Using resource scarceness characteristics to solve the multi-mode resource-constrained project scheduling problem
- Artificial life techniques for load balancing in computational grids
- Hybrid algorithms for placement of virtual machines across geo-separated data centers
- A hybrid scatter search heuristic for personalized crew rostering in the airline industry
- Near-optimal solutions for the generalized max-controlled set problem
- Hybrid heuristics for the maximum diversity problem
- Clustered enhanced differential evolution for the blocking flow shop scheduling problem
- Metaheuristics for solving a multimodal home-healthcare scheduling problem
- Multi-neighborhood based path relinking for two-sided assembly line balancing problem
- An acquisition policy for a multi-supplier system with a finite-time horizon
- Scatter search for the stochastic travel-time vehicle routing problem with simultaneous pick-ups and deliveries
- Path relinking for the vehicle routing problem
- A DE-based scatter search for global optimization problems
This page was built for software: Scatter Search
