Determining the \(K\)-best solutions of knapsack problems (Q342015): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Unbounded knapsack problem: Dynamic programming revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: A set partitioning heuristic for the generalized assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Integer Solutions to Industrial Cutting-Stock Problems: Part 2, Benchmark Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Programming Approach to the Cutting-Stock Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Programming Approach to the Cutting Stock Problem—Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Theory and Computation of Knapsack Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: New developments in the primal-dual column generation technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strip generation algorithms for constrained two-dimensional two-staged cutting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds for periodicity theorems on the unbounded knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The constrained compartmentalized knapsack problem: mathematical models and solution methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4149228 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new lower bound for the linear knapsack problem with general integer variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Minimal Algorithm for the Bounded Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Applications in Management / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Price Algorithm for the Generalized Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New pseudopolynomial complexity bounds for the bounded and other integer knapsack related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving binary cutting stock problems by column generation and branch- and-bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved typology of cutting and packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new enumeration scheme for the knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for determining the K-best solutions of the one-dimensional Knapsack problem / rank
 
Normal rank

Revision as of 22:55, 12 July 2024

scientific article
Language Label Description Also known as
English
Determining the \(K\)-best solutions of knapsack problems
scientific article

    Statements

    Determining the \(K\)-best solutions of knapsack problems (English)
    0 references
    0 references
    0 references
    0 references
    17 November 2016
    0 references
    knapsack problems
    0 references
    branch-and-bound
    0 references
    best solutions
    0 references
    0 references
    0 references
    0 references

    Identifiers