Bin packing and related problems: general arc-flow formulation with graph compression
From MaRDI portal
Publication:342316
DOI10.1016/j.cor.2015.11.009zbMath1349.90706arXiv1310.6887OpenAlexW2963964677MaRDI QIDQ342316
João Pedro Pedroso, Filipe Brandão
Publication date: 17 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1310.6887
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)
Related Items (35)
An introduction to stochastic bin packing-based server consolidation with conflicts ⋮ Bin packing and cutting stock problems: mathematical models and exact algorithms ⋮ Vector bin packing with heterogeneous bins: application to the machine reassignment problem ⋮ An effective heuristic based on column generation for the two-dimensional three-stage steel plate cutting problem ⋮ The skiving stock problem and its relation to hypergraph matchings ⋮ Models and Algorithms for the Bin-Packing Problem with Minimum Color Fragmentation ⋮ 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 ⋮ Multi-period bin packing model and effective constructive heuristics for corridor-based logistics capacity planning ⋮ Arc-flow approach for single batch-processing machine scheduling ⋮ An exact algorithm for two-dimensional vector packing problem with volumetric weight and general costs ⋮ Analysis of the simple assembly line balancing problem complexity ⋮ An introduction to the two‐dimensional rectangular cutting and packing problem ⋮ Lower and upper bounding procedures for the bin packing problem with concave loading cost ⋮ Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows ⋮ 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 ⋮ Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems ⋮ Arc flow formulations based on dynamic programming: theoretical foundations and applications ⋮ BPPLIB: a library for bin packing and cutting stock problems ⋮ The proper relaxation and the proper gap of the skiving stock problem ⋮ A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems ⋮ Mathematical models and decomposition methods for the multiple knapsack problem ⋮ Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation ⋮ Bin packing problem with conflicts and item fragmentation ⋮ Multi-warehouse package consolidation for split orders in online retailing ⋮ Stabilized branch-and-price algorithms for vector packing problems ⋮ Solving bin packing problems using VRPSolver models ⋮ A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems ⋮ On the benchmark instances for the bin packing problem with conflicts ⋮ A branch-and-price algorithm for the two-dimensional vector packing problem ⋮ 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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem
- Exact solution of bin-packing problems using column generation and branch-and-bound
- BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
- LP models for bin packing and cutting stock problems
- Heuristics for the integer one-dimensional cutting stock problem: A computational study
- Improved results for a memory allocation problem
- An improved typology of cutting and packing problems
- Algorithms for the Bin Packing Problem with Conflicts
- A Linear Programming Approach to the Cutting-Stock Problem
- Integer Rounding for Polymatroid and Branching Optimization Problems
- The Bin‐Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
- Algorithm 457: finding all cliques of an undirected graph
- Lower bounds and algorithms for the 2-dimensional vector packing problem
This page was built for publication: Bin packing and related problems: general arc-flow formulation with graph compression
