Iterated responsive threshold search for the quadratic multiple knapsack problem
From MaRDI portal
Recommendations
- A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem
- An iterated ``hyperplane exploration approach for the quadratic knapsack problem
- Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem
- A branch-and-bound algorithm for the quadratic multiple knapsack problem
- Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem
Cites work
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- A computational study on the quadratic knapsack problem with multiple constraints
- An algorithm for 0-1 multiple-knapsack problems
- An exact algorithm for large multiple knapsack problems
- An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
- Exact Solution of the Quadratic Knapsack Problem
- Heuristic algorithms for the multiple knapsack problem
- Neighborhood portfolio approach for local search applied to timetabling problems
- New optimization heuristics. The great deluge algorithm and the record- to-record travel
- Nonparametric statistics. A step-by-step approach
- Quadratic knapsack problems
- Strategic oscillation for the quadratic multiple knapsack problem
- Tabu Thresholding: Improved Search by Nonmonotonic Trajectories
- Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem
- The quadratic knapsack problem -- a survey
- Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
Cited in
(18)- An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating
- Strategic oscillation for the quadratic multiple knapsack problem
- An iterated ``hyperplane exploration approach for the quadratic knapsack problem
- Planning personnel retraining: column generation heuristics
- A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem
- A hybrid evolutionary search for the generalized quadratic multiple knapsack problem
- A three-phased local search approach for the clique partitioning problem
- Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem
- Lagrangian matheuristics for the quadratic multiple knapsack problem
- Scheduling personnel retraining: column generation heuristics
- Multi-restart iterative search for the pickup and delivery traveling salesman problem with FIFO loading
- Responsive threshold search based memetic algorithm for balanced minimum sum-of-squares clustering
- A threshold search based memetic algorithm for the disjunctively constrained knapsack problem
- Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- Lagrangian relaxation versus genetic algorithm based metaheuristic for a large partitioning problem
- A Lagrangian relaxation-based heuristic to solve large extended graph partitioning problems
- Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem
This page was built for publication: Iterated responsive threshold search for the quadratic multiple knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2341207)
