4 citations · 8 across the 23 of their papers we have counts for
4 papers · 1 filter
Sequence-Structured Decision Learning for Branch-and-Bound in Mixed-Integer Linear Programming
Tengfei Liu, Jinrun Liu, Bai Yan +2
Branch-and-bound (BnB) solves mixed-integer linear programs by constructing and exploring a search tree. Node selection and branching are two recurrent decisions that directly dete…
Block Designs with Large Transversal-Block Intersections
Jiaxi Nie
A block design is a set family, whose members are called blocks, where every pair of points in the universe is covered by exactly one block. Erdős asked the following question: is…
Matching and intersection problems for non-trivial -partite -uniform hypergraphs
Peter Frankl, Jiaxi Nie
A central theme in extremal combinatorics is the study of the maximum number of edges in an -uniform hypergraph (-graph) with matching number at most (the Erdős Matching…
Hypergraph Ramsey numbers with quasipolynomial growth rate
Xiaoyu He, Jiaxi Nie, Logan Post +1
For a 3-uniform hypergraph (3-graph) , let be the smallest such that any -vertex -free 3-graph has an independent set of size . We construct a -graph $H…