Pages that link to "Item:Q1411613"
From MaRDI portal
The following pages link to Integer linear programming models for 2-staged two-dimensional knapsack problems (Q1411613):
Displaying 45 items.
- Models for the two-dimensional two-stage cutting stock problem with multiple stock size (Q336416) (← links)
- A parallel algorithm for two-staged two-dimensional fixed-orientation cutting problems (Q429470) (← links)
- A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size (Q439486) (← links)
- Bun splitting: a practical cutting stock problem (Q610959) (← links)
- Maximizing revenue with allocation of multiple advertisements on a Web banner (Q632692) (← links)
- A recursive branch-and-bound algorithm for constrained homogeneous T-shape cutting patterns (Q652857) (← links)
- Fast heuristic for constrained homogenous T-shape cutting patterns (Q693480) (← links)
- Recent advances on two-dimensional bin packing problems (Q697576) (← links)
- Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem (Q842766) (← links)
- An exact algorithm for generating homogeneous T-shape cutting patterns (Q856687) (← links)
- Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation (Q930939) (← links)
- An integer programming model for two- and three-stage two-dimensional cutting stock problems (Q976382) (← links)
- A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting (Q1039779) (← links)
- Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem (Q1662642) (← links)
- Minimum tiling of a rectangle by squares (Q1730580) (← links)
- Exact algorithms for the two-dimensional guillotine knapsack (Q1761943) (← links)
- Symmetry-breaking constraints for packing identical rectangles within polyhedra (Q1940443) (← links)
- Two-dimensional knapsack-block packing problem (Q1984921) (← links)
- Comparative analysis of pattern-based models for the two-dimensional two-stage guillotine cutting stock problem (Q2003574) (← links)
- Exact solution techniques for two-dimensional cutting and packing (Q2029021) (← links)
- Enhanced formulation for the Guillotine 2D Cutting knapsack problem (Q2099494) (← links)
- Strip based compact formulation for two-dimensional guillotine cutting problems (Q2108139) (← links)
- An effective heuristic based on column generation for the two-dimensional three-stage steel plate cutting problem (Q2158621) (← links)
- Packing by scheduling: using constraint programming to solve a complex 2D cutting stock problem (Q2170201) (← links)
- Solving a large cutting problem in the glass manufacturing industry (Q2189955) (← links)
- Heuristics for packing semifluids (Q2286867) (← links)
- Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers (Q2294074) (← links)
- Heuristic for the rectangular two-dimensional single stock size cutting stock problem with two-staged patterns (Q2356096) (← links)
- Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns (Q2384599) (← links)
- An enumeration scheme to generate constrained exact checkerboard patterns (Q2462561) (← links)
- Strip generation algorithms for constrained two-dimensional two-staged cutting problems (Q2490166) (← links)
- A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting (Q2576248) (← links)
- An integrated cutting stock and sequencing problem (Q2643965) (← links)
- The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview (Q2669629) (← links)
- A cutting plane method and a parallel algorithm for packing rectangles in a circular container (Q2673561) (← links)
- Two-stage two-dimensional guillotine cutting stock problems with usable leftover (Q2803258) (← links)
- Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming (Q2960367) (← links)
- A note on linear models for two-group and three-group two-dimensional guillotine cutting problems (Q3605433) (← links)
- Heurísticas para os problemas de geração e sequenciamento de padrões de corte bidimensionais (Q3621505) (← links)
- Linear models for 1-group two-dimensional guillotine cutting problems (Q5485054) (← links)
- An introduction to the two‐dimensional rectangular cutting and packing problem (Q6056889) (← links)
- Models for the two‐dimensional rectangular single large placement problem with guillotine cuts and constrained pattern (Q6067889) (← links)
- Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization (Q6067890) (← links)
- Mathematical models for the two-dimensional variable-sized cutting stock problem in the home textile industry (Q6106482) (← links)
- Revenue maximization for multiple advertisements placement on a web banner using a pixel-price model (Q6573359) (← links)
