Pages that link to "Item:Q4869758"

The following pages link to Tabu Thresholding: Improved Search by Nonmonotonic Trajectories (Q4869758):

Displaying 26 items.

• MILP formulations and an iterated local search algorithm with tabu thresholding for the order batching problem (Q319040) (← links)
• A hybrid metaheuristic approach for the capacitated arc routing problem (Q323105) (← links)
• Solving the quadratic minimum spanning tree problem (Q387698) (← links)
• The minimum spanning tree problem with conflict constraints and its variations (Q429679) (← links)
• The case for strategic oscillation (Q542006) (← links)
• A filter-and-fan approach to the 2D HP model of the protein folding problem (Q646723) (← links)
• Scheduling in a continuous galvanizing line (Q947966) (← links)
• The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm (Q976040) (← links)
• Proposals for chunking and tabu search (Q1609920) (← links)
• Solving zero-one mixed integer programming problems using tabu search (Q1609922) (← links)
• An efficient tabu search approach for the 0-1 multidimensional knapsack problem (Q1609923) (← links)
• A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem (Q1628071) (← links)
• Multi-restart iterative search for the pickup and delivery traveling salesman problem with FIFO loading (Q1652699) (← links)
• New relationships for multi-neighborhood search for the minimum linear arrangement problem (Q1679609) (← links)
• Tight oscillations tabu search for multidimensional knapsack problems with generalized upper bound constraints (Q1781556) (← links)
• Metaheuristics: A bibliography (Q1919858) (← links)
• Cybernetic optimization by simulated annealing: Accelerating convergence by parallel processing and probabilistic feedback control (Q1922638) (← links)
• Iterated responsive threshold search for the quadratic multiple knapsack problem (Q2341207) (← links)
• Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems (Q2355937) (← links)
• Mathematical programming based heuristics for the 0--1 MIP: a survey (Q2401328) (← links)
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) (Q2644426) (← links)
• Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem (Q4603929) (← links)
• Variable neighborhood search: Principles and applications (Q5937708) (← links)
• Defining tabu list size and aspiration criterion within tabu search methods (Q5955472) (← links)
• Responsive threshold search based memetic algorithm for balanced minimum sum-of-squares clustering (Q6071251) (← links)
• Tabu search exploiting local optimality in binary optimization (Q6167666) (← links)