A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem
type: Item
instance of: scholarly article
title: A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem
zbMATH Open document ID: 1458.90534
author: Mustafa Avci
author: Seyda Topaloglu
published in: Computers \& Operations Research
publication date: 2018-07-11T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C20
zbMATH DE Number: 6901413
zbMATH Keywords: generalized quadratic multiple knapsack problem
zbMATH Keywords: variable neighborhood descent
zbMATH Keywords: iterated local search
zbMATH Keywords: perturbation mechanism
describes a project that uses: Knapsack
MaRDI profile type: Publication
full work available at URL: j.cor.2017.02.004
OpenAlex ID: W2587579594
cites work: Exact and heuristic solution approaches for the mixed integer setup knapsack problem
cites work: Linear programming for the \(0-1\) quadratic knapsack problem
cites work: Using a mixed integer programming tool for solving the 0-1 quadratic knapsack problem
cites work: Exact Solution of the Quadratic Knapsack Problem
cites work: A cross entropy algorithm for the Knapsack problem with setups
cites work: Q3835301
cites work: Iterated responsive threshold search for the quadratic multiple knapsack problem
cites work: An adaptive large neighborhood search heuristic for the pollution-routing problem
cites work: A multi-restart iterated local search algorithm for the permutation flow shop problem minimizing total flow time
cites work: A Dynamic Programming Heuristic for the Quadratic Knapsack Problem
cites work: Quadratic knapsack problems
cites work: Strategic oscillation for the quadratic multiple knapsack problem
cites work: Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem
cites work: Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems
cites work: Nested simulated annealing approach to periodic routing problem of a retail distribution system
cites work: An iterated local search algorithm for the vehicle routing problem with convex time penalty functions
cites work: Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications
cites work: Q4821303
cites work: Reoptimization in Lagrangian methods for the \(0\)-\(1\) quadratic knapsack problem
cites work: Algorithms for the bounded set-up knapsack problem
cites work: Variable neighborhood search
cites work: Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services
cites work: Knapsack problems with setups
cites work: Lagrangean methods for the 0-1 quadratic knapsack problem
cites work: Solving the 0-1 quadratic knapsack problem with a competitive quantum inspired evolutionary algorithm
cites work: An ejection chain approach for the quadratic multiple knapsack problem
cites work: The quadratic knapsack problem -- a survey
cites work: A general heuristic for vehicle routing problems
cites work: Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem
cites work: An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
cites work: An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem
cites work: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
cites work: An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
cites work: Generalized quadratic multiple knapsack problem and two solution approaches
cites work: Iterated local search for the quadratic assignment problem
cites work: A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
cites work: A computational study on the quadratic knapsack problem with multiple constraints
cites work: A strongly polynomial FPTAS for the symmetric quadratic knapsack problem
cites work: An effective GRASP and tabu search for the 0-1 quadratic knapsack problem
DOI: 10.1016/J.COR.2017.02.004
description: scientific article; zbMATH DE number 6901413