Showing math.OCShow all
3 papers · 1 filter
math.OC2026
Sharp Logarithmic Thresholds for Cut Schedules in an Abstract Branch-and-Cut Model
Hongyi Jiang
Branch-and-cut interleaves branching with cutting-plane generation. How the two operations share the work of proving a bound is a basic theoretical question. We study an abstract m…
math.OC2024
Approximation Algorithm for Generalized Budgeted Assignment Problems and Applications in Transportation Systems
Hongyi Jiang, Samitha Samaranayake
Motivated by a transit line planning problem in transportation systems, we investigate the following capacitated assignment problem under a budget constraint. Our model involves $L…
math.OC2024
A Universal Transfer Theorem for Convex Optimization Algorithms Using Inexact First-order Oracles
Phillip Kerger, Marco Molinaro, Hongyi Jiang +1
Given any algorithm for convex optimization that uses exact first-order information (i.e., function values and subgradients), we show how to use such an algorithm to solve the prob…