Integer linear programming models for 2-staged two-dimensional knapsack problems
From MaRDI portal
Publication:1411613
DOI10.1007/s10107-002-0319-9zbMath1030.90064OpenAlexW2045250369MaRDI QIDQ1411613
Publication date: 29 October 2003
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-002-0319-9
Related Items
Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem, Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns, An exact algorithm for generating homogeneous T-shape cutting patterns, Models for the two-dimensional two-stage cutting stock problem with multiple stock size, An integrated cutting stock and sequencing problem, An effective heuristic based on column generation for the two-dimensional three-stage steel plate cutting problem, Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem, Packing by scheduling: using constraint programming to solve a complex 2D cutting stock problem, The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview, Bun splitting: a practical cutting stock problem, 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, Models for the two‐dimensional rectangular single large placement problem with guillotine cuts and constrained pattern, Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization, Solving a large cutting problem in the glass manufacturing industry, Mathematical models for the two-dimensional variable-sized cutting stock problem in the home textile industry, Symmetry-breaking constraints for packing identical rectangles within polyhedra, Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming, Maximizing revenue with allocation of multiple advertisements on a Web banner, A parallel algorithm for two-staged two-dimensional fixed-orientation cutting problems, A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size, A recursive branch-and-bound algorithm for constrained homogeneous T-shape cutting patterns, Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation, Minimum tiling of a rectangle by squares, An enumeration scheme to generate constrained exact checkerboard patterns, Two-dimensional knapsack-block packing problem, Fast heuristic for constrained homogenous T-shape cutting patterns, Comparative analysis of pattern-based models for the two-dimensional two-stage guillotine cutting stock problem, Exact algorithms for the two-dimensional guillotine knapsack, Recent advances on two-dimensional bin packing problems, Strip generation algorithms for constrained two-dimensional two-staged cutting problems, An integer programming model for two- and three-stage two-dimensional cutting stock problems, A note on linear models for two-group and three-group two-dimensional guillotine cutting problems, Exact solution techniques for two-dimensional cutting and packing, Heuristics for packing semifluids, Two-stage two-dimensional guillotine cutting stock problems with usable leftover, Heurísticas para os problemas de geração e sequenciamento de padrões de corte bidimensionais, Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers, Linear models for 1-group two-dimensional guillotine cutting problems, A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting, A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting, Enhanced formulation for the Guillotine 2D Cutting knapsack problem, Strip based compact formulation for two-dimensional guillotine cutting problems, Heuristic for the rectangular two-dimensional single stock size cutting stock problem with two-staged patterns
