The following pages link to Tabu Search—Part II (Q4021362):
Displaying 50 items.
- Applying simulated annealing using different methods for the neighborhood search in forest planning problems (Q297021) (← links)
- Circular coloring of graphs via linear programming and tabu search (Q302132) (← links)
- Multi-neighborhood based iterated tabu search for routing and wavelength assignment problem (Q306092) (← links)
- Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container (Q322528) (← links)
- Hybrid metaheuristics for the accessibility windows assembly line balancing problem level 2 (AWALBP-L2) (Q322556) (← links)
- A memetic algorithm for the travelling salesperson problem with hotel selection (Q336356) (← links)
- Effect of solution representations on tabu search in scheduling applications (Q336636) (← links)
- Genetic tabu search for the fuzzy flexible job shop problem (Q337343) (← links)
- Scatter search with path relinking for the job shop with time lags and setup times (Q337556) (← links)
- Iterated local search based on multi-type perturbation for single-machine earliness/tardiness scheduling (Q337595) (← links)
- Vehicle routing problem with stochastic travel times including soft time windows and service costs (Q339568) (← links)
- A nonmonotone GRASP (Q340011) (← links)
- A new heuristic algorithm for the circular packing problem with equilibrium constraints (Q350917) (← links)
- Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems (Q377748) (← links)
- Evolutionary optimization: pitfalls and booby traps (Q389022) (← links)
- The linehaul-feeder vehicle routing problem with virtual depots and time windows (Q410539) (← links)
- Hopf bifurcation analysis in a tabu learning neuron model with two delays (Q420218) (← 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)
- An implementation of the iterated tabu search algorithm for the quadratic assignment problem (Q443828) (← links)
- Hybrid algorithms for hardware/software partitioning and scheduling on reconfigurable devices (Q462781) (← 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)
- Optimal topological design for distributed estimation over sensor networks (Q497910) (← 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)
- 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)
- Tabu search approaches for solving the two-group classification problem (Q541993) (← links)
- Evolutionary computation approaches to the curriculum sequencing problem (Q553929) (← 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)
- Vehicle routing with compartments: applications, modelling and heuristics (Q657053) (← 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)
- Global optimizations and tabu search based on memory (Q702667) (← 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)
