Id: palomar/PALOMAR-2026-11-07-000008 Url: https://github.com/bernalde/center-cut-discovery/tree/9e758271673df45b9ea7c6205d2c36d45e6f1e5e Json: https://data.palomar-registry.org/entries/PALOMAR-2026-11-07-000008-v1.json Repo: https://github.com/bernalde/center-cut-discovery Tags: math.OC, msc:90C11, msc:90C25, msc:90C30 Score: 0 Title: Finite optimal-polish discovery for center-cut histories Trust: high Domain: math.OC Source: palomar Authors: David E. Bernal Neira Reviews: 0 Subject: math.OC Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Verified: true Discussed: 0 Published: 2026-11-07 Formalized: true Formalizes: title=A center-cut algorithm for quickly obtaining feasible solutions and solving convex MINLP problems identifier=doi:10.1016/j.compchemeng.2018.06.019 relationship=adapts Formalizes: title=Modern computational approaches to nonlinear discrete optimization and applications in process systems engineering identifier= relationship=adapts Page: https://delphi.science/r/palomar/PALOMAR-2026-11-07-000008 A qualified actual-trial history theorem for convex MINLP, with full source definitions, pre-discovery exactness and fixed-fiber NLP polishing.