Analysis of upper bounds for the pallet loading problem (Q5939589): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57702385 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing the maximum number of \(m\times n\) tiles in a large \(p\times q\) rectangle / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical Considerations of the Pallet-Loading Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Three-Dimensional Pallet Chart: An Analysis of the Factors Affecting the Set of Feasible Layouts for a Class of Two-Dimensional Packing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining an upper bound for a class of rectangular packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the pallet loading problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A typology of cutting and packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds for the homogeneous case of a two-dimensional packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incidence matrices and interval graphs / 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: An exact algorithm for general, orthogonal, two-dimensional knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: An instance of the cutting stock problem for which the rounding property does not hold / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple and effective recursive procedure for the manufacturer's pallet loading problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The G4-Heuristic for the Pallet Loading Problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:59, 3 June 2024

scientific article; zbMATH DE number 1626208
Language Label Description Also known as
English
Analysis of upper bounds for the pallet loading problem
scientific article; zbMATH DE number 1626208

    Statements

    Analysis of upper bounds for the pallet loading problem (English)
    0 references
    0 references
    0 references
    2001
    0 references
    0 references
    Packing
    0 references
    Pallet loading problem
    0 references
    linear programming relaxation
    0 references
    packing identical boxes into rectangular pallets
    0 references
    0 references