An exact algorithm for general, orthogonal, two-dimensional knapsack problems (Q1388927): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A algorithm for two-dimensional packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal Packings in Two Dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Unconstrained Two-Dimensional Guillotine Cutting / 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: Network flows and non-guillotine cutting patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Two-Dimensional Cutting Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average-case analysis of cutting and packing in two dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3347319 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approach to two-dimensional cutting stock problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Algorithm for the Non-Guillotine-Constrained Cutting-Stock Problem / 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: Efficient automated pallet loading / 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: The cutting stock problem in the canvas industry / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multistage Cutting Stock Problems of Two and More Dimensions / 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: Cutting stock problems and solution procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling-salesman problem and minimum spanning trees: Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Validation of subgradient optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive Computational Procedure for Two-dimensional Stock Cutting / rank
 
Normal rank
Property / cites work
 
Property / cites work: The trim-loss and assortment problems: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparative study of heuristics for a two-level routing-location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved version of Wang's algorithm for two-dimensional cutting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0377-2217(93)e0278-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1991209994 / rank
 
Normal rank

Latest revision as of 11:01, 30 July 2024

scientific article
Language Label Description Also known as
English
An exact algorithm for general, orthogonal, two-dimensional knapsack problems
scientific article

    Statements

    An exact algorithm for general, orthogonal, two-dimensional knapsack problems (English)
    0 references
    11 June 1998
    0 references
    0 references
    two-dimensional
    0 references
    knapsack problem
    0 references
    optimization
    0 references
    integer programming
    0 references
    exact tree-search
    0 references
    0 references
    0 references
    0 references