{"id":"palomar/PALOMAR-2026-11-06-000016","url":"https://github.com/bernalde/finite-mkcs-penalties/tree/9a7a1a98809aeda6f5fcd67a262aa4a3f482ab6c","json":"https://data.palomar-registry.org/entries/PALOMAR-2026-11-06-000016-v1.json","repo":"https://github.com/bernalde/finite-mkcs-penalties","tags":["math.OC","math.CO","msc:90C27","msc:90C20"],"score":0,"title":"Finite nonlinear MkCS exact penalty thresholds","trust":"high","domain":"math.OC","source":"palomar","authors":["David E. Bernal Neira"],"reviews":0,"subject":"math.OC","summary":"An adapted finite nonlinear QUBO formalization for the maximum k-colorable vertex-subset problem: binary-domain attainment, ordered color-pair normalization, weak optimal-value equality with auxiliary repair, strict optimizer feasibility, the one-color exception and attained boundary ties.","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"verified":true,"discussed":0,"published":"2026-11-06","reactions":{},"formalized":true,"formalizes":[{"title":"Characterization of QUBO reformulations for the maximum k-colorable subgraph problem","identifier":"doi:10.1007/s11128-022-03421-z","relationship":"adapts"}]}