The constrained compartmentalized knapsack problem: mathematical models and solution methods (Q421557): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A Computer Based Interactive Approach To A Two-Stage Cutting Stock Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An LP-based approach to a two-stage cutting stock problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reel and sheet cutting at a paper mill / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition Principle for Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-phase roll cutting problem / 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: A Heuristic Programming Solution to a Nonlinear Cutting Stock Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The one dimensional Compartmentalised Knapsack problem: a case study / rank
 
Normal rank
Property / cites work
 
Property / cites work: The constrained compartmentalised knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangean relaxation based approach for the capacity allocation problem in flexible manufacturing systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Core Problems in Knapsack Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On two class-constrained versions of the multiple knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time approximation schemes for class-constrained packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds for online class-constrained packing / 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: Approximation schemes for knapsack problems with shelf divisions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The class constrained bin packing problem with applications to video-on-demand / rank
 
Normal rank
Property / cites work
 
Property / cites work: A one-dimensional bin packing problem with shelf divisions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on dual approximation algorithms for class constrained bin packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling multistage cutting stock problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Row and column generation technique for a multistage cutting stock problem / rank
 
Normal rank

Revision as of 04:49, 5 July 2024

scientific article
Language Label Description Also known as
English
The constrained compartmentalized knapsack problem: mathematical models and solution methods
scientific article

    Statements

    The constrained compartmentalized knapsack problem: mathematical models and solution methods (English)
    0 references
    0 references
    0 references
    0 references
    14 May 2012
    0 references
    cutting
    0 references
    knapsack problem
    0 references
    column generation
    0 references
    heuristics
    0 references

    Identifiers