Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem
From MaRDI portal
Recommendations
- Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem
- Combinatorial Benders' cuts for the strip packing problem
- Exact solution of the two-dimensional finite bin packing problem
- A new exact method for the two-dimensional bin-packing problem with fixed orientation
- Two-dimensional packing problems: a survey
Cites work
- A branch and bound algorithm for the strip packing problem
- A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
- A goal-driven approach to the 2D bin packing and variable-sized bin packing problems
- A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
- A new constraint programming approach for the orthogonal packing problem
- A new exact method for the two-dimensional orthogonal packing problem
- A set-covering-based heuristic approach for bin-packing problems
- A survey of dual-feasible and superadditive functions
- A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem
- An Algorithm for Two-Dimensional Cutting Problems
- An Exact Algorithm for Higher-Dimensional Orthogonal Packing
- An exact algorithm for the two-dimensional orthogonal packing problem with unloading constraints
- An exact algorithm for the two-dimensional strip-packing problem
- An exact approach to the strip-packing problem
- An improved branch and bound algorithm for the maximum clique problem
- An improved typology of cutting and packing problems
- Bidimensional packing by bilinear programming
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- BPPLIB: a library for bin packing and cutting stock problems
- Classification and literature review of integrated lot-sizing and cutting stock problems
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Combinatorial Benders' cuts for the strip packing problem
- Conservative scales in packing problems
- Constraints in container loading -- a state-of-the-art review
- Dual-feasible functions for integer programming and combinatorial optimization. Basics, extensions and applications
- Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems
- Exact solution of bin-packing problems using column generation and branch-and-bound
- Exact solution of the two-dimensional finite bin packing problem
- Exact solution techniques for two-dimensional cutting and packing
- Faces for a linear inequality in 0–1 variables
- Facets of the knapsack polytope
- Guided local search for the three-dimensional bin-packing problem
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- Introduction to cutting and packing optimization. Problems, modeling approaches, solution methods
- Logic based Benders' decomposition for orthogonal stock cutting problems
- LP models for bin packing and cutting stock problems
- Mathematical methods of organizing and planning production. English translation by Robert W. Campbell and W. H. Marlow
- Mathematical models and decomposition methods for the multiple knapsack problem
- New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation
- New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem
- On the two-dimensional knapsack problem
- Planning and Scheduling by Logic-Based Benders Decomposition
- Recursive Computational Procedure for Two-dimensional Stock Cutting
- Review: An annotated bibliography of combined routing and loading problems
- Routing problems with loading constraints
- Scheduling inspired models for two-dimensional packing problems
- Separation algorithms for 0-1 knapsack polytopes
- The load-balanced multi-dimensional bin-packing problem
- The Meet-in-the-Middle Principle for Cutting and Packing Problems
- The two-dimensional finite bin packing problem. II: New lower and upper bounds
- TSpack: A unified tabu search code for multi-dimensional bin packing problems
- Two-dimensional bin packing problems
- Two-Dimensional Finite Bin-Packing Algorithms
- Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem
Cited in
(18)- Benders decomposition: solving binary master problems by enumeration
- Order assignment and scheduling under processing and distribution time uncertainty
- The b‐bibranching problem: TDI system, packing, and discrete convexity
- Lower and upper bounding procedures for the bin packing problem with concave loading cost
- Logic-based Benders decomposition for the preemptive flexible job-shop scheduling problem
- A Primal Decomposition Algorithm for the Two-dimensional Bin Packing Problem
- Combinatorial Benders decomposition for the operational aircraft maintenance routing problem
- Logic-based benders decomposition methods for the distributed flexible job shop scheduling problem
- Solving the strip packing problem with a decomposition framework and a generic solver: implementation, tuning, and reinforcement-learning-based hybridization
- 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
- Mathematical models and heuristic algorithms for pallet building problems with practical constraints
- Improved randomized approaches to the location of a conservative hyperplane
- Solving the parallel processor scheduling and bin packing problems with contiguity constraints: mathematical models and computational studies
- A new branch-and-cut approach for integrated planning in additive manufacturing
- Combinatorial Benders decomposition for single machine scheduling in additive manufacturing with two-dimensional packing constraints
- Benders decompositions for order acceptance and scheduling in additive manufacturing
- Branch-and-repair for the stochastic three-dimensional bin selection problem: a multi-stage stochastic programming application
- Improving the efficiency of logic-based benders decomposition for p-batch scheduling problems with two-dimensional packing
This page was built for publication: Combinatorial Benders Decomposition for 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 Q5085469)
