Showing cs.DSShow all
2 papers · 1 filter
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…