3 papers
math.OC2026
Quadratic Degree Sequence Optimization and the Critical Roots of a Graph
Frédéric Meunier, Shmuel Onn
The degree sequence optimization problem is to find a subgraph of a given graph which maximizes the sum over all vertices of a given function evaluated at the subgraph degree of th…
math.OC2024
Circuit and Graver Walks and Linear and Integer Programming
Shmuel Onn
We show that a circuit walk from a given feasible point of a given linear program to an optimal point can be computed in polynomial time using only linear algebra operations and th…
math.CO2024
Degree Sequence Optimization and Extremal Degree Enumerators
Shmuel Onn
The degree sequence optimization problem is to find a subgraph of a given graph which maximizes the sum of given functions evaluated at the subgraph degrees. Here we study this pro…