AI Paper Atlas

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

A Novel Integer Linear Programming Approach for Global L0 Minimization

Diego Delle Donne, Matthieu Kowalski, Leo Liberti

JMLR 2023 · Learning theory and algorithms › Combinatorial and search optimization · approach: Heuristics for integer programming · 1 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
add forbidden-support cuts and rounding heuristic (BC0/p) to the big-M MIP (ablation)MIP0/2 · Deconvolution P0/2average time on commonly solved instances: 360 seconds against 104Improved
add forbidden-support cuts and rounding heuristic (BC0/p) to the big-M MIP (ablation)MIP0/2 · Deconvolution P0/2 (404 instances)instances solved to optimality: 250 -> 319Improved
replace big-M MIP with M-independent covering ILP (IPcov)MIP0/2 · Deconvolution P0/2 (404 instances)instances solved to optimality: 250 -> 379Improved
replace big-M MIP with M-independent covering ILP (IPcov)MIP0/2 · Deconvolution P0/2average time on commonly solved instances: 360 -> 12 secondsImproved
add forbidden-support cuts (BC0/p) to the big-M MIP (ablation)MIP0/2 · Underdetermined deconvolution P0/2average time on commonly solved instances: 150 -> 233 sec.Hurt
replace big-M MIP with covering ILP (IPcov)MIP0/2 · Underdetermined deconvolution P0/2average time on commonly solved instances: 150 -> 49 sec.Improved
add forbidden-support cuts (BC0/p) to the big-M MIP (ablation)MIP0/inf · Deconvolution P0/inf Dantzig selectoraverage time on commonly solved instances: 366 -> 290 sec.Improved
replace big-M MIP with covering ILP (IPcov)MIP0/inf · Deconvolution P0/inf Dantzig selectoraverage time on commonly solved instances: 290 -> 954 sec.Hurt
replace big-M MIP with covering ILP (IPcov)MIP0/inf · Deconvolution P0/inf Dantzig selectoraverage support size on unsolved instances: 9.04 -> 13.57Hurt
replace big-M MIP with covering ILP (IPcov)MIP0/2 · Pathological adversarial instances 20x40, K=8average support size: 20.5 -> 8.7Improved
replace big-M MIP with covering ILP (IPcov)MIP0/2 · Pathological adversarial instances P0/2instances with best solution: 34 -> 82 out of 90Improved
add forbidden-support cuts (BC0/p) to the big-M MIP (ablation)MIP0/2 · Pathological adversarial instances P0/2instances with strictly better solution: 1 -> 0No 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