Abstract is missing.
- Inequalities from Two Rows of a Simplex TableauKent Andersen, Quentin Louveaux, Robert Weismantel, Laurence A. Wolsey. 1-15 [doi]
- Cuts for Conic Mixed-Integer ProgrammingAlper Atamtürk, Vishnu Narayanan. 16-29 [doi]
- Sequential-Merge Facets for Two-Dimensional Group ProblemsSantanu S. Dey, Jean-Philippe P. Richard. 30-42 [doi]
- Triangle-Free Simple 2-Matchings in Subcubic Graphs (Extended Abstract)David Hartvigsen, Yanjun Li. 43-52 [doi]
- The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer OptimizationRené Beier, Heiko Röglin, Berthold Vöcking. 53-67 [doi]
- Finding a Polytope from Its Graph in Polynomial TimeEric J. Friedman. 68-73 [doi]
- Orbitopal FixingVolker Kaibel, Matthias Peinhardt, Marc E. Pfetsch. 74-88 [doi]
- New Variants of Lift-and-Project Cut Generation from the LP Tableau: Open Source Implementation and TestingEgon Balas, Pierre Bonami. 89-103 [doi]
- Orbital BranchingJames Ostrowski, Jeff Linderoth, Fabrizio Rossi, Stefano Smriglio. 104-118 [doi]
- Distinct Triangle Areas in a Planar Point SetAdrian Dumitrescu, Csaba D. Tóth. 119-129 [doi]
- Scheduling with Precedence Constraints of Low Fractional DimensionChristoph Ambühl, Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svensson. 130-144 [doi]
- Approximation Algorithms for 2-Stage Stochastic Scheduling ProblemsDavid B. Shmoys, Mauro Sozio. 145-157 [doi]
- On Integer Programming and the Branch-Width of the Constraint MatrixWilliam H. Cunningham, Jim Geelen. 158-166 [doi]
- Matching Problems in Polymatroids Without Double CircuitsMárton Makai, Gyula Pap, Jácint Szabó. 167-181 [doi]
- Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)Gruia Calinescu, Chandra Chekuri, Martin Pál, Jan Vondrák. 182-196 [doi]
- On a Generalization of the Master Cyclic Group PolyhedronSanjeeb Dash, Ricardo Fukasawa, Oktay Günlük. 197-209 [doi]
- A Framework to Derive Multidimensional Superadditive Lifting Functions and Its ApplicationsBo Zeng, Jean-Philippe P. Richard. 210-224 [doi]
- On the Exact Separation of Mixed Integer Knapsack CutsRicardo Fukasawa, Marcos Goycoolea. 225-239 [doi]
- A Faster Strongly Polynomial Time Algorithm for Submodular Function MinimizationJames B. Orlin. 240-251 [doi]
- On Convex Minimization over Base PolytopesKiyohito Nagano. 252-266 [doi]
- Computational Geometric Approach to Submodular Function Minimization for Multiclass Queueing SystemsToshinari Itoko, Satoru Iwata. 267-279 [doi]
- Generating Multiple Solutions for Mixed Integer Programming ProblemsEmilie Danna, Mary Fenelon, Zonghao Gu, Roland Wunderling. 280-294 [doi]
- A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral RelaxationsFranz Rendl, Giovanni Rinaldi, Angelika Wiegele. 295-309 [doi]
- DINS, a MIP Improvement HeuristicShubhashis Ghosh. 310-323 [doi]
- Mixed-Integer Vertex Covers on Bipartite GraphsMichele Conforti, Bert Gerards, Giacomo Zambelli. 324-336 [doi]
- On the MIR Closure of PolyhedraSanjeeb Dash, Oktay Günlük, Andrea Lodi. 337-351 [doi]
- The Intersection of Continuous Mixing Polyhedra and the Continuous Mixing Polyhedron with FlowsMichele Conforti, Marco Di Summa, Laurence A. Wolsey. 352-366 [doi]
- Simple Explicit Formula for Counting Lattice Points of PolyhedraJean B. Lasserre, Eduardo S. Zeron. 367-381 [doi]
- Characterizations of Total Dual IntegralityEdwin O Shea, András Sebö. 382-396 [doi]
- Sign-Solvable Linear Complementarity ProblemsNaonori Kakimura. 397-409 [doi]
- An Integer Programming Approach for Linear Programs with Probabilistic ConstraintsJames Luedtke, Shabbir Ahmed, George L. Nemhauser. 410-423 [doi]
- Infrastructure Leasing ProblemsBarbara M. Anthony, Anupam Gupta. 424-438 [doi]
- Robust Combinatorial Optimization with Exponential ScenariosUriel Feige, Kamal Jain, Mohammad Mahdian, Vahab S. Mirrokni. 439-453 [doi]
- Approximation Algorithms for the Multi-item Capacitated Lot-Sizing Problem Via Flow-Cover InequalitiesRetsef Levi, Andrea Lodi, Maxim Sviridenko. 454-468 [doi]
- Optimal Efficiency Guarantees for Network Design MechanismsTim Roughgarden, Mukund Sundararajan. 469-483 [doi]
- The Set Connector Problem in GraphsTakuro Fukunaga, Hiroshi Nagamochi. 484-498 [doi]