3 papers
math.OC2023
Building Formulations for Piecewise Linear Relaxations of Nonlinear Functions
Bochuan Lyu, Illya V. Hicks, Joey Huchette
We study mixed-integer programming formulations for the piecewise linear lower and upper bounds (in other words, piecewise linear relaxations) of nonlinear functions that can be mo…
math.CO2023
Maximal Clique and Edge-Ranking Bounds of Biclique Cover Number
Bochuan Lyu, Illya V. Hicks
The biclique cover number of a graph denotes the minimum number of complete bipartite (biclique) subgraphs to cover all the edges of the graph. In this paper, we…
cs.DM2015
Chromatic and flow polynomials of generalized vertex join graphs and outerplanar graphs
Boris Brimkov, Illya V. Hicks
A generalized vertex join of a graph is obtained by joining an arbitrary multiset of its vertices to a new vertex. We present a low-order polynomial time algorithm for finding the…