Tabu Thresholding: Improved Search by Nonmonotonic Trajectories
From MaRDI portal
Publication:4869758
DOI10.1287/ijoc.7.4.426zbMath0843.90097OpenAlexW1983516812MaRDI QIDQ4869758
Publication date: 12 March 1996
Published in: ORSA Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.7.4.426
Related Items
A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem, MILP formulations and an iterated local search algorithm with tabu thresholding for the order batching problem, A hybrid metaheuristic approach for the capacitated arc routing problem, Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder), Multi-restart iterative search for the pickup and delivery traveling salesman problem with FIFO loading, Mathematical programming based heuristics for the 0--1 MIP: a survey, Metaheuristics: A bibliography, Cybernetic optimization by simulated annealing: Accelerating convergence by parallel processing and probabilistic feedback control, New relationships for multi-neighborhood search for the minimum linear arrangement problem, Solving the quadratic minimum spanning tree problem, Responsive threshold search based memetic algorithm for balanced minimum sum-of-squares clustering, Tabu search exploiting local optimality in binary optimization, Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem, The minimum spanning tree problem with conflict constraints and its variations, A filter-and-fan approach to the 2D HP model of the protein folding problem, Scheduling in a continuous galvanizing line, The case for strategic oscillation, Variable neighborhood search: Principles and applications, The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm, Tight oscillations tabu search for multidimensional knapsack problems with generalized upper bound constraints, Defining tabu list size and aspiration criterion within tabu search methods, Iterated responsive threshold search for the quadratic multiple knapsack problem, Proposals for chunking and tabu search, Solving zero-one mixed integer programming problems using tabu search, An efficient tabu search approach for the 0-1 multidimensional knapsack problem, Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems
