The Meet-in-the-Middle Principle for Cutting and Packing Problems
From MaRDI portal
Publication:5137950
DOI10.1287/ijoc.2018.0806OpenAlexW2898866180MaRDI QIDQ5137950
Jean-François Côté, Manuel Iori
Publication date: 3 December 2020
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11380/1168938
Related Items
Logistic constraints in container loading problems: the impact of complete shipment conditions, A Branch-and-Price Algorithm for the Multiple Knapsack Problem, Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost, Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem, 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, 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, Exact solution of network flow models with strong relaxations, Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines, Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems, Arc flow formulations based on dynamic programming: theoretical foundations and applications, 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, The exact solutions of several types of container loading problems, New exact techniques applied to a class of network flow formulations, Enhanced formulation for the Guillotine 2D Cutting knapsack problem
Uses Software
Cites Work
- Unnamed Item
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- An integer programming model for two- and three-stage two-dimensional cutting stock problems
- 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
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- BPPLIB: a library for bin packing and cutting stock problems
- LP bounds in various constraint programming approaches for orthogonal packing
- A branch-and-cut algorithm for the pallet loading problem
- Models and bounds for two-dimensional level packing problems
- Constraints in container loading -- a state-of-the-art review
- A new constraint programming approach for the orthogonal packing problem
- An improved typology of cutting and packing problems
- Arc-flow model for the two-dimensional guillotine cutting stock problem
- Combinatorial Benders' Cuts for the Strip 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
- A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- Computing Partitions with Applications to the Knapsack Problem
- An Algorithm for Two-Dimensional Cutting Problems
- The G4-Heuristic for the Pallet Loading Problem
- New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem
- LP Bounds in an Interval-Graph Algorithm for Orthogonal-Packing Feasibility
- Multistage Cutting Stock Problems of Two and More Dimensions
- Recursive Computational Procedure for Two-dimensional Stock Cutting
