Stabilized branch-and-price algorithms for vector packing problems
type: Item
instance of: scholarly article
title: Stabilized branch-and-price algorithms for vector packing problems
zbMATH Open document ID: 1403.90572
author: Katrin Heßler
author: Timo Gschwind
author: Stefan Irnich
published in: European Journal of Operational Research
publication date: 2018-07-25T00:00:00Z
full work available at URL: Discussion Paper 1713.pdf
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6910108
zbMATH Keywords: cutting
zbMATH Keywords: vector packing
zbMATH Keywords: shortest path problem with resource constraints
zbMATH Keywords: dual-optimal inequalities
zbMATH Keywords: stabilization
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W2778609253
cites work: A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem
cites work: Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem
cites work: Cutting Stock Problems
cites work: Dual-Optimal Inequalities for Stabilized Column Generation
cites work: Multidimensional divide-and-conquer
cites work: Bin packing and related problems: general arc-flow formulation with graph compression
cites work: Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing
cites work: Friendly bin packing instances without integer round-up property
cites work: Lower bounds and algorithms for the 2-dimensional vector packing problem
cites work: Q3651735
cites work: Bin packing and cutting stock problems: mathematical models and exact algorithms
cites work: Column Generation
cites work: A typology of cutting and packing problems
cites work: A Linear Programming Approach to the Cutting-Stock Problem
cites work: Dual inequalities for stabilized column generation revisited
cites work: A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function
cites work: Optimal Rectangle Packing: An Absolute Placement Approach
cites work: Shortest Path Problems with Resource Constraints
cites work: Q4821303
cites work: Selected Topics in Column Generation
cites work: The Three-Dimensional Bin Packing Problem
cites work: A set-covering-based heuristic approach for bin-packing problems
cites work: Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
cites work: The modified integer round-up property of the one-dimensional cutting stock problem
cites work: A branch-and-bound algorithm for the two-dimensional vector packing problem
cites work: Asymmetry matters: dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster
cites work: Exact solution of bin-packing problems using column generation and branch-and-bound
cites work: Using extra dual cuts to accelerate column generation
cites work: Computational study of a column generation algorithm for bin packing and cutting stock problems
Wikidata QID: Q129860240
DOI: 10.1016/J.EJOR.2018.04.047
description: scientific article; zbMATH DE number 6910108