AI Paper Atlas

Research map / Bandits and online learning / Online convex optimization and games

Modelling and Solving Online Optimisation Problems

Alexander Ek, Maria Garcia de la Banda, Andreas Schutt, Peter J. Stuckey, Guido Tack

AAAI 2020 · Bandits and online learning › Online convex optimization and games · approach: Online decision-making with feedback structure · 4 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 garbage collection (ablation)online MiniZinc job-shop · abz5, 300 iterationsaccumulated instantiation time (s): 3,913.48 -> 19.00Improved
add garbage collection (ablation)online MiniZinc job-shop · abz5, 300 iterationsaccumulated solving time (s): 75.64 -> 13.01Improved
add garbage collection (ablation)online MiniZinc job-shop · ft10, 300 iterationsaccumulated instantiation time (s): 3,882.49 -> 19.86Improved
add garbage collection (ablation)online MiniZinc job-shop · ft20, 300 iterationsaccumulated solving time (s): 1,490.86 -> 1,467.56No clear effect
add garbage collection (ablation)online MiniZinc job-shop · ft20, 300 iterationsaccumulated instantiation time (s): 941.64 -> 18.84Improved
shorten per-iteration time limit from 1.00 s to 0.50 sreal-time online job-shop · ft20, 4 jobs/smakespan: 117,973 -> 117,845Improved
shorten per-iteration time limit to 0.25 sreal-time online job-shop · ft20, 4 jobs/smakespanHurt
increase per-iteration time limit from 1.00 s to 4.00 sreal-time online job-shop · ft20, 8 jobs/smakespan: 70,663 -> 67,892Improved
increase per-iteration time limit from 4.00 s to 16.00 sreal-time online job-shop · ft20, 8 jobs/smakespan: 67,892 -> 71,687Hurt
increase per-iteration time limit from 0.50 s to 16.00 sreal-time online job-shop · ft20, 4 jobs/smakespan: 117,845 -> 121,352Hurt
use sliding-window decomposition instead of solving offlinecargo assembly planning · CAPP 07total delay: 10,563 -> 5,868Improved
use sliding-window decomposition instead of solving offlinecargo assembly planning · CAPP 19total delay: 141,119 -> 129,748Improved

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