Abstract is missing.
- Mixed-Integer Cuts from Cyclic GroupsMatteo Fischetti, Cristiano Saturni. 1-11 [doi]
- Optimizing over the First Chvàtal ClosureMatteo Fischetti, Andrea Lodi. 12-22 [doi]
- Sequential Pairing of Mixed Integer InequalitiesYongpei Guan, Shabbir Ahmed, George L. Nemhauser. 23-34 [doi]
- Approximate Min-max Relations for Odd Cycles in Planar GraphsSamuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian Vetta. 35-50 [doi]
- Disjoint Cycles: Integrality Gap, Hardness, and ApproximationMohammad R. Salavatipour, Jacques Verstraëte. 51-65 [doi]
- A Combinatorial Algorithm to Find a Maximum Even FactorGyula Pap. 66-80 [doi]
- Improved Approximation Schemes for Linear Programming Relaxations of Combinatorial Optimization ProblemsFabián A. Chudak, Vânia Eleutério. 81-96 [doi]
- On the Approximability of the Minimum Congestion Unsplittable Shortest Path Routing ProblemAndreas Bley. 97-110 [doi]
- Inventory and Facility Location Models with Market SelectionRetsef Levi, Joseph Geunes, H. Edwin Romeijn, David B. Shmoys. 111-124 [doi]
- On Approximating Complex Quadratic Optimization Problems via Semidefinite Programming RelaxationsAnthony Man-Cho So, Jiawei Zhang, Yinyu Ye. 125-135 [doi]
- Semidefinite Bounds for the Stability Number of a Graph via Sums of Squares of PolynomialsNebojsa Gvozdenovic, Monique Laurent. 136-151 [doi]
- Approximation Algorithms for Semidefinite Packing Problems with Applications to Maxcut and Graph ColoringG. Iyengar, David J. Phillips, Clifford Stein. 152-166 [doi]
- On the Inefficiency of Equilibria in Congestion GamesJosé R. Correa, Andreas S. Schulz, Nicolás E. Stier Moses. 167-181 [doi]
- Unrelated Parallel Machine Scheduling with Resource Dependent Processing TimesAlexander Grigoriev, Maxim Sviridenko, Marc Uetz. 182-195 [doi]
- LP-Based Online Scheduling: From Single to Parallel MachinesJosé R. Correa, Michael R. Wagner. 196-209 [doi]
- Unique Sink Orientations of GridsBernd Gärtner, Walter D. Morris, Leo Rüst. 210-224 [doi]
- Jumping Doesn t Help in Abstract CubesIngo Schurr, Tibor Szabó. 225-235 [doi]
- Computing the Inertia from Sign PatternsNaonori Kakimura, Satoru Iwata. 236-248 [doi]
- Randomized Relaxation Methods for the Maximum Feasible Subsystem ProblemEdoardo Amaldi, Pietro Belotti, Raphael Hauser. 249-264 [doi]
- On Clique Separators, Nearly Chordal Graphs, and the Maximum Weight Stable Set ProblemAndreas Brandstädt, Chính T. Hoàng. 265-275 [doi]
- Smoothed Analysis of Integer ProgrammingHeiko Röglin, Berthold Vöcking. 276-290 [doi]
- Circular Ones Matrices and the Stable Set Polytope of Quasi-Line GraphsFriedrich Eisenbrand, Gianpaolo Oriolo, Gautier Stauffer, Paolo Ventura. 291-305 [doi]
- Approximation Algorithms for Stochastic Inventory Control ModelsRetsef Levi, Martin Pál, Robin Roundy, David B. Shmoys. 306-320 [doi]
- On Two-Stage Stochastic Minimum Spanning TreesKedar Dhamdhere, R. Ravi, Mohit Singh. 321-334 [doi]
- Combinatorial Analysis of Generic Matrix PencilsSatoru Iwata, Ryo Shimizu. 335-348 [doi]
- Power Optimization for Connectivity ProblemsMohammad Taghi Hajiaghayi, Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov. 349-361 [doi]
- Packing Steiner ForestsLap Chi Lau. 362-376 [doi]
- Bidimensional Packing by Bilinear ProgrammingAlberto Caprara, Marco Locatelli, Michele Monaci. 377-391 [doi]
- On the L::infinity::-Norm of Extreme Points for Crossing Supermodular Directed Network LPsHarold N. Gabow. 392-406 [doi]
- Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring NetworksCor A. J. Hurkens, Judith Keijsper, Leen Stougie. 407-421 [doi]
- Approximation Algorithms for the Minimum Cardinality Two-Connected Spanning Subgraph ProblemPrabhakar Gubbala, Balaji Raghavachari. 422-436 [doi]
- Using Grammars to Generate Very Large Scale Neighborhoods for the Traveling Salesman Problem and Other Sequencing ProblemsAgustín Bompadre, James B. Orlin. 437-451 [doi]
- A Study of Domino-Parity and k-Parity Constraints for the TSPWilliam Cook, Daniel Espinoza, Marcos Goycoolea. 452-467 [doi]
- Not Every GTSP Facet Induces an STSP FacetMarcus Oswald, Gerhard Reinelt, Dirk Oliver Theis. 468-482 [doi]