Feasibility criteria for high-multiplicity partitioning problems

DOI10.1016/j.jpaa.2021.106937zbMath1483.90143arXiv1909.02155OpenAlexW3217091519MaRDI QIDQ2069802

Claudiu Raicu

Publication date: 21 January 2022

Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1909.02155

zbMATH Keywords

partitioning problembin packingfeasibility criteria

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Extremal combinatorics (05D99)

Uses Software

• Macaulay2

Cites Work

• Unnamed Item
• Unnamed Item
• Bin packing can be solved within 1+epsilon in linear time
• The \(k\)-partitioning problem
• Regularity of \(\mathfrak{S}_n\)-invariant monomial ideals
• An asymptotically exact algorithm for the high-multiplicity bin packing problem
• Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem
• Polynomiality for Bin Packing with a Constant Number of Item Types
• Combinatorial optimization. Theory and algorithms