{"id":"palomar/PALOMAR-2026-11-09-000016","url":"https://github.com/bernalde/appa-finite-exact-cut-procedure/tree/dfc588cb8156acd17896eef17d5d010d2e247091","json":"https://data.palomar-registry.org/entries/PALOMAR-2026-11-09-000016-v1.json","repo":"https://github.com/bernalde/appa-finite-exact-cut-procedure","tags":["math.OC","msc:05C83","msc:90C10"],"score":0,"title":"Complete finite connectivity checker and exact cut procedure","trust":"high","domain":"math.OC","source":"palomar","authors":["David E. Bernal Neira"],"reviews":0,"subject":"math.OC","summary":"Actual finite assignment pool, exact-minimum choice, complete connectivity checker, genuine disconnected-fiber boundary cuts, strict progress and history preservation yield terminal optimum or cap-relative infeasibility; cap n covers every finite fiber. All existing owning control propositions are complete compared SUPPORT components.","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"verified":true,"discussed":0,"published":"2026-11-09","reactions":{},"formalized":true,"formalizes":[{"title":"Modern computational approaches to nonlinear discrete optimization and applications in process systems engineering","identifier":"","relationship":"adapts"},{"title":"Integer Programming Techniques for Minor-Embedding in Quantum Annealers","identifier":"doi:10.1007/978-3-030-58942-4_8","relationship":"adapts"}]}