swMATH5291MaRDI QIDQ17431FDOQ17431
Author name not available (Why is that?)
Official website: http://plato.asu.edu/ftp/other_software/SS.zip
Cited In (only showing first 100 items - show all)
- Teams of global equilibrium search algorithms for solving the weighted maximum cut problem in parallel
- Scatter search for project scheduling with resource availability cost
- Evaluation of multitype mathematical models for CFSE-labeling experiment data
- Tabu search -- uncharted domains
- An unconstrained quadratic binary programming approach to the vertex coloring problem
- Robust optimization models for project scheduling with resource availability cost
- Soft car sequencing with colors: lower bounds and optimality proofs
- Solving the vehicle routing problem with adaptive memory programming methodology
- Scatter search --- wellsprings and challenges
- A GRASP and path relinking heuristic for rural road network development
- A new bi-objective fuzzy portfolio selection model and its solution through evolutionary algorithms
- Path relinking approach for multiple allocation hub maximal covering problem
- An empirical investigation on parallelization strategies for scatter search
- Hybridizations of GRASP with path relinking for the far from most string problem
- Estimation of constant and time-varying dynamic parameters of HIV infection in a nonlinear differential equation model
- LVB
- Hybrid heuristics for the maximum diversity problem
- Path relinking for the vehicle routing problem
- A DE-based scatter search for global optimization problems
- Solving feature subset selection problem by a parallel scatter search
- A multi-objective capacitated rural school bus routing problem with heterogeneous fleet and mixed loads
- Robust min-max regret covering problems
- Omni-optimizer
- Scatter search for the 0-1 multidimensional knapsack problem
- Analysis of new variable selection methods for discriminant analysis
- A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem
- A primogenitary linked quad tree approach for solution storage and retrieval in heuristic binary optimization
- Parametric tabu-search for mixed integer programs
- A hybrid scatter search for the probabilistic traveling salesman problem
- Metaheuristics in combinatorial optimization
- Diversified local search strategy under scatter search framework for the probabilistic traveling salesman problem
- Hybrid evolutionary algorithm for solving general variational inequality problems
- A hybrid three-phase approach for the Max-Mean dispersion problem
- A filter-and-fan approach with adaptive neighborhood switching for resource-constrained project scheduling
- Hybrid method with CS and BRKGA applied to the minimization of tool switches problem
- A tabu search based memetic algorithm for the Max-Mean dispersion problem
- Improved scatter search for the global optimization of computationally expensive dynamic models
- Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion
- Variable neighborhood search for the linear ordering problem
- Continuous optimization via simulation using golden region search
- A filter-and-fan approach to the 2D HP model of the protein folding problem
- A multiobjective model for forest planning with adjacency constraints
- A unified framework for population-based metaheuristics
- Looking ahead with the pilot method
- An exact cooperative method for the uncapacitated facility location problem
- A filter-and-fan approach to the job shop scheduling problem
- Solving the resource-constrained project scheduling problem using filter-and-fan approach
- Time series forecasting with a nonlinear model and the scatter search meta-heuristic
- An improved migrating birds optimisation for a hybrid flowshop scheduling with total flowtime minimisation
- A chaos-based evolutionary algorithm for general nonlinear programming problems
- A metaheuristic for a numerical approximation to the mass transfer problem
- Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method
- A solution procedure for the discrete time, cost and quality tradeoff problem using electromagnetic scatter search
- Restart strategies for GRASP with path-relinking heuristics
- Problems of discrete optimization: challenges and main approaches to solve them
- Scatter Search and Path Relinking: Advances and Applications
- Local search-based hybrid algorithms for finding Golomb rulers
- Scatter search for the bandpass problem
- Adaptive memory programming for matrix bandwidth minimization
- A simple filter-and-fan approach to the facility location problem
- A simulation-optimization approach for integrated sourcing and inventory decisions
- 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
- A cooperative parallel tabu search algorithm for the quadratic assignment problem
- A branch and bound algorithm for the matrix bandwidth minimization
- A scatter search approach for the minimum sum-of-squares clustering problem
- ``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
- GRASP with path relinking heuristics for the antibandwidth 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
- Tabu search with path relinking for an integrated production-distribution problem
- Vehicle routing with compartments: applications, modelling and heuristics
- A reactive GRASP with path relinking for capacitated clustering
- The evaluation of pedestrians' behavior using \(M/G/C/C\) analytical, weighted distance and real distance simulation models
- Anytime Pareto local search
- Decomposition based hybrid metaheuristics
- A multi-layer line search method to improve the initialization of optimization algorithms
- A hybrid Lagrangean heuristic with GRASP and path-relinking for set \(k\)-covering
- Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems
- Network capacity control using self-adjusting bid-prices
- Lagrangian heuristics for the capacitated multi-plant lot sizing problem with multiple periods and items
- A review of metrics on permutations for search landscape analysis
- A GA based heuristic for the vehicle routing problem with multiple trips
- Collaborative production planning of supply chain under price and demand uncertainty
- Industrial aspects and literature survey: fleet composition and routing
- A survey on optimization metaheuristics
- Models and solution procedures for the resource-constrained project scheduling problem with general temporal constraints and calendars
- Forward thresholds for operation of pumped-storage stations in the real-time energy market
- Scatter search for the fleet size and mix vehicle routing problem with time windows
- Branch-and-price algorithms for the two-echelon capacitated vehicle routing problem
- A survey on metaheuristics for stochastic combinatorial optimization
- Scatter search for network design problem
- Scatter search and bionomic algorithms for the aircraft landing problem
- SearchCol
- Integrated exact, hybrid and metaheuristic learning methods for confidentiality protection
This page was built for software: Scatter Search
