Bin packing and cutting stock problems: mathematical models and exact algorithms

DOI10.1016/j.ejor.2016.04.030zbMath1346.90700OpenAlexW2342137734WikidataQ57486953 ScholiaQ57486953MaRDI QIDQ323473

Manuel Iori, Silvano Martello, Maxence Delorme

Publication date: 7 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2016.04.030

zbMATH Keywords

bin packing exact algorithms cutting stock computational evaluation

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items

A residual recombination heuristic for one-dimensional cutting stock problems, An analysis of the integrated lot-sizing and cutting-stock problem formulation, A Posteriori Analysis of the Algorithms for Two-Bar Charts Packing Problem, An introduction to stochastic bin packing-based server consolidation with conflicts, Knapsack problems -- an overview of recent advances. I: Single knapsack problems, Logic based Benders' decomposition for orthogonal stock cutting problems, Integrated bin packing and lot-sizing problem considering the configuration-dependent bin packing process, Scheduling a single parallel-batching machine with non-identical job sizes and incompatible job families, The skiving stock problem and its relation to hypergraph matchings, Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem, Stabilized Column Generation Via the Dynamic Separation of Aggregated Rows, Multi-objective temporal bin packing problem: an application in cloud computing, Scheduling jobs with release dates on identical parallel machines by minimizing the total weighted completion time, A Bayesian Monte Carlo method for computing the Shapley value: application to weighted voting and bin packing games, Compact integer linear programming formulations for the temporal bin packing problem with fire-ups, An exact framework for the discrete parallel machine scheduling location problem, Single batch machine scheduling with dual setup times for autoclave molding manufacturing, Arc-flow approach for single batch-processing machine scheduling, Mathematical models and approximate solution approaches for the stochastic bin packing problem, Capping methods for the automatic configuration of optimization algorithms, Two-dimensional cutting stock problem with sequence dependent setup times, Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation, Analysis of the simple assembly line balancing problem complexity, Lexicographic optimization for the multi-container loading problem with open dimensions for a shoe manufacturer, An introduction to the two‐dimensional rectangular cutting and packing problem, An iterated greedy algorithm for the planning of yarn‐dyeing boilers, Same‐day deliveries in omnichannel retail: Integrated order picking and vehicle routing with vehicle‐site dependencies, A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics, A mixed‐integer linear model for the multiple heterogeneous knapsack problem with realistic container loading constraints and bins' priority, Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem, Bin Packing Problem with Time Lags, A study on load-balanced variants of the bin packing problem, Mathematical models for the two-dimensional variable-sized cutting stock problem in the home textile industry, Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows, The transportation problem with packing constraints, One-dimensional stock cutting resilient against singular random defects, A multi-start local search heuristic for the multi-period auto-carrier loading and transportation problem in Brazil, A combinatorial flow-based formulation for temporal bin packing problems, Exact and heuristic methods for a workload allocation problem with chain precedence constraints, Novel formulations and modeling enhancements for the dynamic berth allocation problem, Nested \((2,3)\)-instances of the cutting stock problem, A 4/3 OPT+2/3 approximation for big two-bar charts packing problem, A generic exact solver for vehicle routing and related problems, Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model, A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts, Exact solution of network flow models with strong relaxations, Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines, The Meet-in-the-Middle Principle for Cutting and Packing Problems, Primal Heuristics for Branch and Price: The Assets of Diving Methods, Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems, Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case, An empirical analysis of exact algorithms for the unbounded knapsack problem, Mathematical models for stable matching problems with ties and incomplete lists, A heuristic for the problem of one-dimensional steel coil cutting, Minimizing the number of machines with limited workload capacity for scheduling jobs with interval constraints, An exact model for a slitting problem in the steel industry, Arc flow formulations based on dynamic programming: theoretical foundations and applications, BPPLIB: a library for bin packing and cutting stock problems, An extended goal programming model for the multiobjective integrated lot-sizing and cutting stock problem, Characterizing IRDP-instances of the skiving stock problem by means of polyhedral theory, Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints, Colocating tasks in data centers using a side-effects performance model, Mathematical models and decomposition methods for the multiple knapsack problem, Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation, Optimization in Sanger sequencing, An upper bound of \(\Delta(E) < 3 \slash 2\) for skiving stock instances of the divisible case, New symmetry-less ILP formulation for the classical one dimensional bin-packing problem, Bin packing problem with conflicts and item fragmentation, 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, Stabilized branch-and-price algorithms for vector packing problems, A metaheuristic algorithm and structured analysis for the Line-haul Feeder vehicle routing problem with time windows, Solving bin packing problems using VRPSolver models, Random sampling and machine learning to understand good decompositions, A lexicographic pricer for the fractional bin packing problem, A hybrid evolutionary algorithm for the offline Bin Packing Problem, Sensitive Instances of the Cutting Stock Problem, A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems, Mathematical Models and Search Algorithms for the Capacitated p-Center Problem, Solving robust bin-packing problems with a branch-and-price approach, New exact techniques applied to a class of network flow formulations, Scheduling with uncertain processing times in mixed-criticality systems, Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups, A branch-and-price algorithm for the two-dimensional vector packing problem, Unnamed Item, Improved flow-based formulations for the skiving stock problem, Packing-based branch-and-bound for discrete malleable task scheduling, A branch-and-price algorithm for the temporal bin packing problem, Generalized relax-and-fix heuristic, On the exact separation of cover inequalities of maximum-depth

Uses Software

Cites Work