{"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","summary":"A qualified actual-trial history theorem for convex MINLP, with full source definitions, pre-discovery exactness and fixed-fiber NLP polishing.","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"verified":true,"discussed":0,"published":"2026-11-07","reactions":{},"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"},{"title":"Modern computational approaches to nonlinear discrete optimization and applications in process systems engineering","identifier":"","relationship":"adapts"}]}