Showing 2026Show all
2 papers · 1 filter
cs.DM2026
Upper Bounds for CSP Non-redundancy via Locally Decodable Codes
Joshua Brakensiek, David Conlon, Venkatesan Guruswami +4
In the study of constraint satisfaction problems (CSPs), the non-redundancy of a relation measures the maximum number of clauses in a CSP instance which can be logically independen…
cs.LG2026
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…