Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem (Q1662642): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An improved typology of cutting and packing 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: A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem / 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: Algorithms for Unconstrained Two-Dimensional Guillotine Cutting / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for the two-dimensional guillotine knapsack / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer linear programming models for 2-staged two-dimensional knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models and algorithms for three-stage two-dimensional bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral Characterization of Discrete Dynamic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solution of bin-packing problems using column generation and branch-and-bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arc-flow model for the two-dimensional guillotine cutting stock problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The two-dimensional cutting stock problem revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient elementary and restricted non-elementary route pricing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path-Reduced Costs for Eliminating Arcs in Routing and Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: The two-machine flowshop total completion time problem: branch-and-bound algorithms based on network-flow formulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Validation of subgradient optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Column generation for extended formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: New dynamic programming algorithms for the resource constrained elementary shortest path problem / 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: A dynamic programming method for single machine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate and exact algorithms for constrained (un)weighted two-dimensional two-staged cutting stock problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid genetic algorithm for the two-dimensional single large object placement problem / rank
 
Normal rank

Latest revision as of 10:22, 16 July 2024

scientific article
Language Label Description Also known as
English
Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem
scientific article

    Statements

    Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    20 August 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    cutting and packing
    0 references
    dynamic programming
    0 references
    Lagrangian filtering
    0 references
    reduced-cost fixing
    0 references
    0 references