Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem
From MaRDI portal
Recommendations
- Exact solution of the two-dimensional finite bin packing problem
- Exact solution techniques for two-dimensional cutting and packing
- The two-dimensional bin packing problem with variable bin sizes and costs
- A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts
- Two-dimensional packing problems: a survey
Cited in
(79)- The two dimensional bin packing problem with side constraints
- Instance space analysis for 2D bin packing mathematical models
- Exact solution techniques for two-dimensional cutting and packing
- A global optimization point of view to handle non-standard object packing problems
- Exact solution of graph coloring problems via constraint programming and column generation
- A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem
- Routing problems with loading constraints
- Conservative scales in packing problems
- An introduction to the two‐dimensional rectangular cutting and packing problem
- Constraint programming and operations research
- Propagating logic-based Benders' decomposition approaches for distributed operating room scheduling
- Logic based Benders' decomposition for orthogonal stock cutting problems
- Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem
- New lower bound and exact method for the continuous berth allocation problem
- Optimizing two-dimensional vehicle loading and dispatching decisions in freight logistics
- A fast large neighborhood search for disjunctively constrained knapsack problems
- A computational study of lower bounds for the two dimensional bin packing problem
- A column generation approach for the integrated shift and task scheduling problem of logistics assistants in hospitals
- A hybrid feasibility constraints-guided search to the two-dimensional bin packing problem with due dates
- Mathematical models and decomposition methods for the multiple knapsack problem
- A hybrid heuristic algorithm for the 2D variable-sized bin packing problem
- Logic-based Benders decomposition for the preemptive flexible job-shop scheduling problem
- Consecutive ones matrices for multi-dimensional orthogonal packing problems
- A heuristic for solving large bin packing problems in two and three dimensions
- One-dimensional relaxations and LP bounds for orthogonal packing
- Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows
- Modeling two-dimensional guillotine cutting problems via integer programming
- An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem
- An efficient genetic algorithm with a corner space algorithm for a cutting stock problem in the TFT-LCD industry
- Constraint programming-based column generation
- Using logic-based Benders decomposition to solve the capacity- and distance-constrained plant location problem
- Exact algorithms for the two-dimensional guillotine knapsack
- Heuristic approaches for the two- and three-dimensional knapsack packing problem
- An integer programming model for two- and three-stage two-dimensional cutting stock problems
- New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
- A new constraint programming approach for the orthogonal packing problem
- Mixed-integer and constraint programming models for the two-dimensional guillotine cutting problem
- Space and time allocation in a shipyard assembly hall
- A constraint programming based column generation approach to nurse rostering problems
- The off-line group seat reservation problem
- Novel formulations and logic-based Benders decomposition for the integrated parallel machine scheduling and location problem
- A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function
- LP bounds in various constraint programming approaches for orthogonal packing
- Models for two-dimensional bin packing problems with customer order spread
- A branch-and-price algorithm for the two-dimensional vector packing problem
- Models for the two-dimensional two-stage cutting stock problem with multiple stock size
- An exact branch-and-price approach for the medical student scheduling problem
- Two dimensional guillotine cutting stock and scheduling problem in printing industry
- An MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts
- Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem
- The load-balanced multi-dimensional bin-packing problem
- A new exact method for the two-dimensional bin-packing problem with fixed orientation
- Bidimensional packing by bilinear programming
- Solving the pricing problem in a branch-and-price algorithm for graph coloring using zero-suppressed binary decision diagrams
- EATKG: an open-source efficient \underline{E}xact \underline{A}lgorithm for the \underline{T}wo-dimensional \underline{K}napsack problem with \underline{G}uillotine constraints
- Partial enumeration algorithms for two-dimensional bin packing problem with guillotine constraints
- The three-dimensional knapsack problem with balancing constraints
- Packing ovals in optimized regular polygons
- A cutting plane method and a parallel algorithm for packing rectangles in a circular container
- Heuristics for packing semifluids
- Logic-based Benders decomposition method for the \textit{seru} scheduling problem with sequence-dependent setup time and DeJong's learning effect
- Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts
- Model development and optimization for space engineering: concepts, tools, applications, and perspectives
- Multi-dimensional bin packing problems with guillotine constraints
- Constraint programming-based column generation
- Recursive logic-based Benders' decomposition for multi-mode outpatient scheduling
- The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers
- The two-dimensional bin packing problem with variable bin sizes and costs
- Mathematical models for the two-dimensional variable-sized cutting stock problem in the home textile industry
- Hybrid approach for the two-dimensional bin packing problem with two-staged patterns
- A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
- Deterministic model for customized pilot manufacture production with various backplane sizes
- An exact algorithm for the two-dimensional stage-unrestricted guillotine cutting/packing decision problem
- Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem
- A branch-and-price algorithm for the temporal bin packing problem
- Enhanced formulation for the Guillotine 2D Cutting knapsack problem
- A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem
- A new branch-and-cut approach for integrated planning in additive manufacturing
- Models and algorithms for three-stage two-dimensional bin packing
This page was built for publication: Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2892309)
