The following pages link to Tabu Search—Part I (Q4018159):
Displaying 50 items.
- A fast tabu search implementation for large asymmetric traveling salesman problems defined on sparse graphs (Q505141) (← links)
- Comparative analysis of three metaheuristics for short-term open pit block sequencing (Q525065) (← links)
- Hub location-allocation in intermodal logistic networks (Q531438) (← links)
- Local search for the undirected capacitated arc routing problem with profits (Q531469) (← links)
- Parallel preconditioned WENO scheme for three-dimensional flow simulation of NREL phase VI rotor (Q534669) (← links)
- Economic application in a finite capacity multi-channel queue with second optional channel (Q535421) (← links)
- Project scheduling heuristics-based standard PSO for task-resource assignment in heterogeneous grid (Q535971) (← links)
- Adaptive memory programming: local search parallel algorithms for phylogenetic tree construc\-tion (Q542000) (← links)
- Evolutionary computation approaches to the curriculum sequencing problem (Q553929) (← links)
- Modeling staff scheduling problems. A tutorial (Q596257) (← links)
- A model and two heuristic approaches for a forage Harvester planning problem: a case study (Q611002) (← links)
- A heuristic algorithm for hierarchical hub-and-spoke network of time-definite common carrier operation planning problem (Q613548) (← links)
- A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective (Q614062) (← links)
- Continuous optimization via simulation using golden region search (Q621655) (← links)
- A primogenitary linked quad tree approach for solution storage and retrieval in heuristic binary optimization (Q621968) (← links)
- Two meta-heuristics for parallel machine scheduling with job splitting to minimize total tardiness (Q639194) (← links)
- Local search with edge weighting and configuration checking heuristics for minimum vertex cover (Q646517) (← links)
- A hybrid ACO-GRASP algorithm for clustering analysis (Q646719) (← links)
- A filter-and-fan approach to the 2D HP model of the protein folding problem (Q646723) (← links)
- Vehicle routing with compartments: applications, modelling and heuristics (Q657053) (← links)
- Local search heuristics for the probabilistic dial-a-ride problem (Q657055) (← links)
- Comparison of the performance of modern heuristics for combinatorial optimization on real data (Q690010) (← links)
- On the heuristic solution of the permutation flow shop problem by path algorithms (Q690012) (← links)
- Consistent neighborhood search for combinatorial optimization (Q693704) (← links)
- Pseudo-Boolean optimization (Q697569) (← links)
- Global optimizations and tabu search based on memory (Q702667) (← links)
- Variable neighborhood search for the maximum clique (Q705505) (← links)
- A hybrid method combining continuous tabu search and Nelder--Mead simplex algorithms for the global optimization of multiminima functions (Q706948) (← links)
- Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search (Q706997) (← links)
- Reactive scheduling in the multi-mode RCPSP (Q709110) (← links)
- A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem (Q709119) (← links)
- Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem (Q709128) (← links)
- Hybrid evolutionary fuzzy learning scheme in the applications of traveling salesman problems (Q726205) (← links)
- Comparative analysis of the machine repair problem with imperfect coverage and service pressure condition (Q727280) (← links)
- Global versus local search: the impact of population sizes on evolutionary algorithm performance (Q727394) (← links)
- A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem (Q734870) (← links)
- SO-I: a surrogate model algorithm for expensive nonlinear integer programming problems including global optimization applications (Q743971) (← links)
- Using a vision cognitive algorithm to schedule virtual machines (Q747400) (← links)
- TABARIS: An exact algorithm based on tabu search for finding a maximum independent set in a graph (Q750320) (← links)
- An efficient memetic algorithm for the graph partitioning problem (Q763098) (← links)
- Efficiently solving the traveling thief problem using hill climbing and simulated annealing (Q781909) (← links)
- New heuristic approaches for maximum balanced biclique problem (Q781924) (← links)
- Tabu search for large scale timetabling problems (Q806794) (← links)
- A convoy scheduling problem (Q811336) (← links)
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
- Metaheuristics in combinatorial optimization (Q817206) (← links)
- Scheduling flow shops using differential evolution algorithm (Q817560) (← links)
- Modeling reverse logistic tasks within closed-loop supply chains: an example from the automotive industry (Q819103) (← links)
- Solving a bi-objective mixed-model assembly-line sequencing using metaheuristic algorithms considering ergonomic factors, customer behavior, and periodic maintenance (Q832801) (← links)
- New simple and efficient heuristics for the uncapacitated single allocation hub location problem (Q833533) (← links)
