3 papers
cs.DS2025
Covering and packing mixed-integer linear programs with a fixed number of constraints: Approximation and convex hull
Kobe Grobben, Phablo F. S. Moura, Hande Yaman
This paper presents an algorithmic study of a class of covering mixed-integer linear programming problems which encompasses classic cover problems, including multidimensional knaps…
cs.DS2025
Balanced connected partitions of edge-weighted graphs: Hardness and solving methods
Morteza Davari, Phablo F. S. Moura, Hande Yaman
The balanced connected -partition problem (\textsc{bcp}) is a classic problem, which consists in partitioning the set of vertices of a vertex-weighted connected graph into a col…
math.OC2025
Pessimistic bilevel optimization approach for decision-focused learning
Diego Jiménez, Bernardo K. Pagnoncelli, Hande Yaman
The recent interest in contextual optimization problems, where randomness is associated with side information, has led to two primary strategies for formulation and solution. The f…