Abstract is missing.
- An Excluded Minor Characterization of Seymour GraphsAlexander A. Ageev, Yohann Benchetrit, András Sebö, Zoltán Szigeti. 1-13 [doi]
- Complexity Analyses of Bienstock-Zuckerberg and Lasserre Relaxations on the Matching and Stable Set PolytopesYu-Hin Au, Levent Tunçel. 14-26 [doi]
- A Probabilistic Analysis of the Strength of the Split and Triangle ClosuresAmitabh Basu, Gérard Cornuéjols, Marco Molinaro. 27-38 [doi]
- Partial Convexification of General MIPs by Dantzig-Wolfe ReformulationMartin Bergner, Alberto Caprara, Fabio Furini, Marco E. Lübbecke, Enrico Malaguti, Emiliano Traversi. 39-51 [doi]
- Lift-and-Project Cuts for Mixed Integer Convex ProgramsPierre Bonami. 52-64 [doi]
- TSP on Cubic and Subcubic GraphsSylvia Boyd, René Sitters, Suzanne van der Ster, Leen Stougie. 65-77 [doi]
- Approximability of Capacitated Network DesignDeeparnab Chakrabarty, Chandra Chekuri, Sanjeev Khanna, Nitish Korula. 78-91 [doi]
- Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency ProblemsDeeparnab Chakrabarty, Chaitanya Swamy. 92-103 [doi]
- An Exact Rational Mixed-Integer Programming SolverWilliam Cook, Thorsten Koch, Daniel E. Steffy, Kati Wolter. 104-116 [doi]
- Valid Inequalities for the Pooling Problem with Binary VariablesClaudia D Ambrosio, Jeff Linderoth, James Luedtke. 117-129 [doi]
- On the Chvátal-Gomory Closure of a Compact Convex SetDaniel Dadush, Santanu S. Dey, Juan Pablo Vielma. 130-142 [doi]
- Design and Verify: A New Scheme for Generating Cutting-PlanesSantanu S. Dey, Sebastian Pokutta. 143-155 [doi]
- Contact Center Scheduling with Strict Resource RequirementsAman Dhesi, Pranav Gupta, Amit Kumar, Gyana R. Parija, Sambuddha Roy. 156-169 [doi]
- Set Covering with Ordered Replacement: Additive and Multiplicative GapsFriedrich Eisenbrand, Naonori Kakimura, Thomas Rothvoß, Laura Sanità. 170-182 [doi]
- Backdoor BranchingMatteo Fischetti, Michele Monaci. 183-191 [doi]
- A Subexponential Lower Bound for Zadeh s Pivoting Rule for Solving Linear Programs and GamesOliver Friedmann. 192-206 [doi]
- An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial ProgrammingBissan Ghaddar, Juan C. Vera, Miguel F. Anjos. 207-222 [doi]
- A New Approach to the Stable Set Problem Based on EllipsoidsMonia Giandomenico, Adam N. Letchford, Fabrizio Rossi, Stefano Smriglio. 223-234 [doi]
- Capacitated Vehicle Routing with Non-uniform SpeedsInge Li Gørtz, Marco Molinaro, Viswanath Nagarajan, R. Ravi. 235-247 [doi]
- Approximation Algorithms for Single and Multi-Commodity Connected Facility LocationFabrizio Grandoni, Thomas Rothvoß. 248-260 [doi]
- Safe Lower Bounds for Graph ColoringStephan Held, William Cook, Edward C. Sewell. 261-273 [doi]
- Computing the Maximum Degree of Minors in Mixed Polynomial Matrices via Combinatorial RelaxationSatoru Iwata, Mizuyo Takamatsu. 274-286 [doi]
- Constructing Extended Formulations from Reflection RelationsVolker Kaibel, Kanstantsin Pashkovich. 287-300 [doi]
- Integrality Gaps of Linear and Semi-Definite Programming Relaxations for KnapsackAnna R. Karlin, Claire Mathieu, C. Thach Nguyen. 301-314 [doi]
- Degree Bounded Forest CoveringTamás Király, Lap Chi Lau. 315-323 [doi]
- A Primal-Dual Algorithm for Weighted Abstract Cut PackingS. Thomas McCormick, Britta Peis. 324-335 [doi]
- Convexification Techniques for Linear Complementarity ConstraintsTrang T. Nguyen, Mohit Tawarmalani, Jean-Philippe P. Richard. 336-348 [doi]
- Iterative Packing for Demand and Hypergraph MatchingOjas Parekh. 349-361 [doi]
- Universal Packet Routing with Arbitrary Bandwidths and Transit TimesBritta Peis, Andreas Wiese. 362-375 [doi]
- A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree ProblemsMario Ruthmair, Günther R. Raidl. 376-388 [doi]
- Jump Number of Two-Directional Orthogonal Ray GraphsJosé A. Soto, Claudio Telha. 389-403 [doi]
- Optimal Matching Forests and Valuated Delta-MatroidsKenjiro Takazawa. 404-416 [doi]
- Fixed-Charge Transportation on a Path: Linear Programming FormulationsMathieu Van Vyve. 417-429 [doi]