The knapsack problem with generalized upper bounds (Q1122484): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
ā€ŽChanged an Item
 
(2 intermediate revisions by 2 users not shown)
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/0377-2217(89)90110-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2042474998 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic solution of the rectangular cutting stock problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Large Zero-One Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3888838 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational results with a branch-and-bound algorithm for the general knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3882189 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the reduction method for integer linear programs. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4166568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Noteā€”The Multiperiod Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A o(n logn) algorithm for LP knapsacks with GUB constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A better step-off algorithm for the knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: APPROXIMATE ALGORITHMS FOR THE MULTIPLE-CHOICE CONTINUOUS KNAPSACK PROBLEMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experiments in integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the knapsack problem with special ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic algorithms for the multiple knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The imbedded state approach to reducing dimensionality in dynamic programs of higher dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Algorithms for the 0/1 Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The knapsack problem: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Multiple-Choice Knapsack Problem / 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: The Linear Multiple Choice Knapsack Problem / rank
 
Normal rank

Latest revision as of 08:23, 20 June 2024

scientific article
Language Label Description Also known as
English
The knapsack problem with generalized upper bounds
scientific article

    Statements

    The knapsack problem with generalized upper bounds (English)
    0 references
    1989
    0 references
    A pipe production scheduling problem is modelled. The corresponding model is an integer programming problem with nonnegative coefficients in the constraints. The author calls it a knapsack problem with generalized upper bounds. Dynamic programming is used to achieve a solution. A knapsack problem solved by enumeration and approximation methods is applied as a subproblem.
    0 references
    production scheduling
    0 references
    knapsack problem
    0 references
    generalized upper bounds
    0 references
    enumeration
    0 references
    approximation
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references