5 papers
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…
On the connected (sub)partition polytope
Phablo F. S. Moura, Hande Yaman, Roel Leus
Let be a positive integer and let be a graph with vertices. A connected -subpartition of is a collection of pairwise disjoint sets (a.k.a. classes) of vertic…
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…
Compact formulations and valid inequalities for parallel machine scheduling with conflicts
Phablo F. S. Moura, Roel Leus, Hande Yaman
The problem of scheduling conflicting jobs on parallel machines consists in assigning a set of jobs to a set of machines so that no two conflicting jobs are allocated to the same m…
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…