AI Paper Atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

Solving the Station Repacking Problem

AAAI 2016 · Learning theory and algorithms › Combinatorial and search optimization · approach: Unsupervised neural combinatorial optimization · 18 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
add containment cache to the portfolio (ablation)SATFC 2.0 · UHF test set, 60s% instances solved: 98% -> 99.6%Helped
start local search from previous feasible assignment (DCCA+) (ablation)DCCA · UHF test set% instances solved: 85.4% (vs. lower for random-init DCCA)Helped
add clasp-h1 to DCCA-preSAT/DCCA+ portfolio via Hydra (ablation)portfolio · UHF test set% previously unsolved instances solved: +2.8%Helped
add clasp-h2 as fourth portfolio solver (ablation)portfolio · UHF test set% previously unsolved instances solved: +0.9%Helped
add graph decomposition (smaller largest component) (ablation)SAT repacking · UHF instanceslargest component size (stations, median): 629 -> 458Helped
run clasp in parallel with DCCA (Hydra round) (ablation)DCCA · validation set% instances solved: +4%Helped
SAT encoding instead of MIP encodingstation repacking · UHF test set, 60s% instances solvedHelped

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