The following pages link to Scatter Search (Q17431):
Displaying 50 items.
- Time series forecasting with a nonlinear model and the scatter search meta-heuristic (Q942313) (← links)
- Solving the resource-constrained project scheduling problem using filter-and-fan approach (Q945251) (← links)
- Pareto memetic algorithm with path relinking for bi-objective traveling salesperson problem (Q954938) (← links)
- Tabu search-based metaheuristic algorithm for software system reliability problems (Q955616) (← links)
- A filter-and-fan approach to the job shop scheduling problem (Q958547) (← links)
- Path relinking approach for multiple allocation hub maximal covering problem (Q971739) (← links)
- Alternating control tree search for knapsack/covering problems (Q972644) (← links)
- The oracle penalty method (Q975775) (← links)
- Black box scatter search for general classes of binary optimization problems (Q976017) (← links)
- Near-optimal solutions for the generalized max-controlled set problem (Q976048) (← links)
- A hybrid scatter search heuristic for personalized crew rostering in the airline industry (Q976415) (← links)
- Estimation of constant and time-varying dynamic parameters of HIV infection in a nonlinear differential equation model (Q977648) (← links)
- Industrial aspects and literature survey: fleet composition and routing (Q991360) (← links)
- Analysis of new variable selection methods for discriminant analysis (Q1010495) (← links)
- A survey on metaheuristics for stochastic combinatorial optimization (Q1024034) (← links)
- Improved scatter search for the global optimization of computationally expensive dynamic models (Q1029673) (← links)
- Cyber swarm algorithms - improving particle swarm optimization using adaptive memory strategies (Q1037659) (← links)
- GRASP and path relinking for the max-min diversity problem (Q1038285) (← links)
- Scatter search for a real-life heterogeneous fleet vehicle routing problem with time windows and split deliveries in Brazil (Q1042225) (← links)
- GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem (Q1044091) (← links)
- Minimizing weighted tardiness of jobs with stochastic interruptions in parallel machines (Q1590047) (← links)
- Hybrid evolutionary search for the minimum sum coloring problem of graphs (Q1615675) (← links)
- Making a state-of-the-art heuristic faster with data mining (Q1639223) (← links)
- A path-relinking algorithm for the multi-mode resource-constrained project scheduling problem (Q1651597) (← links)
- Intelligent-guided adaptive search for the maximum covering location problem (Q1652063) (← links)
- GRASP with exterior path-relinking and restricted local search for the multidimensional two-way number partitioning problem (Q1652080) (← links)
- Heuristics for the capacitated modular hub location problem (Q1652383) (← links)
- Design of sensor networks for chemical plants based on meta-heuristics (Q1662455) (← links)
- An efficient algorithm for unconstrained optimization (Q1664864) (← links)
- Three-phase methodology incorporating scatter search for integrated production, inventory, and distribution routing problem (Q1665302) (← links)
- Solving large-scale TSP using a fast wedging insertion partitioning approach (Q1666767) (← links)
- Variable neighborhood scatter search for the incremental graph drawing problem (Q1694406) (← links)
- A DE-based scatter search for global optimization problems (Q1723280) (← links)
- An iterative path-breaking approach with mutation and restart strategies for the MAX-SAT problem (Q1725596) (← links)
- The scatter search based algorithm for beam angle optimization in intensity-modulated radiation therapy (Q1734401) (← links)
- Enhanced multi-directional local search for the bi-objective heterogeneous vehicle routing problem with multiple driving ranges (Q1737486) (← links)
- The use of frontier techniques to identify efficient solutions for the berth allocation problem solved with a hybrid evolutionary algorithm (Q1738818) (← links)
- A comparison of algorithms for finding an efficient theme park tour (Q1741683) (← links)
- Effective metaheuristic algorithms for the minimum differential dispersion problem (Q1751715) (← links)
- Capital- and resource-constrained project scheduling with net present value optimization (Q1752257) (← links)
- Dynamic optimisation of preventative and corrective maintenance schedules for a large scale urban drainage system (Q1752832) (← links)
- An effective heuristic for project scheduling with resource availability cost (Q1752859) (← links)
- A hybrid particle swarm optimization -- variable neighborhood search algorithm for constrained shortest path problems (Q1753628) (← links)
- Methods to compare expensive stochastic optimization algorithms with random restarts (Q1756805) (← links)
- Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method (Q1761134) (← links)
- Scatter search for the stochastic travel-time vehicle routing problem with simultaneous pick-ups and deliveries (Q1761164) (← links)
- Scatter search for the cutwidth minimization problem (Q1761768) (← links)
- Multiobjective scatter search for a commercial territory design problem (Q1761773) (← links)
- A knapsack problem as a tool to solve the production planning problem in small foundries (Q1761949) (← links)
- Exploring relaxation induced neighborhoods to improve MIP solutions (Q1769074) (← links)
