The following pages link to Tabu search (Q20565):
Displaying 50 items.
- Integrated distribution and loading planning via a compact metaheuristic algorithm (Q257219) (← links)
- A flow-based tabu search algorithm for the RCPSP with transfer times (Q280159) (← links)
- A review of hyper-heuristics for educational timetabling (Q284387) (← links)
- A combined local search and integer programming approach to the traveling tournament problem (Q284438) (← links)
- The terminal-oriented ship stowage planning problem (Q297116) (← links)
- Frequency optimization in public transportation systems: formulation and metaheuristic approach (Q299827) (← links)
- Unified encoding for hyper-heuristics with application to bioinformatics (Q301251) (← links)
- A three-phased local search approach for the clique partitioning problem (Q306093) (← links)
- Solving the maximum vertex weight clique problem via binary quadratic programming (Q306100) (← links)
- Bandwidth packing problem with queueing delays: modelling and exact solution approach (Q312479) (← links)
- The evaluation of pedestrians' behavior using \(M/G/C/C\) analytical, weighted distance and real distance simulation models (Q312649) (← links)
- The bipartite quadratic assignment problem and extensions (Q322542) (← links)
- A hybrid metaheuristic approach for the capacitated arc routing problem (Q323105) (← links)
- Pro-active real-time routing in applications with multiple request patterns (Q323177) (← links)
- Local search heuristics for sectoring routing in a household waste collection context (Q323486) (← links)
- A hybrid evolutionary algorithm to solve the job shop scheduling problem (Q324301) (← links)
- An implementation of exact knapsack separation (Q330511) (← links)
- Revising history for cost-informed process improvement (Q335888) (← links)
- Makespan minimization flowshop with position dependent job processing times -- computational complexity and solution algorithms (Q336439) (← links)
- A scheduling problem in blocking hybrid flow shop robotic cells with multiple robots (Q336565) (← links)
- Two approaches for solving the buffer allocation problem in unreliable production lines (Q336569) (← links)
- A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems (Q336709) (← links)
- GRASP and path relinking for the equitable dispersion problem (Q336711) (← links)
- Probabilistic GRASP-tabu search algorithms for the UBQP problem (Q336712) (← links)
- A GRASP metaheuristic for microarray data analysis (Q336713) (← links)
- A GRASP with path-relinking heuristic for the survivable IP/MPLS-over-WSON multi-layer network optimization problem (Q336733) (← links)
- Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services (Q336790) (← links)
- A memetic algorithm for the minimum sum coloring problem (Q336939) (← links)
- Stochastic resource allocation using a predictor-based heuristic for optimization via simulation (Q336991) (← links)
- Two metaheuristic approaches for solving multidimensional two-way number partitioning problem (Q336995) (← links)
- Tabu search algorithm for DNA sequencing by hybridization with multiplicity information available (Q337001) (← links)
- A tabu search algorithm for application placement in computer clustering (Q337070) (← links)
- Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem (Q337120) (← links)
- Simulation-based optimization for housekeeping in a container transshipment terminal (Q337263) (← links)
- Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem (Q337268) (← links)
- Minimizing weighted earliness-tardiness on parallel machines using hybrid metaheuristics (Q337323) (← links)
- A two level metaheuristic for the operating room scheduling and assignment problem (Q337329) (← links)
- Optimal shift partitioning of pharmacies (Q337411) (← links)
- A branch-and-price approach for a multi-period vehicle routing problem (Q337422) (← links)
- Tabu search for the cyclic bandwidth problem (Q337475) (← links)
- A biased random-key genetic algorithm for the capacitated minimum spanning tree problem (Q337493) (← links)
- Emergency facility location under random network damage: insights from the Istanbul case (Q337665) (← links)
- Branch and bound for the cutwidth minimization problem (Q339558) (← links)
- Memetic search for the max-bisection problem (Q339560) (← links)
- Breakout local search for maximum clique problems (Q339563) (← links)
- Solution method for the location planning problem of logistics park with variable capacity (Q339598) (← links)
- A new heuristic for solving the \(p\)-median problem in the plane (Q339602) (← links)
- Multi-directional local search (Q339654) (← links)
- Algorithms for the generalized weighted frequency assignment problem (Q339680) (← links)
- Algorithmic aspects for multiple-choice hardware/software partitioning (Q339684) (← links)
