Exact solution of bin-packing problems using column generation and branch-and-bound

Recommendations

Bin packing and related problems: general arc-flow formulation with graph compression
Exact Solution of Cutting Stock Problems Using Column Generation and Branch-and-Bound
scientific article; zbMATH DE number 1779967
Solving bin packing problems using VRPSolver models
Bin packing and cutting stock problems: mathematical models and exact algorithms

Cited in

(only showing first 100 items - show all)

Deriving compact extended formulations via LP-based separation techniques
BPPLIB: a library for bin packing and cutting stock problems
Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines
A branch-and-price algorithm for the temporal bin packing problem
A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts
Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem
Bin packing problem with conflicts and item fragmentation
The Meet-in-the-Middle Principle for Cutting and Packing Problems
An integer programming column generation principle for heuristic search methods
Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model
Heuristics for determining the number of warehouses for storing non-compatible products
Solving the one-dimensional bin packing problem with a weight annealing heuristic
Arc-flow approach for single batch-processing machine scheduling
Compact integer linear programming formulations for the temporal bin packing problem with fire-ups
A branch-and-cut algorithm for the soft-clustered vehicle-routing problem
Novel formulations and modeling enhancements for the dynamic berth allocation problem
Prospective network flow models and algorithms for bin packing problems
Fast lifting procedures for the bin packing problem
Exact solution techniques for two-dimensional cutting and packing
Arc-flow model for the two-dimensional guillotine cutting stock problem
A note on the minimum bounded edge-partition of a tree
An introduction to the two‐dimensional rectangular cutting and packing problem
Mathematical models and a heuristic method for the multiperiod one-dimensional cutting stock problem
Layout optimisation for an installation port of an offshore wind farm
Logic based Benders' decomposition for orthogonal stock cutting problems
Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation
Revenue maximization for multiple advertisements placement on a web banner using a pixel-price model
Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem
Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems
Dual inequalities for stabilized column generation revisited
A lexicographic pricer for the fractional bin packing problem
Arcs-states models for the vehicle routing problem with time windows and related problems
Branching in branch-and-price: A generic scheme
Improved flow-based formulations for the skiving stock problem
Solution methods for scheduling problems with sequence-dependent deterioration and maintenance events
The maximum k-colorable subgraph problem and orbitopes
Lower bounds for a bin packing problem with linear usage cost
Mathematical models and decomposition methods for the multiple knapsack problem
The one-dimensional cutting stock problem with due dates
Algorithms for the one-dimensional two-stage cutting stock problem
Classification and literature review of integrated lot-sizing and cutting stock problems
Stabilized branch-and-price algorithms for vector packing problems
Decomposition methods for the lot-sizing and cutting-stock problems in paper industries
A residual recombination heuristic for one-dimensional cutting stock problems
Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization
A Branch-and-Price Algorithm for the Multiple Knapsack Problem
Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems
An effective heuristic based on column generation for the two-dimensional three-stage steel plate cutting problem
Solution approaches for the cutting stock problem with setup cost
A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems
An introduction to stochastic bin packing-based server consolidation with conflicts
LP models for bin packing and cutting stock problems
Solving robust bin-packing problems with a branch-and-price approach
Column generation for extended formulations
New lower bounds based on column generation and constraint programming for the pattern minimization problem
Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers
Heuristic algorithms based on column generation for an online product shipping problem
Lower and upper bounding procedures for the bin packing problem with concave loading cost
Large multiple neighborhood search for the clustered vehicle-routing problem
Integer linear programming models for the skiving stock problem
Bin packing and cutting stock problems: mathematical models and exact algorithms
Skewed general variable neighborhood search for the location routing scheduling problem
Bin packing and related problems: general arc-flow formulation with graph compression
Integrated scheduling problem on a single bounded batch machine with an unavailability constraint
Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem
A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function
A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems
A branch-and-price algorithm for the two-dimensional vector packing problem
Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem
Discrete dynamical system approaches for Boolean polynomial optimization
Two heuristics for the capacitated multi-period cutting stock problem with pattern setup cost
Simultaneously exploiting two formulations: an exact Benders decomposition approach
Vector bin packing with heterogeneous bins: application to the machine reassignment problem
The fixed-charge shortest-path problem
New exact techniques applied to a class of network flow formulations
Column generation for extended formulations
Column generation decomposition with the degenerate constraints in the subproblem
Pattern-based ILP models for the one-dimensional cutting stock problem with setup cost
Large multiple neighborhood search for the soft-clustered vehicle-routing problem
An exact framework for the discrete parallel machine scheduling location problem
Integer programming models for the multidimensional assignment problem with star costs
A three-dimensional bin-packing model: exact multicriteria solution and computational complexity
Deriving compact extended formulations via LP-based separation techniques
Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing
An exact approach based on a new pseudo-polynomial network flow model for integrated planning and scheduling
scientific article; zbMATH DE number 1779967 (Why is no real title available?)
Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems
New heuristics for one-dimensional bin-packing
A Numerically Exact Algorithm for the Bin-Packing Problem
Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths
Two heuristics for the one-dimensional bin-packing problem
Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
Augmented neural networks and problem structure-based heuristics for the bin-packing problem
Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost
On compact formulations for integer programs solved by column generation
Characterizing IRDP-instances of the skiving stock problem by means of polyhedral theory
Column generation extensions of set covering greedy heuristics
0-1 reformulations of the multicommodity capacitated network design problem
Arc flow formulations based on dynamic programming: theoretical foundations and applications
Mathematical models and approximate solution approaches for the stochastic bin packing problem

Describes a project that uses

Uses Software

OR-Library

This page was built for publication: Exact solution of bin-packing problems using column generation and branch-and-bound

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1290171)