Abstract is missing.
- On the Structure of Reduced Kernel Lattice BasesKaren Aardal, Frederik von Heymann. 1-12 [doi]
- All-or-Nothing Generalized Assignment with Application to Scheduling Advertising CampaignsRon Adany, Moran Feldman, Elad Haramaty, Rohit Khandekar, Baruch Schieber, Roy Schwartz, Hadas Shachnai, Tami Tamir. 13-24 [doi]
- Constant Integrality Gap LP Formulations of Unsplittable Flow on a PathAris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi, Andreas Wiese. 25-36 [doi]
- Intersection Cuts for Mixed Integer Conic Quadratic SetsKent Andersen, Anders Nedergaard Jensen. 37-48 [doi]
- Content Placement via the Exponential Potential Function MethodDavid Applegate, Aaron Archer, Vijay Gopalakrishnan, Seungjoon Lee, K. K. Ramakrishnan. 49-61 [doi]
- Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem: II. The Unimodular Two-Dimensional CaseAmitabh Basu, Robert Hildebrand, Matthias Köppe. 62-73 [doi]
- Blocking Optimal ArborescencesAttila Bernáth, Gyula Pap. 74-85 [doi]
- Minimum Clique Cover in Claw-Free Perfect Graphs and the Weak Edmonds-Johnson PropertyFlavia Bonomo, Gianpaolo Oriolo, Claudia Snels, Gautier Stauffer. 86-97 [doi]
- A Complexity and Approximability Study of the Bilevel Knapsack ProblemAlberto Caprara, Margarida Carvalho, Andrea Lodi, Gerhard J. Woeginger. 98-109 [doi]
- Matroid and Knapsack Center ProblemsDanny Z. Chen, Jian Li, Hongyu Liang, Haitao Wang. 110-122 [doi]
- Cut-Generating FunctionsMichele Conforti, Gérard Cornuéjols, Aris Daniilidis, Claude Lemaréchal, Jérôme Malick. 123-132 [doi]
- Reverse Chvátal-Gomory RankMichele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza, Roland Grappe. 133-144 [doi]
- On Some Generalizations of the Split ClosureSanjeeb Dash, Oktay Günlük, Diego Alejandro Morán Ramirez. 145-156 [doi]
- Packing Interdiction and Partial Covering ProblemsMichael Dinitz, Anupam Gupta. 157-168 [doi]
- On Valid Inequalities for Quadratic Programming with Continuous Variables and Binary IndicatorsHongbo Dong, Jeff Linderoth. 169-180 [doi]
- An Improved Integrality Gap for Asymmetric TSP PathsZachary Friggstad, Anupam Gupta, Mohit Singh. 181-192 [doi]
- Single Commodity-Flow Algorithms for Lifts of Graphic and Co-graphic MatroidsBertrand Guenin, Leanne Stuive. 193-204 [doi]
- A Stochastic Probing Problem with ApplicationsAnupam Gupta, Viswanath Nagarajan. 205-216 [doi]
- Thrifty Algorithms for Multistage Robust OptimizationAnupam Gupta, Viswanath Nagarajan, Vijay V. Vazirani. 217-228 [doi]
- Shallow-Light Steiner Arborescences with Vertex DelaysStephan Held, Daniel Rotter. 229-241 [doi]
- Two Dimensional Optimal Mechanism Design for a Sequencing ProblemRuben Hoeksma, Marc Uetz. 242-253 [doi]
- Advances on Matroid Secretary Problems: Free Order Model and Laminar CasePatrick Jaillet, José A. Soto, Rico Zenklusen. 254-265 [doi]
- A Polynomial-Time Algorithm to Check Closedness of Simple Second Order Mixed-Integer SetsDiego Alejandro Morán Ramírez, Santanu S. Dey. 266-277 [doi]
- The Complexity of Scheduling for p-Norms of Flow and Stretch - (Extended Abstract)Benjamin Moseley, Kirk Pruhs, Cliff Stein. 278-289 [doi]
- The Euclidean k-Supplier ProblemViswanath Nagarajan, Baruch Schieber, Hadas Shachnai. 290-301 [doi]
- Facial Structure and Representation of Integer Hulls of Convex SetsVishnu Narayanan. 302-313 [doi]
- An Efficient Polynomial-Time Approximation Scheme for the Joint Replenishment ProblemTim Nonner, Maxim Sviridenko. 314-323 [doi]
- Chain-Constrained Spanning TreesNeil Olver, Rico Zenklusen. 324-335 [doi]
- A Simpler Proof for $O(\textrm{Congestion} + \textrm{Dilation})$ Packet RoutingThomas Rothvoß. 336-348 [doi]
- 0/1 Polytopes with Quadratic Chvátal RankThomas Rothvoß, Laura Sanità. 349-361 [doi]
- Eight-Fifth Approximation for the Path TSPAndrás Sebö. 362-374 [doi]
- Fast Deterministic Algorithms for Matrix Completion ProblemsTasuku Soma. 375-386 [doi]
- Approximating the Configuration-LP for Minimizing Weighted Sum of Completion Times on Unrelated MachinesMaxim Sviridenko, Andreas Wiese. 387-398 [doi]