Tabu Thresholding: Improved Search by Nonmonotonic Trajectories
From MaRDI portal
Publication:4869758
Cited in
(27)- Mathematical programming based heuristics for the 0--1 MIP: a survey
- Defining tabu list size and aspiration criterion within tabu search methods
- Tight oscillations tabu search for multidimensional knapsack problems with generalized upper bound constraints
- A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem
- Variable neighborhood search: Principles and applications
- Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems
- Proposals for chunking and tabu search
- MILP formulations and an iterated local search algorithm with tabu thresholding for the order batching problem
- Multi-restart iterative search for the pickup and delivery traveling salesman problem with FIFO loading
- Cybernetic optimization by simulated annealing: Accelerating convergence by parallel processing and probabilistic feedback control
- A hybrid metaheuristic approach for the capacitated arc routing problem
- Responsive threshold search based memetic algorithm for balanced minimum sum-of-squares clustering
- The case for strategic oscillation
- Solving the quadratic minimum spanning tree problem
- The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm
- New relationships for multi-neighborhood search for the minimum linear arrangement problem
- A filter-and-fan approach to the 2D HP model of the protein folding problem
- Tabu search exploiting local optimality in binary optimization
- The minimum spanning tree problem with conflict constraints and its variations
- A multicommodity pickup and delivery problem with time windows and handling time in the omni-channel last-mile delivery
- Metaheuristics: A bibliography
- Solving zero-one mixed integer programming problems using tabu search
- Iterated responsive threshold search for the quadratic multiple knapsack problem
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- An efficient tabu search approach for the 0-1 multidimensional knapsack problem
- Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem
- Scheduling in a continuous galvanizing line
This page was built for publication: Tabu Thresholding: Improved Search by Nonmonotonic Trajectories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4869758)
