Research Paper Digests

A Benchmark Finally Tells Us Which Drone Routing Strategy Actually Catches Wildfires Faster

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.

Editorial illustration in a minimalist flat-design style: a business planner sits at a desk sketching a supply chain diagram on paper (boxes connected by arrows representing routes, warehouses, and a factory), while a friendly robotic assistant sits across the table with a raised hand gesture as if politely asking a question, a small empty speech bubble with a question mark floating above it.

Before the Solver Runs, Someone Should Ask a Question

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.

Editorial hero illustration of a suburban street at dusk seen from a slightly elevated angle, rooftops covered with solar panels glowing faintly under a partly clouded sky, with visible power lines and a utility transformer box in the foreground.

Research Paper Digests

When Solar Panels Act Up: A Minimax Defense for Grid Voltage

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.

Clean editorial infographic explaining a unified pilot control system for tilt-wing eVTOL aircraft.

Research Paper Digests

Taming the Tilt: How Optimal Control Is Helping eVTOL Pilots Fly Like Airline Captains

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.

Clean editorial hero infographic on a dark navy background explaining robust density transport as convex optimization.

Research Paper Digests

Steering a Cloud of Heat: Robust Optimal Control Meets Semi-Infinite Programming

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.

Clean editorial infographic explaining how an "optimization proxy" speeds up order fulfillment decisions.

Research Paper Digests

Teaching a Neural Network to Think Like a Solver: Optimization Proxies for Order Fulfillment

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.

Editorial illustration in a minimalist geometric style: an image of a simple outdoor scene (a few overlapping circular shapes representing objects like a tree, a person, and a car silhouette) rendered as a node-and-edge graph overlay, with small dots (vertices) placed at region boundaries and a highlighted subset of dots forming a thin dividing curve that separates the shapes into distinct colored regions.

Research Paper Digests

Finding the Right Cuts: A Polyhedral Map for Image-Segmentation Optimization

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.

An editorial infographic explaining a graph token-reconfiguration proof.

Research Paper Digests

How Many Moves Does It Take to Reshuffle Two Tokens? A Tight Linear Bound

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.

An editorial infographic in a clean scientific style, restrained blue-and-orange color palette, explaining how optimization bounds cooling efficiency in fluid flow.

Research Paper Digests

How Semidefinite Programming Is Cooling Down Fluid Dynamics Bounds

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.

Editorial illustration of a warehouse inventory planner standing between two paths that converge into one.

Research Paper Digests

The Shortcut Between Safe and Paranoid: A Shrinkage Path for Robust Optimization

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.

A minimalist editorial illustration of a layered network diagram: a pyramid-like hierarchy of circular nodes connected by clean lines.

Research Paper Digests

A Polynomial Algorithm for Mixed Domination on Threshold Graphs

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)$.