The Meet-in-the-Middle Principle for Cutting and Packing Problems
From MaRDI portal
Publication:5137950
Recommendations
- Exact solution techniques for two-dimensional cutting and packing
- Bin packing and related problems: general arc-flow formulation with graph compression
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- Pattern reduction in one-dimensional cutting stock problems
- An improved typology of cutting and packing problems
Cites work
- A branch-and-cut algorithm for the pallet loading problem
- A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem
- A new constraint programming approach for the orthogonal packing problem
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- An Algorithm for Two-Dimensional Cutting Problems
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- 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 Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- An improved typology of cutting and packing problems
- An integer programming model for two- and three-stage two-dimensional cutting stock problems
- Arc-flow model for the two-dimensional guillotine cutting stock problem
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- BPPLIB: a library for bin packing and cutting stock problems
- Combinatorial Benders' cuts for the strip packing problem
- Computing Partitions with Applications to the Knapsack Problem
- Constraints in container loading -- a state-of-the-art review
- Exact algorithms for the two-dimensional strip packing problem with and without rotations
- Exact solution of bin-packing problems using column generation and branch-and-bound
- scientific article; zbMATH DE number 4074379 (Why is no real title available?)
- LP bounds in an interval-graph algorithm for orthogonal-packing feasibility
- LP bounds in various constraint programming approaches for orthogonal packing
- Models and bounds for two-dimensional level packing problems
- Multistage Cutting Stock Problems of Two and More Dimensions
- New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem
- Recursive Computational Procedure for Two-dimensional Stock Cutting
- The G4-Heuristic for the Pallet Loading Problem
Cited in
(37)- Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines
- Mathematical models and decomposition methods for the multiple knapsack problem
- Grids for cutting and packing problems: a study in the 2D knapsack problem
- Exact solution techniques for two-dimensional cutting and packing
- Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization
- New exact techniques applied to a class of network flow formulations
- Enhanced formulation for the Guillotine 2D Cutting knapsack problem
- Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost
- Arc flow formulations based on dynamic programming: theoretical foundations and applications
- The exact solutions of several types of container loading problems
- Scheduling jobs with release dates on identical parallel machines by minimizing the total weighted completion time
- An exact framework for the discrete parallel machine scheduling location problem
- Arc-flow approach for single batch-processing machine scheduling
- An exact approach for the green vehicle routing problem with two-dimensional loading constraints and split delivery
- A cutting plane method and a parallel algorithm for packing rectangles in a circular container
- Exact solution of network flow models with strong relaxations
- A Branch-and-Price Algorithm for the Multiple Knapsack Problem
- Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem
- Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems
- An introduction to the two‐dimensional rectangular cutting and packing problem
- On the optimal layout of a dining room in the era of COVID‐19 using mathematical optimization
- Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization
- Exact approaches for the unconstrained two-dimensional cutting problem with defects
- Mathematical models for the two-dimensional variable-sized cutting stock problem in the home textile industry
- Dynamic scheduling of patients in emergency departments
- A variable neighborhood search for the green vehicle routing problem with two-dimensional loading constraints and split delivery
- 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
- Two-dimensional bin packing, cutting stock, and open dimension problems: a survey of practical requirements
- Smart automated guided vehicle scheduling with flexible battery management: a new formulation and an exact approach
- Arc-flow formulation and branch-and-price-and-cut algorithm for the bin-packing problem with fragile objects
- 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
- Bounds and heuristic algorithms for the bin packing problem with minimum color fragmentation
- Mathematical models for the one-dimensional cutting stock problem with setups and open stacks
- A branch-and-cut algorithm for vehicle routing problems with three-dimensional loading constraints
- Extending the reflect flow formulation to variable-sized one-dimensional cutting and skiving stock problems
- Logistic constraints in container loading problems: the impact of complete shipment conditions
This page was built for publication: The Meet-in-the-Middle Principle for Cutting and Packing Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5137950)
