TY - JOUR A1 - Designolle, Sébastien A1 - Besançon, Mathieu A1 - Iommazzo, Gabriele A1 - Knebel, Sebastian A1 - Gelß, Patrick A1 - Pokutta, Sebastian T1 - Improved Local Models and New Bell Inequalities Via Frank-Wolfe Algorithms JF - Physical Review Research N2 - In Bell scenarios with two outcomes per party, we algorithmically consider the two sides of the membership problem for the local polytope: Constructing local models and deriving separating hyperplanes, that is, Bell inequalities. We take advantage of the recent developments in so-called Frank-Wolfe algorithms to significantly increase the convergence rate of existing methods. First, we study the threshold value for the nonlocality of two-qubit Werner states under projective measurements. Here, we improve on both the upper and lower bounds present in the literature. Importantly, our bounds are entirely analytical; moreover, they yield refined bounds on the value of the Grothendieck constant of order three: 1.4367⩽KG(3)⩽1.4546. Second, we demonstrate the efficiency of our approach in multipartite Bell scenarios, and present local models for all projective measurements with visibilities noticeably higher than the entanglement threshold. We make our entire code accessible as a julia library called BellPolytopes.jl. Y1 - 2023 U6 - https://doi.org/10.1103/PhysRevResearch.5.043059 VL - 5 SP - 043059 ER - TY - JOUR A1 - Kevin-Martin, Aigner A1 - Bärmann, Andreas A1 - Braun, Kristin A1 - Liers, Frauke A1 - Pokutta, Sebastian A1 - Schneider, Oskar A1 - Sharma, Kartikey A1 - Tschuppik, Sebastian T1 - Data-driven Distributionally Robust Optimization over Time JF - INFORMS Journal on Optimization N2 - Stochastic optimization (SO) is a classical approach for optimization under uncertainty that typically requires knowledge about the probability distribution of uncertain parameters. Because the latter is often unknown, distributionally robust optimization (DRO) provides a strong alternative that determines the best guaranteed solution over a set of distributions (ambiguity set). In this work, we present an approach for DRO over time that uses online learning and scenario observations arriving as a data stream to learn more about the uncertainty. Our robust solutions adapt over time and reduce the cost of protection with shrinking ambiguity. For various kinds of ambiguity sets, the robust solutions converge to the SO solution. Our algorithm achieves the optimization and learning goals without solving the DRO problem exactly at any step. We also provide a regret bound for the quality of the online strategy that converges at a rate of O(log T/T−−√), where T is the number of iterations. Furthermore, we illustrate the effectiveness of our procedure by numerical experiments on mixed-integer optimization instances from popular benchmark libraries and give practical examples stemming from telecommunications and routing. Our algorithm is able to solve the DRO over time problem significantly faster than standard reformulations. Y1 - 2023 U6 - https://doi.org/10.1287/ijoo.2023.0091 VL - 5 IS - 4 SP - 376 EP - 394 ER - TY - JOUR A1 - Gelß, Patrick A1 - Klus, Stefan A1 - Knebel, Sebastian A1 - Shakibaei, Zarin A1 - Pokutta, Sebastian T1 - Low-Rank Tensor Decompositions of Quantum Circuits JF - Journal of Computational Physics N2 - Quantum computing is arguably one of the most revolutionary and disruptive technologies of this century. Due to the ever-increasing number of potential applications as well as the continuing rise in complexity, the development, simulation, optimization, and physical realization of quantum circuits is of utmost importance for designing novel algorithms. We show how matrix product states (MPSs) and matrix product operators (MPOs) can be used to express certain quantum states, quantum gates, and entire quantum circuits as low-rank tensors. This enables the analysis and simulation of complex quantum circuits on classical computers and to gain insight into the underlying structure of the system. We present different examples to demonstrate the advantages of MPO formulations and show that they are more efficient than conventional techniques if the bond dimensions of the wave function representation can be kept small throughout the simulation. Y1 - 2022 ER - TY - JOUR A1 - Designolle, Sébastien A1 - Iommazzo, Gabriele A1 - Besançon, Mathieu A1 - Knebel, Sebastian A1 - Gelß, Patrick A1 - Pokutta, Sebastian T1 - Improved local models and new Bell inequalities via Frank-Wolfe algorithms JF - Physical Review Research N2 - In Bell scenarios with two outcomes per party, we algorithmically consider the two sides of the membership problem for the local polytope: Constructing local models and deriving separating hyperplanes, that is, Bell inequalities. We take advantage of the recent developments in so-called Frank-Wolfe algorithms to significantly increase the convergence rate of existing methods. First, we study the threshold value for the nonlocality of two-qubit Werner states under projective measurements. Here, we improve on both the upper and lower bounds present in the literature. Importantly, our bounds are entirely analytical; moreover, they yield refined bounds on the value of the Grothendieck constant of order three: 1.4367⩽KG(3)⩽1.4546. Second, we demonstrate the efficiency of our approach in multipartite Bell scenarios, and present local models for all projective measurements with visibilities noticeably higher than the entanglement threshold. We make our entire code accessible as a julia library called BellPolytopes.jl. Y1 - 2023 U6 - https://doi.org/10.1103/PhysRevResearch.5.043059 VL - 5 SP - 043059 ER - TY - JOUR A1 - Knueven, B. A1 - Ostrowski, J. A1 - Pokutta, Sebastian T1 - Detecting Almost Symmetries in Graphs JF - to appear in Mathematical Programming C Y1 - 2017 UR - http://www.optimization-online.org/DB_HTML/2015/09/5117.html N1 - URL of the PDF: http://link.springer.com/article/10.1007/s12532-017-0124-3 ER - TY - JOUR A1 - Braun, Gábor A1 - Brown-Cohen, Jonah A1 - Huq, Arefin A1 - Pokutta, Sebastian A1 - Raghavendra, Prasad A1 - Weitz, Benjamin A1 - Zink, Daniel T1 - The matching problem has no small symmetric SDP JF - Mathematical Programming A Y1 - 2017 N1 - Additional Note: DOI 10.1007/s10107-016-1098-z N1 - URL of the PDF: http://dx.doi.org/10.1007/s10107-016-1098-z VL - 165 IS - 2 SP - 643 EP - 662 ER - TY - JOUR A1 - Le Bodic, P. A1 - Pfetsch, Marc A1 - Pavelka, J. A1 - Pokutta, Sebastian T1 - Solving MIPs via Scaling-based Augmentation JF - Discrete Optimization Y1 - 2018 N1 - Additional Note: doi: 10.1016/j.disopt.2017.08.004 N1 - URL of the PDF: http://dx.doi.org/10.1016/j.disopt.2017.08.004 VL - 27 SP - 1 EP - 25 ER - TY - JOUR A1 - Braun, Gábor A1 - Roy, Aurko A1 - Pokutta, Sebastian T1 - Stronger Reductions for Extended Formulations JF - to appear in Mathematical Programming B Y1 - 2018 N1 - Additional Note: available at \url{http://arxiv.org/abs/1512.04932} ER - TY - JOUR A1 - Song, R. A1 - Xie, Y. A1 - Pokutta, Sebastian T1 - On the effect of model mismatch for sequential Info-Greedy Sensing JF - EURASIP Journal on Advances in Signal Processing Y1 - 2018 N1 - URL of the PDF: https://asp-eurasipjournals.springeropen.com/articles/10.1186/s13634-018-0551-y ER - TY - JOUR A1 - Braun, Gábor A1 - Pokutta, Sebastian A1 - Zink, Daniel T1 - Affine Reductions for LPs and SDPs JF - Mathematical Programming A Y1 - 2019 N1 - URL of the PDF: http://rdcu.be/EPf9 VL - 173 IS - 1 SP - 281 EP - 312 ER - TY - JOUR A1 - Braun, Gábor A1 - Pokutta, Sebastian A1 - Zink, Daniel T1 - Lazifying Conditional Gradient Algorithms JF - Journal of Machine Learning Research (JMLR) Y1 - 2019 N1 - URL of the PDF: http://jmlr.org/papers/v20/18-114.html N1 - URL of the Slides: https://app.box.com/s/zsp0hixjz2ha23u1vuyosijjkjdh8kj7 VL - 20 IS - 71 SP - 1 EP - 42 ER - TY - JOUR A1 - Braun, Gábor A1 - Pokutta, Sebastian T1 - Common information and unique disjointness JF - Algorithmica Y1 - 2016 UR - http://eccc.hpi-web.de/report/2013/056 N1 - URL of the PDF: https://rdcu.be/6b9u VL - 76 IS - 3 SP - 597 EP - 629 ER - TY - JOUR A1 - Gatzert, Nadine A1 - Pokutta, Sebastian A1 - Vogl, Nikolai T1 - Convergence of Capital and Insurance Markets: Pricing Aspects of Index-Linked Catastrophic Loss Instruments JF - to appear in Journal of Risk and Insurance Y1 - 2016 UR - http://papers.ssrn.com/sol3/papers.cfm?abstract_id=2320370 ER - TY - JOUR A1 - Bärmann, Andreas A1 - Heidt, Andreas A1 - Martin, Alex A1 - er, A1 - Pokutta, Sebastian A1 - Thurner, Christoph T1 - Polyhedral Approximation of Ellipsoidal Uncertainty Sets via Extended Formulations - a computational case study JF - Computational Management Science Y1 - 2016 UR - http://www.optimization-online.org/DB_HTML/2014/02/4245.html N1 - Additional Note: http://link.springer.com/article/10.1007/s10287-015-0243-0 DOI:10.1007/s10287-015-0243-0 N1 - URL of the PDF: http://link.springer.com/article/10.1007/s10287-015-0243-0 VL - 13 IS - 2 SP - 151 EP - 193 ER - TY - JOUR A1 - Roy, Aurko A1 - Pokutta, Sebastian T1 - Hierarchical Clustering via Spreading Metrics JF - Journal of Machine Learning Research (JMLR) Y1 - 2017 N1 - Additional Note: http://https://papers.nips.cc/paper/by-source-2016-1199 N1 - URL of the PDF: http://jmlr.org/papers/v18/17-081.html VL - 18 SP - 1 EP - 35 ER - TY - JOUR A1 - Bodur, Merve A1 - Del Pia, Alberto A1 - Dey, Santanu Sabush A1 - Molinaro, Marco A1 - Pokutta, Sebastian T1 - Aggregation-based cutting-planes for packing and covering Integer Programs JF - to appear in Mathematical Programming A Y1 - 2017 N1 - Additional Note: doi:10.1007/s10107-017-1192-x N1 - URL of the PDF: http://dx.doi.org/10.1007/s10107-017-1192-x ER - TY - JOUR A1 - Bazzi, Abbas A1 - Fiorini, Samuel A1 - Pokutta, Sebastian A1 - Svensson, Ola T1 - Small linear programs cannot approximate Vertex Cover within a factor of 2 - epsilon JF - to appear in Mathematics of Operations Research Y1 - 2017 N1 - URL of the Slides: https://app.box.com/s/00aqupo722bbpmdcyzwt8xmfqzyu14iy ER - TY - JOUR A1 - Braun, Gábor A1 - Guzmán, C. A1 - Pokutta, Sebastian T1 - Unifying Lower Bounds on the Oracle Complexity of Nonsmooth Convex Optimization JF - IEEE Transactions of Information Theory Y1 - 2017 N1 - Additional Note: doi:10.1109/TIT.2017.2701343 http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=7919238 N1 - URL of the PDF: http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=7919238 VL - 63 IS - 7 SP - 4709 EP - 4724 ER - TY - JOUR A1 - Braun, Gábor A1 - Jain, R. A1 - Lee, T. A1 - Pokutta, Sebastian T1 - Information-theoretic approximations of the nonnegative rank JF - Computational Complexity Y1 - 2017 UR - http://eccc.hpi-web.de/report/2013/158 VL - 26 IS - 1 SP - 147 EP - 197 ER - TY - JOUR A1 - Christensen, H. A1 - Khan, A. A1 - Pokutta, Sebastian A1 - Tetali, P. T1 - Multidimensional Bin Packing and Other Related Problems: A survey JF - to appear in Computer Science Review Y1 - 2017 N1 - Additional Note: http://www.sciencedirect.com/science/article/pii/S1574013716301356 http://www.sciencedirect.com/science/article/pii/S1574013716301356 N1 - URL of the PDF: http://www.sciencedirect.com/science/article/pii/S1574013716301356 ER - TY - JOUR A1 - Martin, Alex A1 - Müller, J. A1 - Pape, S. A1 - Peter, A. A1 - Pokutta, Sebastian A1 - Winter, T. T1 - Pricing and clearing combinatorial markets with singleton and swap orders JF - Mathematical Methods of Operations Research Y1 - 2017 VL - 85 IS - 2 SP - 155 EP - 177 ER - TY - CHAP A1 - Braun, Gábor A1 - Pokutta, Sebastian A1 - Zink, Daniel T1 - Lazifying Conditional Gradient Algorithms T2 - Proceedings of the International Conference on Machine Learning (ICML) Y1 - 2017 N1 - URL of the PDF: http://proceedings.mlr.press/v70/braun17a N1 - URL of the Poster: https://app.box.com/s/lysscdg17ytpz7mqr0tu2djffyqvkl6a N1 - URL of the Slides: https://app.box.com/s/zsp0hixjz2ha23u1vuyosijjkjdh8kj7 ER - TY - CHAP A1 - Arumugam, Keerthi Suria Kumar A1 - Kadampot, Ishaque Ashar A1 - Tahmasbi, Mehrdad A1 - Shah, Shaswat A1 - Bloch, Matthieu A1 - Pokutta, Sebastian T1 - Modulation Recognition Using Side Information and Hybrid Learning T2 - Proceedings of IEEE DySPAN Y1 - 2017 ER - TY - CHAP A1 - Lan, G. A1 - Pokutta, Sebastian A1 - Zhou, Y. A1 - Zink, Daniel T1 - Conditional Accelerated Lazy Stochastic Gradient Descent T2 - Proceedings of the International Conference on Machine Learning (ICML) Y1 - 2017 N1 - URL of the PDF: http://proceedings.mlr.press/v70/lan17a.html N1 - URL of the Poster: https://app.box.com/s/wnwym0p3eby54abb5bidnz7gznlkentq ER - TY - CHAP A1 - Inanlouganji, A. A1 - Pedrielli, G. A1 - Fainekos, G. A1 - Pokutta, Sebastian T1 - Continuous Simulation Optimization with Model Mismatch Using Gaussian Process Regression T2 - Proceedings of the 2018 Winter Simulation Conference Y1 - 2018 ER - TY - CHAP A1 - Pokutta, Sebastian A1 - Singh, M. A1 - Torrico, A. T1 - Efficient algorithms for robust submodular maximization under matroid constraints T2 - ICML Workshop Paper Y1 - 2018 N1 - Additional Note: https://arxiv.org/abs/1807.09405 N1 - URL of the PDF: https://sites.google.com/view/icml2018nonconvex/papers ER - TY - CHAP A1 - Braun, Gábor A1 - Pokutta, Sebastian A1 - Tu, Dan A1 - Wright, Stephen T1 - Blended Conditional Gradients: the unconditioning of conditional gradients T2 - Proceedings of ICML Y1 - 2019 N1 - Additional Note: https://arxiv.org/abs/1805.07311 N1 - URL of the Code: https://github.com/pokutta/bcg N1 - URL of the PDF: http://proceedings.mlr.press/v97/braun19a/braun19a.pdf N1 - URL of the Poster: https://app.box.com/s/nmmm671jd72i397nysa8emfnzh1hn6hf N1 - URL of the Slides: https://app.box.com/s/xbx3z7ws6dxvl3rzgj4jp6forigycooe N1 - URL of the Abstract: http://www.pokutta.com/blog/research/2019/02/18/bcg-abstract.html ER - TY - CHAP A1 - Kerdreux, T. A1 - d’Aspremont, A. A1 - Pokutta, Sebastian T1 - Restarting Frank-Wolfe T2 - Proceedings of AISTATS Y1 - 2019 N1 - URL of the PDF: http://proceedings.mlr.press/v89/kerdreux19a/kerdreux19a.pdf N1 - URL of the Slides: https://app.box.com/s/prd32r6xmuef2k4gah23rd0egllz9rv5 N1 - URL of the Abstract: http://www.pokutta.com/blog/research/2019/05/02/restartfw-abstract.html ER - TY - CHAP A1 - Anari, N. A1 - Haghtalab, N. A1 - Naor, S. A1 - Pokutta, Sebastian A1 - Singh, M. A1 - Torrico, A. T1 - Structured Robust Submodular Maximization: Offline and Online Algorithms T2 - Proceedings of AISTATS Y1 - 2019 N1 - URL of the PDF: http://proceedings.mlr.press/v89/anari19a/anari19a.pdf ER - TY - JOUR A1 - Pokutta, Sebastian A1 - Schmaltz, Christian T1 - Managing liquidity: Optimal degree of centralization JF - Journal of Banking and Finance KW - Real options Y1 - 2011 UR - http://papers.ssrn.com/sol3/papers.cfm?abstract_id=1458963 U6 - https://doi.org/DOI: 10.1016/j.jbankfin.2010.07.001 SN - 0378-4266 N1 - URL of the PDF: http://dx.doi.org/10.1016/j.jbankfin.2010.07.001 VL - 35 SP - 627 EP - 638 ER - TY - JOUR A1 - Pokutta, Sebastian A1 - Stauffer, G. T1 - Lower bounds for the Chvátal-Gomory rank in the 0/1 cube JF - Operations Research Letters Y1 - 2011 UR - http://www.optimization-online.org/DB_HTML/2010/09/2748.html N1 - Additional Note: doi:10.1016/j.orl.2011.03.001 N1 - URL of the PDF: http://dx.doi.org/10.1016/j.orl.2011.03.001 VL - 39 IS - 3 SP - 200-203 ER - TY - JOUR A1 - Braun, Gábor A1 - Pokutta, Sebastian T1 - Rigid abelian groups and the probabilistic method JF - Contemporary Mathematics Y1 - 2012 N1 - Additional Note: doi:/10.1090/conm/576 N1 - URL of the PDF: http://dx.doi.org/10.1090/conm/576 VL - 576 SP - 17 EP - 30 ER - TY - JOUR A1 - Göbel, R. A1 - Pokutta, Sebastian T1 - Absolutely rigid fields and Shelah’s absolutely rigid trees JF - Contemporary Mathematics Y1 - 2012 UR - http://www.box.net/shared/numjyo0qxmpsz9dposyt N1 - Additional Note: doi:/10.1090/conm/576 N1 - URL of the PDF: http://dx.doi.org/10.1090/conm/576 VL - 576 SP - 105 EP - 128 ER - TY - JOUR A1 - Pokutta, Sebastian A1 - Schmaltz, Christian T1 - Optimal Planning under Basel III Regulations JF - Cass-Capco Institute Paper Series on Risk Y1 - 2012 UR - http://papers.ssrn.com/sol3/papers.cfm?abstract_id=1914800 N1 - Additional Note: http://www.capco.com/capco-institute/capco-journal/journal-34-cass-capco-institute-paper-series-on-risk N1 - URL of the PDF: http://www.capco.com/capco-institute/capco-journal/journal-34-cass-capco-institute-paper-series-on-risk VL - 34 ER - TY - JOUR A1 - Kroll, C. A1 - Pokutta, Sebastian T1 - Just a perfect day: developing a happiness optimised day schedule JF - Journal of Economic Psychology Y1 - 2013 N1 - Additional Note: doi:/10.1016/j.joep.2012.09.015 N1 - URL of the PDF: http://www.sciencedirect.com/science/article/pii/S0167487012001158 VL - 34 SP - 210 EP - 217 ER - TY - JOUR A1 - Pokutta, Sebastian A1 - VanVyve, M. T1 - A note on the extension complexity of the knapsack polytope JF - Operations Research Letters Y1 - 2013 UR - http://www.optimization-online.org/DB_HTML/2013/02/3787.html N1 - Additional Note: DOI information: 10.1016/j.orl.2013.03.010 N1 - URL of the PDF: http://dx.doi.org/10.1016/j.orl.2013.03.010 VL - 41 SP - 347 EP - 350 ER - TY - JOUR A1 - Schmaltz, Christian A1 - Pokutta, Sebastian A1 - Heidorn, Thomas A1 - Andrae, Silvio T1 - How to make regulators and shareholders happy under Basel III JF - Journal of Banking and Finance Y1 - 2014 UR - http://ssrn.com/abstract=2179490 N1 - Additional Note: 10.1016/j.jbankfin.2014.05.031 N1 - URL of the PDF: http://dx.doi.org/10.1016/j.jbankfin.2014.05.031 SP - 311 EP - 325 ER - TY - JOUR A1 - Braun, Gábor A1 - Pokutta, Sebastian T1 - A short proof for the polyhedrality of the Chvátal-Gomory closure of a compact convex set JF - Operations Research Letters Y1 - 2014 N1 - Additional Note: 10.1016/j.orl.2014.05.004 VL - 42 SP - 307 EP - 310 ER - TY - JOUR A1 - Dey, Santanu Sabush A1 - Pokutta, Sebastian T1 - Design and verify: a new scheme for generating cutting-planes JF - Mathematical Programming A Y1 - 2014 UR - http://www.optimization-online.org/DB_HTML/2011/04/3002.html N1 - Additional Note: DOI: 10.1007/978-3-642-20807-2_12 VL - 145 SP - 199 EP - 222 ER - TY - JOUR A1 - Pokutta, Sebastian A1 - Strüngmann, L. T1 - The Chase radical and reduced products JF - Journal of Pure and Applied Algebra Y1 - 2007 N1 - Additional Note: doi:10.1016/j.jpaa.2007.02.007 N1 - URL of the PDF: http://dx.doi.org/10.1016/j.jpaa.2007.02.007 VL - 211 SP - 532 EP - 540 ER - TY - JOUR A1 - Droste, M. A1 - Göbel, R. A1 - Pokutta, Sebastian T1 - Absolute graphs with prescribed endomorphism monoid JF - Semigroup Forum Y1 - 2008 N1 - URL of the PDF: http://dx.doi.org/doi:10.1007/s00233-007-9029-1 VL - 76 SP - 256 EP - 267 ER - TY - JOUR A1 - Göbel, R. A1 - Pokutta, Sebastian T1 - Construction of dual modules using Martin’s axiom JF - Journal of Algebra Y1 - 2008 N1 - Additional Note: doi:10.1016/j.jalgebra.2008.06.017 N1 - URL of the PDF: https://www.sciencedirect.com/science/article/pii/S0021869308003153 VL - 320 SP - 2388 EP - 2404 ER - TY - JOUR A1 - Heldt, D. A1 - Kreuzer, M. A1 - Pokutta, Sebastian A1 - Poulisse, H. T1 - Approximate Computation of zero-dimensional polynomial ideals JF - Journal of Symbolic Computation Y1 - 2009 N1 - Additional Note: doi:10.1016/j.jsc.2008.11.010 N1 - URL of the PDF: http://dx.doi.org/10.1016/j.jsc.2008.11.010 VL - 44 SP - 1566 EP - 1591 ER - TY - JOUR A1 - Pokutta, Sebastian A1 - Stauffer, G. T1 - France Telecom Workforce Scheduling Problem: a challenge JF - RAIRO-Operations Research Y1 - 2009 N1 - Additional Note: DOI: 10.1051/ro/2009025 N1 - URL of the PDF: http://dx.doi.org/10.1051/ro/2009025 IS - 43 SP - 375 EP - 386 ER - TY - JOUR A1 - Braun, Gábor A1 - Pokutta, Sebastian T1 - Random half-integral polytopes JF - Operations Research Letters Y1 - 2011 UR - http://www.optimization-online.org/DB_HTML/2010/11/2813.html N1 - Additional Note: doi:10.1016/j.orl.2011.03.003 VL - 39 IS - 3 SP - 204 EP - 207 ER - TY - JOUR A1 - Haus, Utz-Uwe A1 - Hemmecke, R. A1 - Pokutta, Sebastian T1 - Reconstructing biochemical cluster networks JF - Journal of Mathematical Chemistry Y1 - 2011 N1 - URL of the PDF: http://dx.doi.org/10.1007/s10910-011-9892-6 VL - 49 IS - 10 SP - 2441 EP - 2456 ER - TY - JOUR A1 - Letchford, A.N. A1 - Pokutta, Sebastian A1 - Schulz, A.S. T1 - On the membership problem for the 0,1/2-closure JF - Operations Research Letters Y1 - 2011 UR - http://www.box.net/shared/zxx88q38l3 N1 - Additional Note: doi:10.1016/j.orl.2011.07.003 N1 - URL of the PDF: http://dx.doi.org/10.1016/j.orl.2011.07.003 VL - 39 IS - 5 SP - 301 EP - 304 ER - TY - JOUR A1 - Pokutta, Sebastian A1 - Schulz, A.S. T1 - Integer-empty polytopes in the 0/1-cube with maximal Gomory-Chvátal rank JF - Operations Research Letters Y1 - 2011 UR - http://www.optimization-online.org/DB_HTML/2010/12/2850.html N1 - Additional Note: doi:10.1016/j.orl.2011.09.004 N1 - URL of the PDF: http://dx.doi.org/10.1016/j.orl.2011.09.004 VL - 39 IS - 6 SP - 457 EP - 460 ER - TY - JOUR A1 - Drewes, S. A1 - Pokutta, Sebastian T1 - Computing discrete expected utility maximizing portfolios JF - Journal of Investing Y1 - 2014 UR - http://papers.ssrn.com/sol3/papers.cfm?abstract_id=1662729 VL - 23 IS - 4 SP - 121 EP - 132 ER - TY - JOUR A1 - Drewes, S. A1 - Pokutta, Sebastian T1 - Symmetry-exploiting cuts for a class of mixed-0/1 second order cone programs JF - Discrete Optimization Y1 - 2014 UR - http://www.optimization-online.org/DB_HTML/2010/06/2652.html N1 - Additional Note: doi:10.1016/j.disopt.2014.04.002 VL - 13 SP - 23 EP - 35 ER - TY - JOUR A1 - Martin, Alexander A1 - Müller, J. A1 - Pokutta, Sebastian T1 - Strict linear prices in non-convex European day-ahead electricity markets JF - Optimization Methods and Software Y1 - 2014 UR - http://papers.ssrn.com/sol3/papers.cfm?abstract_id=1660528 N1 - Additional Note: 10.1080/10556788.2013.823544 N1 - URL of the PDF: http://dx.doi.org/10.1080/10556788.2013.823544 VL - 29 IS - 1 SP - 189 EP - 221 ER -