AI Paper Atlas

Research map / Learning theory and algorithms / Prediction and decision losses

A Recursive Scenario Decomposition Algorithm for Combinatorial Multistage Stochastic Optimisation Problems

David Hemmi, Guido Tack, Mark Wallace

AAAI 2018 · Learning theory and algorithms › Prediction and decision losses · approach: Determinantal point process inference · 5 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
solve with recursive E&C instead of CPLEX on the deterministic equivalentRecursive E&C · Basic facility location, 343 scenariosinstances finishing within 1800 s: 11 out of 15Improved
solve with recursive E&C instead of CPLEX on the deterministic equivalentRecursive E&C · Facility location with balancing constraintinstances solved optimally within timeout: 13 out of 150 -> 150Improved
add balancing constraint to the problemCPLEX on deterministic equivalent · Facility locationsolvabilityHurt
relax CPLEX relative optimality gap for scenario COPs from 10^-4 to 10^-3 (ablation)Recursive E&C · Facility location with balancing constraintscenario COP solve timeImproved
increase number of scenariosRecursive E&C · Basic facility locationrun 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