AI Paper Atlas

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

Explaining Propagators for String Edit Distance Constraints

Felix Winter, Nysret Musliu, Peter Stuckey

AAAI 2020 · Learning theory and algorithms › Combinatorial and search optimization · approach: Decision-focused optimization · 3 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (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
replace edit distance decomposition with global propagatorCP model · Paint shop I3runtime to prove optimality (s): 3.76 -> 1.75Improved
replace edit distance decomposition with global propagatorCP model · Paint shop I4runtime to prove optimality (s): 178.46 -> 25.05Improved
replace edit distance decomposition with global propagatorCP model · Paint shop I8runtime to prove optimality (s): 2915.83 -> 445.43Improved
replace decomposition with global propagatorCP model · Paint shop I7, I9, I10best objective within 1 h: 1046 -> 1040Improved
remove lazy clause learning, with global propagator vs decomposition (ablation)CP model · Paint shop I1best objective within 1 h: 3282 -> 775*Improved
remove lazy clause learning, with global propagator vs decomposition (ablation)CP model · Paint shop I4best objective within 1 h: — -> 918*Improved
replace decomposition with global propagatorCP model · Median stringaverage runtime (s): 219.12 -> 61.61Improved
replace decomposition with global propagatorCP model · Median string# optimal solutions found: 180 -> 227Improved
global propagator CP versus MIP formulationCP+global · Median stringaverage runtime (s): 143.16 -> 61.61Improved
global propagator CP versus MIP formulationCP+global · Median string# best found solutions: 213 -> 246Improved
CP with decomposition versus MIP formulationCP decomposition · Median string# optimal solutions found: 208 -> 180Hurt
CP with decomposition versus MIP formulationCP decomposition · Median stringproof timeNo clear effect

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