Research map / Learning theory and algorithms / Combinatorial and search optimization
Learning to solve Class-Constrained Bin Packing Problems via Encoder-Decoder Model
Hanni Cheng, Ya Cong, Weihao Jiang, Shiliang Pu
Read the paperCheck your idea against 137,217 papers
AI-extracted summary. Written by AI from the paper's abstract only. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Introduces the Class-Constrained Bin Packing Problem (CCBPP), a vector bin packing variant with item classes and sizes, and proposes an encoder-decoder neural model to solve it.
Problem
Neural CO methods for bin packing focus on geometric variants such as 3D BPP, neglecting complex vector bin packing; the paper targets vector BPP with class constraints.
Approach
Defines a vector BPP variant (CCBPP) where items have both classes and sizes, and solves it with a learned encoder-decoder model rather than hand-crafted heuristics.
Closest papers by meaning
- Neural Solver Selection for Combinatorial Optimization (ICML 2025 · similarity 0.84)
- Geometric Algorithms for Neural Combinatorial Optimization with Constraints (NeurIPS 2025 · similarity 0.84)
- BIPNN: Learning to Solve Binary Integer Programming via Hypergraph Neural Networks (NeurIPS 2025 · similarity 0.84)
- UDC: A Unified Neural Divide-and-Conquer Framework for Large-Scale Combinatorial Optimization Problems (NeurIPS 2024 · similarity 0.83)
- CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention (ICML 2025 · similarity 0.83)
- Improving Generalization of Neural Combinatorial Optimization for Vehicle Routing Problems via Test-Time Projection Learning (NeurIPS 2025 · similarity 0.83)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
