Priority-based bin packing with subset constraints

DOI10.1016/j.dam.2023.08.019OpenAlexW4386798607MaRDI QIDQ6184311

Bugra Caskurlu, Alvaro Velasquez, Piotr J. Wojciechowski, K. Subramani and Vahan Mkrtchyan

Publication date: 24 January 2024

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2023.08.019

zbMATH Keywords

optimizationmatchingapproximationbin packingSETH

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey on the structure of approximation classes
• Online algorithms with advice for bin packing and scheduling problems
• Exact exponential algorithms.
• Computing stable loads for pallets
• Weight distribution considerations in container loading
• Bin packing can be solved within 1+epsilon in linear time
• Optimization, approximation, and complexity classes
• An efficient approach for the multi-pallet loading problem
• A tailored two-phase constructive heuristic for the three-dimensional multiple bin size bin packing problem with transportation constraints
• A branch-and-cut algorithm for the pallet loading problem
• Fast algorithms for bin packing
• Bin packing with fixed number of bins revisited
• Capacitated Arc Stabbing
• Solving the pallet loading problem
• Completeness in approximation classes beyond APX
• The pallet loading problem: a review of solution methods and computational experiments
• An asymptotic approximation algorithm for 3D-strip packing
• The Complexity of Satisfiability of Small Depth Circuits
• Complexity Results for Multiprocessor Scheduling under Resource Constraints
• An Application of Bin-Packing to Multiprocessor Scheduling
• Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs
• Fibonacci heaps and their uses in improved network optimization algorithms
• On the generalized bin packing problem
• Parameterized Algorithms
• The Loading Problem
• Matching Is as Easy as the Decision Problem, in the NC Model

This page was built for publication: Priority-based bin packing with subset constraints