Iterated responsive threshold search for the quadratic multiple knapsack problem
From MaRDI portal
Publication:2341207
DOI10.1007/s10479-014-1720-5zbMath1309.90085MaRDI QIDQ2341207
Publication date: 23 April 2015
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-014-1720-5
heuristics; quadratic multiple knapsack problem; constrained quadratic optimization; multiple neighborhood; responsive threshold search
90C20: Quadratic programming
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
Related Items
An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating, Lagrangian matheuristics for the quadratic multiple knapsack problem, Responsive threshold search based memetic algorithm for balanced minimum sum-of-squares clustering, A three-phased local search approach for the clique partitioning problem, Planning personnel retraining: column generation heuristics, A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem, Multi-restart iterative search for the pickup and delivery traveling salesman problem with FIFO loading, Lagrangian relaxation versus genetic algorithm based metaheuristic for a large partitioning problem, Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem, Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems, A threshold search based memetic algorithm for the disjunctively constrained knapsack problem, A Lagrangian Relaxation-Based Heuristic to Solve Large Extended Graph Partitioning Problems, Scheduling Personnel Retraining: Column Generation Heuristics
Uses Software
Cites Work
- An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
- The quadratic knapsack problem -- a survey
- Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
- An exact algorithm for large multiple knapsack problems
- Heuristic algorithms for the multiple knapsack problem
- New optimization heuristics. The great deluge algorithm and the record- to-record travel
- A computational study on the quadratic knapsack problem with multiple constraints
- Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem
- Strategic oscillation for the quadratic multiple knapsack problem
- Neighborhood portfolio approach for local search applied to timetabling problems
- Quadratic knapsack problems
- An algorithm for 0-1 multiple-knapsack problems
- Exact Solution of the Quadratic Knapsack Problem
- Tabu Thresholding: Improved Search by Nonmonotonic Trajectories
- Unnamed Item
- Unnamed Item
