Models and bounds for two-dimensional level packing problems
From MaRDI portal
Publication:1888172
DOI10.1023/B:JOCO.0000038915.62826.79zbMath1084.90031OpenAlexW2067278214MaRDI QIDQ1888172
Andrea Lodi, Daniele Vigo, Silvano Martello
Publication date: 22 November 2004
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:joco.0000038915.62826.79
Related Items
Models for the two-dimensional two-stage cutting stock problem with multiple stock size, An improved typology of cutting and packing problems, A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem, Models and algorithms for three-stage two-dimensional bin packing, An effective heuristic based on column generation for the two-dimensional three-stage steel plate cutting problem, Arc-flow model for the two-dimensional guillotine cutting stock problem, An exact method for the 2D guillotine strip packing problem, Triple-solution approach for the strip packing problem with two-staged patterns, The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview, A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint, Ejection chain moves for automatic neighborhood synthesis in constrained cardinality‐minimization problems, Dantzig-Wolfe decomposition and branch-and-price solving in G12, The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers, The Meet-in-the-Middle Principle for Cutting and Packing Problems, From High-Level Model to Branch-and-Price Solution in G12, Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation, Characterization and modelling of guillotine constraints, An optimization algorithm for a penalized knapsack problem, Two-dimensional knapsack-block packing problem, Comparative analysis of pattern-based models for the two-dimensional two-stage guillotine cutting stock problem, Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing, A GRASP-based approach for technicians and interventions scheduling for telecommunications, Order and static stability into the strip packing problem, An integer programming model for two- and three-stage two-dimensional cutting stock problems, Exact solution techniques for two-dimensional cutting and packing, Partial enumeration algorithms for two-dimensional bin packing problem with guillotine constraints, Sequential value correction heuristic for the two-dimensional cutting stock problem with three-staged homogenous patterns, Hybrid approach for the two-dimensional bin packing problem with two-staged patterns, Un algorithme GRASP pour le problème de planification de techniciens et d'interventions pour les télécommunications, A branch-and-price algorithm for the two-dimensional level strip packing problem, Models and heuristic algorithms for a weighted vertex coloring problem, New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems, Two-dimensional packing problems: a survey, An efficient deterministic optimization approach for rectangular packing problems, Heuristic for the rectangular two-dimensional single stock size cutting stock problem with two-staged patterns
