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