Showing math.OCShow all
3 papers · 1 filter
math.OC2026
The Price of Feasibility: Greedy Approximation Bounds for String Supermodular Optimization over Oracle-Conditioned Greedoids
Joan Vendrell Gallart, Russell Bent, Solmaz Kia
Greedy algorithms efficiently approximate combinatorial optimization problems, but their guarantees weaken when feasibility couples combinatorial structure with global physical con…
math.OC2026
Submodular Welfare under Routing Coupling: A Hierarchical Decomposition with Perturbation Guarantees
Joan Vendrell Gallart, Nhat-Minh Tang-Nguyen, Alan Kuhnle +1
This paper studies joint submodular welfare maximization and routing over graphs, where agents select items under diminishing returns and transport them through a network with cong…
math.OC2025
FORWARD: A Feasible Radial Reconfiguration Algorithm for Multi-Source Distribution Networks
Joan Vendrell Gallart, Russell Bent, Solmaz Kia
This paper considers an optimal radial reconfiguration problem in multi-source distribution networks, where the goal is to find a radial configuration that minimizes quadratic dist…