# Projects

Work by Renan Butkeraites. Projects marked *demo* have an interactive version that runs in your browser.

## Interactive demos

- [SIROM](https://butkeraites.com/projects/sirom/) — A sampling-based method that hands you a Pareto frontier of robust solutions and lets you choose the trade-off after seeing the options, instead of committing to an uncertainty budget before you know what it costs.
- [Hardness](https://butkeraites.com/projects/hardness/) — A continuous, normalized robustness measure for optimization under interval uncertainty — one number in [0,1] that ranks feasible solutions by how well they resist the uncertainty around them, with an exact closed form and a Monte-Carlo estimator that agree.
- [Anatomy of a Failed Anneal](https://butkeraites.com/projects/failed-anneal/) — A public repository of mine contains 201 committed simulated-annealing runs, every one of them infeasible. This takes the failure apart, isolates its three causes, and reaches a few percent of the proven optimum in milliseconds.
- [Separation-Constrained Layout](https://butkeraites.com/projects/separation-layout/) — Fit the most people into a room subject to a minimum-separation rule — maximum independent set on a conflict graph, solved to proven optimality in the browser, on a floor plan you can rearrange.

## Case studies

- [The N=32 Wall](https://butkeraites.com/projects/costas-arrays/) — A verified database of Costas arrays for orders 2–100, algebraic generators built over finite fields, and CP/SAT/LP experiments against the smallest orders where nobody has ever found one — or proved none exists.