Stabilized branch-and-price algorithms for vector packing problems
From MaRDI portal
Recommendations
- A branch-and-price algorithm for the two-dimensional vector packing problem
- Solving bin packing problems using VRPSolver models
- A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem
- A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function
- Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem
Cites work
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- A Linear Programming Approach to the Cutting-Stock Problem
- 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
- A set-covering-based heuristic approach for bin-packing problems
- A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem
- A typology of cutting and packing problems
- Asymmetry matters: dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- Bin packing and related problems: general arc-flow formulation with graph compression
- Column Generation
- Computational study of a column generation algorithm for bin packing and cutting stock problems
- Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing
- Cutting Stock Problems
- Dual inequalities for stabilized column generation revisited
- Dual-Optimal Inequalities for Stabilized Column Generation
- Exact solution of bin-packing problems using column generation and branch-and-bound
- Friendly bin packing instances without integer round-up property
- Introduction to algorithms.
- Lower bounds and algorithms for the 2-dimensional vector packing problem
- Multidimensional divide-and-conquer
- Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem
- Optimal rectangle packing: an absolute placement approach
- Selected Topics in Column Generation
- Shortest Path Problems with Resource Constraints
- Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
- The Three-Dimensional Bin Packing Problem
- The modified integer round-up property of the one-dimensional cutting stock problem
- Using extra dual cuts to accelerate column generation
Cited in
(12)- Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model
- Compact integer linear programming formulations for the temporal bin packing problem with fire-ups
- Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem
- Solving bin packing problems using VRPSolver models
- A generic exact solver for vehicle routing and related problems
- Lower and upper bounding procedures for the bin packing problem with concave loading cost
- A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function
- A branch-and-price algorithm for the two-dimensional vector packing problem
- An exact algorithm for two-dimensional vector packing problem with volumetric weight and general costs
- Algorithms for the bin packing problem with scenarios
- Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows
- A branch-and-price algorithm for the temporal bin packing problem
This page was built for publication: Stabilized branch-and-price algorithms for vector packing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q724108)
