4 papers
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…
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…
Modeling Combinatorial Disjunctive Constraints via Junction Trees
Bochuan Lyu, Illya V. Hicks, Joey Huchette
We introduce techniques to build small ideal mixed-integer programming (MIP) formulations of combinatorial disjunctive constraints (CDCs) via the independent branching scheme. We p…
Finding Biclique Partitions of Co-Chordal Graphs
Bochuan Lyu, Illya V. Hicks
The biclique partition number of a graph is referred to as the least number of complete bipartite (biclique) subgraphs that are required to cover the edges of the…