The following pages link to Principles of scatter search (Q2570141):
Displaying 50 items.
- Metaheuristic applications on discrete facility location problems: a survey (Q260627) (← links)
- A scatter search algorithm for the distributed permutation flowshop scheduling problem (Q297245) (← links)
- Global optimization using \(q\)-gradients (Q322763) (← links)
- Forward thresholds for operation of pumped-storage stations in the real-time energy market (Q323325) (← links)
- GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem (Q336743) (← links)
- Scatter search for an uncapacitated \(p\)-hub median problem (Q337508) (← links)
- Using resource scarceness characteristics to solve the multi-mode resource-constrained project scheduling problem (Q415556) (← links)
- Turning restriction design in traffic networks with a budget constraint (Q486412) (← links)
- A new hybrid algorithm of scatter search and Nelder-Mead algorithms to optimize joint economic lot sizing problem (Q495077) (← links)
- A metaheuristic for a numerical approximation to the mass transfer problem (Q511366) (← links)
- Implementation of scatter search for multi-objective optimization: a comparative study (Q632390) (← links)
- Tabu search with path relinking for an integrated production-distribution problem (Q632656) (← links)
- An evolutionary approach for the nurse rerostering problem (Q632687) (← links)
- A unified framework for population-based metaheuristics (Q646652) (← links)
- A multi-objective quantity discount and joint optimization model for coordination of a single-buyer multi-vendor supply chain (Q662246) (← links)
- Scatter search algorithm for supplier selection and order lot sizing under multiple price discount environment (Q834195) (← links)
- A hybrid meta-heuristic for the batching problem in just-in-time flow shops (Q864936) (← links)
- A scatter search-based heuristic to locate capacitated transshipment points (Q878590) (← links)
- Robust optimization models for project scheduling with resource availability cost (Q880580) (← links)
- A multi-objective scatter search for a dynamic cell formation problem (Q955612) (← links)
- Path relinking approach for multiple allocation hub maximal covering problem (Q971739) (← links)
- Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion (Q976399) (← links)
- A hybrid scatter search heuristic for personalized crew rostering in the airline industry (Q976415) (← links)
- The evolution of cell formation problem methodologies based on recent studies (1997-2008): Review and directions for future research (Q976478) (← links)
- A hybrid of the restarted Arnoldi and electromagnetism meta-heuristic methods for calculating eigenvalues and eigenvectors of a non-symmetric matrix (Q990403) (← links)
- GRASP and path relinking for the max-min diversity problem (Q1038285) (← links)
- Design of sensor networks for chemical plants based on meta-heuristics (Q1662455) (← links)
- Capital- and resource-constrained project scheduling with net present value optimization (Q1752257) (← links)
- Attractive orienteering problem with proximity and timing interactions (Q1754098) (← links)
- Multiobjective scatter search for a commercial territory design problem (Q1761773) (← links)
- A simple and effective evolutionary algorithm for the vehicle routing problem (Q1879785) (← links)
- On the performance of scatter search for post-enrolment course timetabling problems (Q2015784) (← links)
- Incorporating patient preferences in the design and operation of cancer screening facility networks (Q2023938) (← links)
- On convergence of scatter search and star paths with directional rounding for 0--1 mixed integer programs (Q2064299) (← links)
- A hybrid metaheuristic for the prize-collecting single machine scheduling problem with sequence-dependent setup times (Q2270448) (← links)
- Theoretical insights into the augmented-neural-network approach for combinatorial optimization (Q2271837) (← links)
- Hybrid algorithms for placement of virtual machines across geo-separated data centers (Q2331587) (← links)
- Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach (Q2370333) (← links)
- Finding local optima of high-dimensional functions using direct search methods (Q2378372) (← links)
- A solution procedure for the discrete time, cost and quality tradeoff problem using electromagnetic scatter search (Q2383848) (← links)
- Continuous scatter search: an analysis of the integration of some combination methods and improvement strategies (Q2570147) (← links)
- Scatter search for the vehicle routing problem with time windows (Q2570159) (← links)
- Scatter search for project scheduling with resource availability cost (Q2570160) (← links)
- A hybrid scatter search/electromagnetism meta-heuristic for project scheduling (Q2570161) (← links)
- Some aspects of scatter search in the flow-shop problem (Q2570162) (← links)
- Experimental testing of advanced scatter search designs for global optimization of multimodal functions (Q2583180) (← links)
- A review of vehicle routing with simultaneous pickup and delivery (Q2664320) (← links)
- The index selection problem with configurations and memory limitation: a scatter search approach (Q2668806) (← links)
- A SCATTER SEARCH FOR MULTI-DEPOT VEHICLE ROUTING PROBLEM WITH WEIGHT-RELATED COST (Q3013562) (← links)
- A scatter search approach with dispatching rules for a joint decision of cell formation and parts scheduling in batches (Q3163273) (← links)
