AI Paper Atlas

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

ICLR 2024 · Learning theory and algorithms › Combinatorial and search optimization · approach: Unsupervised neural combinatorial optimization

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

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy