The following pages link to Tabu Search—Part I (Q4018159):
Displayed 50 items.
- Ant colony optimization combined with taboo search for the job shop scheduling problem (Q941529) (← links)
- Scheduling in a continuous galvanizing line (Q947966) (← links)
- A hybrid stochastic genetic-GRASP algorithm for clustering analysis (Q949381) (← links)
- Design of hybrids for the minimum sum-of-squares clustering problem (Q951921) (← links)
- EVE-OPT: a hybrid algorithm for the capacitated vehicle routing problem (Q953302) (← links)
- Constructing 1-rotational NRDFs through an optimization approach: new (46,9,8), (51,10,9) and (55,9,8)-NRBDs (Q953843) (← links)
- The capacity and distance constrained plant location problem (Q954059) (← links)
- Tabu search for discrete-continuous scheduling problems with heuristic continuous resource allocation (Q954934) (← links)
- Tabu search-based metaheuristic algorithm for software system reliability problems (Q955616) (← links)
- A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers (Q955624) (← links)
- A tabu search approach to an urban transport problem in northern Spain (Q955629) (← links)
- The impact of operations redesign on the safety stock investment in supply chains (Q955700) (← links)
- Experiments with, and on, algorithms for maximum likelihood clustering (Q957004) (← links)
- Discrete support vector decision trees via tabu search (Q957011) (← links)
- Metaheuristics for scheduling a non-permutation flowline manufacturing cell with sequence dependent family setup times (Q958443) (← links)
- Optimization of nearest neighbor classifiers via metaheuristic algorithms for credit risk assessment (Q960116) (← links)
- Continuous ant colony system and tabu search algorithms hybridized for global minimization of continuous multi-minima functions (Q967212) (← links)
- Bounds for short covering codes and reactive tabu search (Q968171) (← links)
- NeuroGenetic approach for combinatorial optimization: an exploratory analysis (Q970182) (← links)
- A fast memoryless interval-based algorithm for global optimization (Q975771) (← links)
- Near-optimal solutions for the generalized max-controlled set problem (Q976048) (← links)
- Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion (Q976399) (← links)
- A population-based variable neighborhood search for the single machine total weighted tardiness problem (Q1001005) (← links)
- Analysis of new variable selection methods for discriminant analysis (Q1010495) (← links)
- Computing lower and upper bounds for a large-scale industrial job shop scheduling problem (Q1011298) (← links)
- The single-finger keyboard layout problem (Q1025249) (← links)
- A hybrid multi-swarm particle swarm optimization algorithm for the probabilistic traveling salesman problem (Q1038278) (← links)
- Simultaneously scheduling multiple turns for steel color-coating production (Q1042046) (← links)
- A variable selection method based on Tabu search for logistic regression models (Q1042170) (← links)
- Heuristics for container loading of furniture (Q1044119) (← links)
- Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem (Q1048651) (← links)
- Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge (Q1127153) (← links)
- Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem (Q1130046) (← links)
- Least-cost network topology design for a new service: An application of tabu search (Q1179745) (← links)
- Location and sizing of offshore platforms for oil exploration (Q1194731) (← links)
- The traveling salesman problem: An overview of exact and approximate algorithms (Q1194761) (← links)
- Experimental analysis of simulated annealing based algorithms for the layout problem (Q1197688) (← links)
- A connectionist approach to the quadratic assignment problem (Q1200824) (← links)
- Optimizing tabu list size for the traveling salesman problem (Q1265842) (← links)
- Tactical design of rail freight networks. I: Exact and heuristic methods (Q1266512) (← links)
- Local search heuristics for single-machine scheduling with batching to minimize the number of late jobs (Q1266534) (← links)
- An SA/TS mixture algorithm for the scheduling tardiness problem (Q1266621) (← links)
- A simple tabu search method to solve the mixed-integer linear bilevel programming problem (Q1266629) (← links)
- Massively parallel analog tabu search using neural networks applied to simple plant location problems (Q1268165) (← links)
- The job shop scheduling problem: Conventional and new solution techniques (Q1268188) (← links)
- Optimizing simulated annealing schedules with genetic programming (Q1268274) (← links)
- General local search methods (Q1268283) (← links)
- The life span method -- a new variant of local search (Q1275844) (← links)
- A tabu search algorithm for the multi-trip vehicle routing and scheduling problem (Q1278083) (← links)
- Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process (Q1278196) (← links)