https://optimizationdigest.com Industry successes, podcasts, applications, and research in mathematical optimization. en-us https://optimizationdigest.com/article/a-benchmark-finally-tells-us-which-drone-routing-strategy-actually-catches-wildfires-faster https://optimizationdigest.com/article/a-benchmark-finally-tells-us-which-drone-routing-strategy-actually-catches-wildfires-faster Wed, 16 Sep 2026 00:03:16 GMT A new open-source library, WFDroneBench, pits routing algorithms and risk maps against thousands of simulated fires — and finds that smarter routing only pays off when the underlying risk data is good enough to trust. Research Paper Digests https://optimizationdigest.com/article/before-the-solver-runs-someone-should-ask-a-question https://optimizationdigest.com/article/before-the-solver-runs-someone-should-ask-a-question Wed, 16 Sep 2026 00:03:16 GMT A new benchmark shows that LLMs asked to turn plain-English business problems into optimization models usually guess at missing details instead of asking — and a new framework called InterOPT tries to fix that. Research Paper Digests https://optimizationdigest.com/article/how-fair-can-a-group-split-ever-really-be-a-tight-answer-at-last https://optimizationdigest.com/article/how-fair-can-a-group-split-ever-really-be-a-tight-answer-at-last Wed, 16 Sep 2026 00:03:16 GMT A new result pins down, almost exactly, how badly an individual can be shortchanged when indivisible goods are divided fairly among groups rather than individuals — and gets there with a new trick for one-sided discrepancy. Applications, News & Interviews https://optimizationdigest.com/article/netflix-swaps-thousands-of-features-for-a-language-model-and-its-ranker-gets-better https://optimizationdigest.com/article/netflix-swaps-thousands-of-features-for-a-language-model-and-its-ranker-gets-better Wed, 16 Sep 2026 00:03:16 GMT GenRec, Netflix's new LLM-backed recommendation ranker, beat a mature production system while training on a fraction of the labeled data — by trading feature engineering for context engineering. Applications, News & Interviews https://optimizationdigest.com/article/teaching-a-neural-network-to-referee-gpu-workloads-in-growing-cell-simulations https://optimizationdigest.com/article/teaching-a-neural-network-to-referee-gpu-workloads-in-growing-cell-simulations Wed, 16 Sep 2026 00:03:16 GMT A recurrent neural network that learns from simulated history, not real traces, keeps multi-GPU tissue-growth simulations balanced without the constant repartitioning that slows them down. Applications, News & Interviews https://optimizationdigest.com/article/fixing-a-blind-spot-in-the-analytic-hierarchy-process-how-regularization-tames-unstable-priority-rankings https://optimizationdigest.com/article/fixing-a-blind-spot-in-the-analytic-hierarchy-process-how-regularization-tames-unstable-priority-rankings Wed, 16 Sep 2026 00:03:16 GMT A new optimization model, ARDLS, patches a long-standing flaw in one of the most widely used decision-making frameworks — where the "best" priority ranking could depend on nothing more than a solver's starting guess. Applications, News & Interviews https://optimizationdigest.com/article/when-the-downside-is-capped-rethinking-portfolio-rules-under-a-cvar-limit https://optimizationdigest.com/article/when-the-downside-is-capped-rethinking-portfolio-rules-under-a-cvar-limit Wed, 16 Sep 2026 00:03:16 GMT A new continuous-time analysis shows that capping expected losses in the tail doesn't just make investors more cautious across the board — it makes them cautious in an asymmetric, state-dependent way, and it comes with a provably convergent algorithm to compute the optimal policy. Applications, News & Interviews https://optimizationdigest.com/article/when-solar-panels-act-up-a-minimax-defense-for-grid-voltage https://optimizationdigest.com/article/when-solar-panels-act-up-a-minimax-defense-for-grid-voltage Wed, 16 Sep 2026 00:03:16 GMT A new robust optimization approach lets grid operators pre-set reactive power rules that hold voltage steady even when rooftop solar and other DERs behave unpredictably — or get hacked. Research Paper Digests https://optimizationdigest.com/article/taming-the-tilt-how-optimal-control-is-helping-evtol-pilots-fly-like-airline-captains https://optimizationdigest.com/article/taming-the-tilt-how-optimal-control-is-helping-evtol-pilots-fly-like-airline-captains Wed, 16 Sep 2026 00:03:16 GMT A new pilot control concept for tilt-wing electric aircraft uses optimal-control theory not to fly the plane, but to prove that making it easier to fly doesn't cost time or performance. Research Paper Digests https://optimizationdigest.com/article/when-two-goals-cant-both-come-first-lexicographic-scheduling-for-shared-lab-space https://optimizationdigest.com/article/when-two-goals-cant-both-come-first-lexicographic-scheduling-for-shared-lab-space Wed, 16 Sep 2026 00:03:16 GMT A worked MILP example shows how to book scarce laboratory rooms without splitting scarce staff across departments — by solving one objective completely before letting a second one even matter. Applications, News & Interviews https://optimizationdigest.com/article/steering-a-cloud-of-heat-robust-optimal-control-meets-semi-infinite-programming https://optimizationdigest.com/article/steering-a-cloud-of-heat-robust-optimal-control-meets-semi-infinite-programming Wed, 16 Sep 2026 00:03:16 GMT A new numerical framework treats "move this density to that density, under the worst disturbance" as a convex optimization problem you can actually solve — with guarantees. Research Paper Digests https://optimizationdigest.com/article/teaching-a-neural-network-to-think-like-a-solver-optimization-proxies-for-order-fulfillment https://optimizationdigest.com/article/teaching-a-neural-network-to-think-like-a-solver-optimization-proxies-for-order-fulfillment Wed, 16 Sep 2026 00:03:16 GMT A new research effort trains fast machine learning models to mimic sequential stochastic optimization decisions in order fulfillment — trading a sliver of solution quality for orders-of-magnitude speedups. Research Paper Digests https://optimizationdigest.com/article/finding-the-right-cuts-a-polyhedral-map-for-image-segmentation-optimization https://optimizationdigest.com/article/finding-the-right-cuts-a-polyhedral-map-for-image-segmentation-optimization Wed, 16 Sep 2026 00:03:16 GMT A new theoretical study pins down which inequalities actually define the optimal shape of the multi-separator problem — a model recently proposed as a sharper alternative for segmenting images into regions. Research Paper Digests https://optimizationdigest.com/article/how-many-moves-does-it-take-to-reshuffle-two-tokens-a-tight-linear-bound https://optimizationdigest.com/article/how-many-moves-does-it-take-to-reshuffle-two-tokens-a-tight-linear-bound Wed, 16 Sep 2026 00:03:16 GMT A new proof shows that repositioning two non-attacking tokens on a graph, one step at a time, never needs more than four moves per vertex — resolving a question left open since 2021. Research Paper Digests https://optimizationdigest.com/article/how-semidefinite-programming-is-cooling-down-fluid-dynamics-bounds https://optimizationdigest.com/article/how-semidefinite-programming-is-cooling-down-fluid-dynamics-bounds Wed, 16 Sep 2026 00:03:16 GMT A new paper turns a hard fluid-cooling design question into a convex optimization problem, using duality and SDP hierarchies to prove that no cooling strategy can beat a precise mathematical ceiling. Research Paper Digests https://optimizationdigest.com/article/the-shortcut-between-safe-and-paranoid-a-shrinkage-path-for-robust-optimization https://optimizationdigest.com/article/the-shortcut-between-safe-and-paranoid-a-shrinkage-path-for-robust-optimization Wed, 16 Sep 2026 00:03:16 GMT A new heuristic turns the expensive search for a distributionally robust decision into a one-dimensional line search — capturing most of the benefit of Wasserstein DRO at a fraction of the computational cost. Research Paper Digests https://optimizationdigest.com/article/a-polynomial-algorithm-for-mixed-domination-on-threshold-graphs https://optimizationdigest.com/article/a-polynomial-algorithm-for-mixed-domination-on-threshold-graphs Wed, 16 Sep 2026 00:03:16 GMT Mixed dominating set problems are NP-hard in general, but new work shows threshold graphs give up their secrets in polynomial time — down to $O(n^5)$. Research Paper Digests https://optimizationdigest.com/article/three-ways-to-define-risk-when-building-a-portfolio-and-how-optimization-picks-the-best-mix https://optimizationdigest.com/article/three-ways-to-define-risk-when-building-a-portfolio-and-how-optimization-picks-the-best-mix Wed, 16 Sep 2026 00:03:16 GMT A hands-on AMPL notebook shows how the same optimization engine can build very different "safe" portfolios depending on how you define risk. Applications, News & Interviews