For a graph (<i>V, E</i>), existing compact linear formulations for the minimum cut problem require Θ(|<i>V</i>||<i>E</i>|) variables and constraints and can be interpreted as a composition of |<i>V</i>|--1 polyhedra for minimum <i>s-t</i> cuts in much the same way as early approaches to finding globally minimum cuts relied on |<i>V</i>|--1 calls to a… (More)
We give an upper bound on the independence number of the cube of the odd cycle C 8n+5. The best known lower bound is conjectured to be the truth; we prove the conjecture in the case 8n + 5 prime and, within 2, for general n.
We give a complete classification of all maximum independent sets in powers of odd cycles of the form C d k2 d +1 .
Keywords: Data-based modeling Elastic net Lasso Monte Carlo methods Biopharmaceutical manufacturing Regularization methods a b s t r a c t Biopharmaceutical manufacturing involves multiple process steps that can be challenging to model. Oftentimes, operating conditions are studied in bench-scale experiments and then fixed to specific values during… (More)
Acknowledgments There are many people that must be thanked for helping me get to where I am today. I am the most grateful to my adviser Steve Shreve, for the numerous hours of discussions, answers and encouragement. He has taught me more about mathematics and how to think like a mathematician, than anyone else. My thesis committee: Dmitry Kramkov, Kasper… (More)