A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem (Q1652289): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Knapsack / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2017.02.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2587579594 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and heuristic solution approaches for the mixed integer setup knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear programming for the \(0-1\) quadratic knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using a Mixed Integer Programming Tool for Solving the 0–1 Quadratic Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Solution of the Quadratic Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cross entropy algorithm for the Knapsack problem with setups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3835301 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterated responsive threshold search for the quadratic multiple knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive large neighborhood search heuristic for the pollution-routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multi-restart iterated local search algorithm for the permutation flow shop problem minimizing total flow time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Heuristic for the Quadratic Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strategic oscillation for the quadratic multiple knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nested simulated annealing approach to periodic routing problem of a retail distribution system / rank
 
Normal rank
Property / cites work
 
Property / cites work: An iterated local search algorithm for the vehicle routing problem with convex time penalty functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reoptimization in Lagrangian methods for the \(0\)-\(1\) quadratic knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the bounded set-up knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services / rank
 
Normal rank
Property / cites work
 
Property / cites work: Knapsack problems with setups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangean methods for the 0-1 quadratic knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the 0-1 quadratic knapsack problem with a competitive quantum inspired evolutionary algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An ejection chain approach for the quadratic multiple knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quadratic knapsack problem -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general heuristic for vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized quadratic multiple knapsack problem and two solution approaches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterated local search for the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational study on the quadratic knapsack problem with multiple constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strongly polynomial FPTAS for the symmetric quadratic knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective GRASP and tabu search for the 0-1 quadratic knapsack problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:10, 16 July 2024

scientific article
Language Label Description Also known as
English
A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem
scientific article

    Statements

    A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem (English)
    0 references
    0 references
    0 references
    11 July 2018
    0 references
    generalized quadratic multiple knapsack problem
    0 references
    variable neighborhood descent
    0 references
    iterated local search
    0 references
    perturbation mechanism
    0 references
    0 references
    0 references

    Identifiers