Conservative scales in packing problems
From MaRDI portal
Publication:1944876
DOI10.1007/s00291-011-0277-9zbMath1263.90069OpenAlexW2041169912MaRDI QIDQ1944876
Publication date: 28 March 2013
Published in: OR Spectrum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00291-011-0277-9
convergenceliftinglinearizationpackingdual-feasible functionssequential linear programmingmultilinear programmingknapsack inequalitiescapacitated problemsconservative scalesresource-constrained problems
Related Items (7)
Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem ⋮ Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization ⋮ Using dual feasible functions to construct fast lower bounds for routing and location problems ⋮ LP bounds in various constraint programming approaches for orthogonal packing ⋮ Exact solution techniques for two-dimensional cutting and packing ⋮ The minimum raster set problem and its application to the \(d\)-dimensional orthogonal packing problem ⋮ Constraints in container loading -- a state-of-the-art review
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A survey of dual-feasible and superadditive functions
- A general framework for bounds for higher-dimensional orthogonal packing problems.
- Computing redundant resources for the resource constrained project scheduling problem
- New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation
- Large gaps in one-dimensional cutting stock problems
- Theoretical investigations on maximal dual feasible functions
- New lower bounds for bin packing problems with conflicts
- Bidimensional packing by bilinear programming
- A branch and bound algorithm for the strip packing problem
- A linear programming-based optimization algorithm for solving nonlinear programming problems
- Multilinear programming: Duality theories
- The two-dimensional finite bin packing problem. I: New lower bounds for the oriented case
- On the two-dimensional knapsack problem
- Families of non-IRUP instances of the one-dimensional cutting stock problem
- An algorithm for nonlinear optimization using linear programming and equality constrained subproblems
- A new constraint programming approach for the orthogonal packing problem
- An improved typology of cutting and packing problems
- A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
- Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem
- New Stabilization Procedures for the Cutting Stock Problem
- An Exact Algorithm for the Two-Dimensional Strip-Packing Problem
- New data-dependent dual-feasible functions and lower bounds for a two-dimensional bin-packing problem
- A Linear Programming Approach to the Cutting-Stock Problem
- The Cutting-Plane Method for Solving Convex Programs
- The Three-Dimensional Pallet Chart: An Analysis of the Factors Affecting the Set of Feasible Layouts for a Class of Two-Dimensional Packing Problems
- An Exact Algorithm for Higher-Dimensional Orthogonal Packing
- One-dimensional relaxations and LP bounds for orthogonal packing
- An Improved Successive Linear Programming Algorithm
- Nonlinear Optimization by Successive Linear Programming
- New Filtering for the $\mathit{cumulative}$ Constraint in the Context of Non-Overlapping Rectangles
- A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing
- New classes of fast lower bounds for bin packing problems
This page was built for publication: Conservative scales in packing problems
