The following pages link to Sebastian Pokutta (Q343842):
Displaying 50 items.
- Common information and unique disjointness (Q343843) (← links)
- Average case polyhedral complexity of the maximum stable set problem (Q344955) (← links)
- On the membership problem for the \({0, 1/2}\)-closure (Q408382) (← links)
- Integer-empty polytopes in the 0/1-cube with maximal Gomory-Chvàtal rank (Q408442) (← links)
- Lower bounds for the Chvàtal-Gomory rank in the 0/1 cube (Q635513) (← links)
- Random half-integral polytopes (Q635514) (← links)
- Reconstructing biochemical cluster networks (Q656982) (← links)
- Approximate computation of zero-dimensional polynomial ideals (Q731932) (← links)
- On the existence of 0/1 polytopes with high semidefinite extension complexity (Q745683) (← links)
- Packing and partitioning orbitopes (Q925263) (← links)
- Construction of dual modules using Martin's axiom. (Q952547) (← links)
- The Chase radical and reduced products. (Q995613) (← links)
- Detecting almost symmetries of graphs (Q1621684) (← links)
- Solving MIPs via scaling-based augmentation (Q1662107) (← links)
- The matching problem has no small symmetric SDP (Q1675264) (← links)
- Affine reductions for LPs and SDPs (Q1717229) (← links)
- Aggregation-based cutting-planes for packing and covering integer programs (Q1785202) (← links)
- A short proof for the polyhedrality of the Chvátal-Gomory closure of a compact convex set (Q1785240) (← links)
- Polyhedral approximation of ellipsoidal uncertainty sets via extended formulations: a computational case study (Q1789594) (← links)
- Erratum to: ``Polyhedral approximation of ellipsoidal uncertainty sets via extended formulations: a computational case study'' (Q1789609) (← links)
- Strong reductions for extended formulations (Q1801022) (← links)
- Information-theoretic approximations of the nonnegative rank (Q2012181) (← links)
- Pricing and clearing combinatorial markets with singleton and swap orders. Efficient algorithms for the futures opening auction problem (Q2014365) (← links)
- Mathematics, machine learning and artificial intelligence (Q2032415) (← links)
- Complexity of linear minimization and projection on some sets (Q2060605) (← links)
- Restarting algorithms: sometimes there is free lunch (Q2110384) (← links)
- An algorithm-independent measure of progress for linear constraint propagation (Q2112621) (← links)
- Restarting Frank-Wolfe: faster rates under Hölderian error bounds (Q2116603) (← links)
- New limits of treewidth-based tractability in optimization (Q2118087) (← links)
- Design and verify: a new scheme for generating cutting-planes (Q2248750) (← links)
- Symmetry-exploiting cuts for a class of mixed-\(0/1\) second-order cone programs (Q2339823) (← links)
- Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) (← links)
- A note on the extension complexity of the knapsack polytope (Q2450664) (← links)
- Absolute graphs with prescribed endomorphism monoid (Q2481329) (← links)
- Revisiting the approximate Carathéodory problem via the Frank-Wolfe algorithm (Q2689818) (← links)
- Exponential lower bounds for polytopes in combinatorial optimization (Q2796404) (← links)
- On the Existence of 0/1 Polytopes with High Semidefinite Extension Complexity (Q2849312) (← links)
- Rank of random half-integral polytopes. Extended abstract (Q2883588) (← links)
- Cutting-planes for weakly-coupled \(0/1\) second order cone programs (Q2883643) (← links)
- Inapproximability of Combinatorial Problems via Small LPs and SDPs (Q2941494) (← links)
- Average Case Polyhedral Complexity of the Maximum Stable Set Problem (Q2969642) (← links)
- The Matching Problem Has No Fully Polynomial Size Linear Programming Relaxation Schemes (Q2977254) (← links)
- Design and Verify: A New Scheme for Generating Cutting-Planes (Q3009757) (← links)
- Rigid abelian groups and the probabilistic method (Q3144540) (← links)
- (Q3144548) (← links)
- An Algebraic Approach to Symmetric Extended Formulations (Q3167620) (← links)
- Approximation Limits of Linear Programs (Beyond Hierarchies) (Q3449458) (← links)
- On the Rank of Cutting-Plane Proof Systems (Q3569838) (← links)
- France Telecom workforce scheduling problem: a challenge (Q3644813) (← links)
- The matching problem has no small symmetric SDP (Q4575655) (← links)
