4 papers
Combinatorial Perpetual Scheduling: Existence and Computation of Low-Height Schedules
Mirabel Mendoza-Cadena, Arturo Merino, Mads Anker Nielsen +1
This paper considers a framework for combinatorial variants of perpetual-scheduling problems. Given an independence system , a schedule consists of an independent…
On Mixed Cages of Girth 6
Gabriela Araujo-Pardo, Mirabel Mendoza-Cadena
A [z,r;g]-mixed cage is a mixed graph of minimum order such that each vertex has z in-arcs, z out-arcs, r edges, and it has girth g. We present an infinite family of mixed graphs w…
Subset-Constrained Inverse Matroid Optimization
Kristóf Bérczi, Lydia Mirabel Mendoza-Cadena, Mirabel Mendoza-Cadena +1
In inverse optimization, the goal is to find a minimum perturbation of weights that makes a prescribed feasible solution optimal. For matroids, the classical inverse problem fixes…
New upper bounds on the order of mixed cages of girth 6
Gabriela Araujo-Pardo, Lydia Mirabel Mendoza-Cadena
A -mixed cage is a mixed graph of minimum order such that each vertex has in-arcs, out-arcs, edges, and it has girth , and the minimum order for -m…