Abstract is missing.
- On Approximation Algorithms for Concave Mixed-Integer Quadratic ProgrammingAlberto Del Pia. 1-13 [doi]
- Centerpoints: A Link Between Optimization and Convex GeometryAmitabh Basu, Timm Oertel. 14-25 [doi]
- Rescaled Coordinate Descent Methods for Linear ProgrammingDaniel Dadush, László A. Végh, Giacomo Zambelli. 26-37 [doi]
- Approximating Min-Cost Chain-Constrained Spanning Trees: A Reduction from Weighted to Unweighted ProblemsAndré Linhares, Chaitanya Swamy. 38-49 [doi]
- Max-Cut Under Graph ConstraintsJon Lee, Viswanath Nagarajan, Xiangkun Shen. 50-62 [doi]
- Sparsest Cut in Planar Graphs, Maximum Concurrent Flows and Their Connections with the Max-Cut ProblemMourad Baïou, Francisco Barahona. 63-76 [doi]
- Intersection Cuts for Bilevel OptimizationMatteo Fischetti, Ivana Ljubic, Michele Monaci, Markus Sinnl. 77-88 [doi]
- Exact Algorithms for the Chance-Constrained Vehicle Routing ProblemThai Dinh, Ricardo Fukasawa, James R. Luedtke. 89-101 [doi]
- Extended Formulations in Mixed-Integer Convex ProgrammingMiles Lubin, Emre Yamangil, Russell Bent, Juan Pablo Vielma. 102-113 [doi]
- k-Trails: Recognition, Complexity, and ApproximationsMohit Singh, Rico Zenklusen. 114-125 [doi]
- Better s-t-Tours by Gao TreesCorinna Gottschalk, Jens Vygen. 126-137 [doi]
- Semidefinite and Linear Programming Integrality Gaps for Scheduling Identical MachinesAdam Kurpisz, Monaldo Mastrolilli, Claire Mathieu, Tobias Mömke, Victor Verdugo, Andreas Wiese. 152-163 [doi]
- Stabilizing Network Bargaining Games by Blocking PlayersSara Ahmadian, Hamideh Hosseinzadeh, Laura Sanità. 164-177 [doi]
- Round-Robin Tournaments Generated by the Circle Method Have Maximum Carry-OverErik Lambrechts, Annette M. C. Ficker, Dries R. Goossens, Frits C. R. Spieksma. 178-189 [doi]
- Extreme Functions with an Arbitrary Number of SlopesAmitabh Basu, Michele Conforti, Marco Di Summa, Joseph Paat. 190-201 [doi]
- Minimal Cut-Generating Functions are Nearly ExtremeAmitabh Basu, Robert Hildebrand, Marco Molinaro. 202-213 [doi]
- On the Mixed Binary Representability of Ellipsoidal RegionsAlberto Del Pia, Jeffrey Poskin. 214-225 [doi]
- Constant Factor Approximation for ATSP with Two Edge Weights - (Extended Abstract)Ola Svensson, Jakub Tarnawski, László A. Végh. 226-237 [doi]
- Improved Approximation Algorithms for Hitting 3-Vertex PathsSamuel Fiorini, Gwenaël Joret, Oliver Schaudt. 238-249 [doi]
- Improved Approximations for Cubic Bipartite and Cubic TSPAnke van Zuylen. 250-261 [doi]
- An Approximation Algorithm for Uniform Capacitated k-Median Problem with 1+\epsilon Capacity ViolationJaroslaw Byrka, Bartosz Rybicki, Sumedha Uniyal. 262-274 [doi]
- Valid Inequalities for Separable Concave Constraints with Indicator VariablesCong Han Lim, Jeff T. Linderoth, James R. Luedtke. 275-286 [doi]
- A Polyhedral Approach to Online Bipartite MatchingAlfredo Torrico, Shabbir Ahmed, Alejandro Toriello. 287-299 [doi]
- On Some Polytopes Contained in the 0, 1 Hypercube that Have a Small Chvátal RankGérard Cornuéjols, Dabeen Lee. 300-311 [doi]
- Robust Monotone Submodular Function MaximizationJames B. Orlin, Andreas S. Schulz, Rajan Udwani. 312-324 [doi]
- Maximizing Monotone Submodular Functions over the Integer LatticeTasuku Soma, Yuichi Yoshida. 325-336 [doi]
- Submodular Unsplittable Flow on TreesAnna Adamaszek, Parinya Chalermsook, Alina Ene, Andreas Wiese. 337-349 [doi]
- Strong Reductions for Extended FormulationsGábor Braun, Sebastian Pokutta, Aurko Roy. 350-361 [doi]
- Sum-of-Squares Hierarchy Lower Bounds for Symmetric FormulationsAdam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli. 362-374 [doi]
- Approximation-Friendly Discrepancy RoundingNikhil Bansal, Viswanath Nagarajan. 375-386 [doi]
- Deciding Emptiness of the Gomory-Chvátal Closure is NP-Complete, Even for a Rational Polyhedron Containing No Integer PointGérard Cornuéjols, Yanjun Li. 387-397 [doi]
- On the Quantile Cut Closure of Chance-Constrained ProblemsWeijun Xie, Shabbir Ahmed. 398-409 [doi]