LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup (Q6146649): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1111/itor.13213 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4298394066 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A matheuristic for the 0--1 generalized quadratic multiple knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy algorithm for the general multidimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sensitivity analysis of the setup knapsack problem to perturbation of arbitrary profits or weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3241581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Knapsack problems -- an overview of recent advances. I: Single knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Algorithms For The Setup Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic programming algorithm for the knapsack problem with setup / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact approach for the 0-1 knapsack problem with setups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical models and decomposition methods for the multiple knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple strategies that generate bounded solutions for the multiple‐choice multi‐dimensional knapsack problem: a guide for OR practitioners / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-bound algorithm for the quadratic multiple knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact approaches for the knapsack problem with setups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood decomposition search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search: Principles and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Partitions with Applications to the Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A total-value greedy heuristic for the integer knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Bibliographical Survey On Some Well-Known Non-Standard Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound for the zero-one knapsack problem and a branch and bound algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Knapsack problems with setups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved dynamic programming and approximation results for the knapsack problem with setups / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Minimal Algorithm for the 0-1 Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3678962 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The core concept for the Multidimensional Knapsack problem / 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: Dynamic programming algorithms for the zero-one knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5368626 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the Knapsack problem with setup / rank
 
Normal rank

Latest revision as of 10:45, 26 August 2024

scientific article; zbMATH DE number 7797338
Language Label Description Also known as
English
LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup
scientific article; zbMATH DE number 7797338

    Statements

    LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup (English)
    0 references
    0 references
    0 references
    0 references
    31 January 2024
    0 references
    metaheuristics
    0 references
    LP relaxation
    0 references
    dynamic programming
    0 references
    variable neighborhood search
    0 references
    multiple knapsack problem with setup
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers