New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem
From MaRDI portal
Publication:4814179
DOI10.1093/imaman/13.2.95zbMath1097.90546OpenAlexW1978116914MaRDI QIDQ4814179
Aristide Mingozzi, Eleni Hadjiconstantinou, Marco Antonio Boschetti
Publication date: 7 September 2004
Published in: IMA Journal of Management Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/imaman/13.2.95
Related Items
Logistic constraints in container loading problems: the impact of complete shipment conditions, A hybrid evolutionary algorithm for the two-dimensional packing problem, A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem, A hybrid genetic algorithm for the two-dimensional single large object placement problem, A new exact method for the two-dimensional orthogonal packing problem, A Lagrangian heuristic for sprint planning in agile software development, Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem, Compact integer linear programming formulations for the temporal bin packing problem with fire-ups, A cutting plane method and a parallel algorithm for packing rectangles in a circular container, An introduction to the two‐dimensional rectangular cutting and packing problem, Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization, A MIP model and a biased random-key genetic algorithm based approach for a two-dimensional cutting problem with defects, A NEW HEURISTIC ALGORITHM FOR CONSTRAINED RECTANGLE-PACKING PROBLEM, A combinatorial flow-based formulation for temporal bin packing problems, Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming, The three-dimensional knapsack problem with balancing constraints, The Meet-in-the-Middle Principle for Cutting and Packing Problems, On the two-dimensional knapsack problem, Heuristic approaches for the two- and three-dimensional knapsack packing problem, Exact algorithms for the two-dimensional guillotine knapsack, Grids for cutting and packing problems: a study in the 2D knapsack problem, Exact solution techniques for two-dimensional cutting and packing, The maximum diversity assortment selection problem, The exact solutions of several types of container loading problems, A branch and bound algorithm for the strip packing problem, Mathematical Models and Search Algorithms for the Capacitated p-Center Problem, Enhanced formulation for the Guillotine 2D Cutting knapsack problem
Uses Software
