The following pages link to Tabu Search—Part I (Q4018159):
Displayed 50 items.
- Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems (Q377748) (← links)
- A random sampling approach to worst-case design of structures (Q381813) (← links)
- The linehaul-feeder vehicle routing problem with virtual depots and time windows (Q410539) (← links)
- Multipath adaptive tabu search for a vehicle control problem (Q411085) (← links)
- Hopf bifurcation analysis in a tabu learning neuron model with two delays (Q420218) (← links)
- A branch-and-bound algorithm for the single-row equidistant facility layout problem (Q421088) (← links)
- Global optimality conditions and optimization methods for quadratic assignment problems (Q422852) (← links)
- The minimum spanning tree problem with conflict constraints and its variations (Q429679) (← links)
- Constructing \(E(s^2)\)-optimal and minimax-optimal \(k\)-circulant supersaturated designs via multi-objective tabu search (Q434541) (← links)
- A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem (Q439503) (← links)
- Similarities between meta-heuristics algorithms and the science of life (Q441019) (← links)
- An implementation of the iterated tabu search algorithm for the quadratic assignment problem (Q443828) (← links)
- Adaptive conformational sampling based on replicas (Q455720) (← links)
- Hybrid algorithms for hardware/software partitioning and scheduling on reconfigurable devices (Q462781) (← links)
- A testing based extraction algorithm for identifying significant communities in networks (Q484064) (← links)
- Essential particle swarm optimization queen with tabu search for MKP resolution (Q488403) (← links)
- Local search for Boolean satisfiability with configuration checking and subscore (Q490437) (← links)
- Using local similarity measures to efficiently address approximate graph matching (Q496650) (← links)
- Optimal topological design for distributed estimation over sensor networks (Q497910) (← links)
- A single-machine scheduling with a truncated linear deterioration and ready times (Q497952) (← links)
- GRASP-based heuristic algorithm for the multi-product multi-vehicle inventory routing problem (Q503664) (← links)
- 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)