Stabilized branch-and-price algorithms for vector packing problems

DOI10.1016/j.ejor.2018.04.047zbMath1403.90572OpenAlexW2778609253WikidataQ129860240 ScholiaQ129860240MaRDI QIDQ724108

Katrin Heßler, Stefan Irnich, Timo Gschwind

Publication date: 25 July 2018

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

Full work available at URL: https://download.uni-mainz.de/RePEc/pdf/Discussion_Paper_1713.pdf

zbMATH Keywords

stabilizationcuttingvector packingshortest path problem with resource constraintsdual-optimal inequalities

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (9)

Compact integer linear programming formulations for the temporal bin packing problem with fire-ups ⋮ An exact algorithm for two-dimensional vector packing problem with volumetric weight and general costs ⋮ 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 ⋮ Solving bin packing problems using VRPSolver models ⋮ A branch-and-price algorithm for the two-dimensional vector packing problem ⋮ A branch-and-price algorithm for the temporal bin packing problem

Cites Work

• Unnamed Item
• Unnamed Item
• Multidimensional divide-and-conquer
• Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem
• Bin packing and cutting stock problems: mathematical models and exact algorithms
• Bin packing and related problems: general arc-flow formulation with graph compression
• Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing
• A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem
• The modified integer round-up property of the one-dimensional cutting stock problem
• Exact solution of bin-packing problems using column generation and branch-and-bound
• A branch-and-bound algorithm for the two-dimensional vector packing problem
• A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function
• Asymmetry matters: dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster
• A typology of cutting and packing problems
• Computational study of a column generation algorithm for bin packing and cutting stock problems
• Friendly bin packing instances without integer round-up property
• Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
• Dual Inequalities for Stabilized Column Generation Revisited
• Using Extra Dual Cuts to Accelerate Column Generation
• A Set-Covering-Based Heuristic Approach for Bin-Packing Problems
• A Linear Programming Approach to the Cutting-Stock Problem
• Dual-Optimal Inequalities for Stabilized Column Generation
• The Three-Dimensional Bin Packing Problem
• Optimal Rectangle Packing: An Absolute Placement Approach
• Column Generation
• Selected Topics in Column Generation
• Shortest Path Problems with Resource Constraints
• Cutting Stock Problems
• Lower bounds and algorithms for the 2-dimensional vector packing problem

This page was built for publication: Stabilized branch-and-price algorithms for vector packing problems