IPCO B

37 papers

YearTitle / Authors
2007A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations.
Franz Rendl, Giovanni Rinaldi, Angelika Wiegele
2007A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization.
James B. Orlin
2007A Framework to Derive Multidimensional Superadditive Lifting Functions and Its Applications.
Bo Zeng, Jean-Philippe P. Richard
2007An Integer Programming Approach for Linear Programs with Probabilistic Constraints.
James R. Luedtke, Shabbir Ahmed, George L. Nemhauser
2007Approximation Algorithms for 2-Stage Stochastic Scheduling Problems.
David B. Shmoys, Mauro Sozio
2007Approximation Algorithms for the Multi-item Capacitated Lot-Sizing Problem Via Flow-Cover Inequalities.
Retsef Levi, Andrea Lodi, Maxim Sviridenko
2007Characterizations of Total Dual Integrality.
Edwin O'Shea, András Sebö
2007Computational Geometric Approach to Submodular Function Minimization for Multiclass Queueing Systems.
Toshinari Itoko, Satoru Iwata
2007Cuts for Conic Mixed-Integer Programming.
Alper Atamtürk, Vishnu Narayanan
2007DINS, a MIP Improvement Heuristic.
Shubhashis Ghosh
2007Distinct Triangle Areas in a Planar Point Set.
Adrian Dumitrescu, Csaba D. Tóth
2007Finding a Polytope from Its Graph in Polynomial Time.
Eric J. Friedman
2007Generating Multiple Solutions for Mixed Integer Programming Problems.
Emilie Danna, Mary Fenelon, Zonghao Gu, Roland Wunderling
2007Inequalities from Two Rows of a Simplex Tableau.
Kent Andersen, Quentin Louveaux, Robert Weismantel, Laurence A. Wolsey
2007Infrastructure Leasing Problems.
Barbara M. Anthony, Anupam Gupta
2007Integer Programming and Combinatorial Optimization, 12th International IPCO Conference, Ithaca, NY, USA, June 25-27, 2007, Proceedings
Matteo Fischetti, David P. Williamson
2007Matching Problems in Polymatroids Without Double Circuits.
Márton Makai, Gyula Pap, Jácint Szabó
2007Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract).
Gruia Calinescu, Chandra Chekuri, Martin Pál, Jan Vondrák
2007Mixed-Integer Vertex Covers on Bipartite Graphs.
Michele Conforti, Bert Gerards, Giacomo Zambelli
2007New Variants of Lift-and-Project Cut Generation from the LP Tableau: Open Source Implementation and Testing.
Egon Balas, Pierre Bonami
2007On Convex Minimization over Base Polytopes.
Kiyohito Nagano
2007On Integer Programming and the Branch-Width of the Constraint Matrix.
William H. Cunningham, Jim Geelen
2007On a Generalization of the Master Cyclic Group Polyhedron.
Sanjeeb Dash, Ricardo Fukasawa, Oktay Günlük
2007On the Exact Separation of Mixed Integer Knapsack Cuts.
Ricardo Fukasawa, Marcos Goycoolea
2007On the MIR Closure of Polyhedra.
Sanjeeb Dash, Oktay Günlük, Andrea Lodi
2007Optimal Efficiency Guarantees for Network Design Mechanisms.
Tim Roughgarden, Mukund Sundararajan
2007Orbital Branching.
James Ostrowski, Jeff T. Linderoth, Fabrizio Rossi, Stefano Smriglio
2007Orbitopal Fixing.
Volker Kaibel, Matthias Peinhardt, Marc E. Pfetsch
2007Robust Combinatorial Optimization with Exponential Scenarios.
Uriel Feige, Kamal Jain, Mohammad Mahdian, Vahab S. Mirrokni
2007Scheduling with Precedence Constraints of Low Fractional Dimension.
Christoph Ambühl, Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svensson
2007Sequential-Merge Facets for Two-Dimensional Group Problems.
Santanu S. Dey, Jean-Philippe P. Richard
2007Sign-Solvable Linear Complementarity Problems.
Naonori Kakimura
2007Simple Explicit Formula for Counting Lattice Points of Polyhedra.
Jean B. Lasserre, Eduardo S. Zeron
2007The Intersection of Continuous Mixing Polyhedra and the Continuous Mixing Polyhedron with Flows.
Michele Conforti, Marco Di Summa, Laurence A. Wolsey
2007The Set Connector Problem in Graphs.
Takuro Fukunaga, Hiroshi Nagamochi
2007The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization.
René Beier, Heiko Röglin, Berthold Vöcking
2007Triangle-Free Simple 2-Matchings in Subcubic Graphs (Extended Abstract).
David Hartvigsen, Yanjun Li