New exact approaches and approximation results for the penalized knapsack problem (Q1634770): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Created claim: DBLP publication ID (P1635): journals/dam/CrocePS19, #quickstatements; #temporary_batch_1731547958265
 
(5 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / rank
 
Normal rank
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.dam.2017.11.023 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2774060613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimization algorithm for a penalized knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation results for the incremental knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3882189 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-dimensional packing problems: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer optimization with penalized fractional values: the knapsack case / rank
 
Normal rank
Property / cites work
 
Property / cites work: New trends in exact algorithms for the \(0-1\) knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for the 0-1 Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / 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: Linear Time Algorithms for Knapsack Problems with Bounded Weights / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/dam/CrocePS19 / rank
 
Normal rank

Latest revision as of 02:47, 14 November 2024

scientific article
Language Label Description Also known as
English
New exact approaches and approximation results for the penalized knapsack problem
scientific article

    Statements

    New exact approaches and approximation results for the penalized knapsack problem (English)
    0 references
    0 references
    0 references
    0 references
    18 December 2018
    0 references
    penalized knapsack problem
    0 references
    exact algorithm
    0 references
    dynamic programming
    0 references
    approximation schemes
    0 references
    0 references
    0 references

    Identifiers