Conferences in DBLP
Alan M. Frieze , Mark Jerrum Improved Approximation Algorithms for MAX k -CUT and MAX BISECTION. [Citation Graph (0, 0)][DBLP ] Conf ] Guy Even , Joseph Naor , Baruch Schieber , Madhu Sudan Approximating Minimum Feedback Sets and Multi-Cuts in Directed Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Dimitris Bertsimas , Chung-Piaw Teo , Rakesh Vohra Nonlinear Formulations and Improved Randomized Approximation Algorithms for Multicut Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Robert D. Carr Separating Clique Tree and Bipartition Inequalities in Polynominal Time. [Citation Graph (0, 0)][DBLP ] Conf ] Rudolf Müller , Andreas S. Schulz The Interval Order Polytope of a Digraph. [Citation Graph (0, 0)][DBLP ] Conf ] Eddie Cheng , William H. Cunningham Separation Problems for the Stable Set Polytope. [Citation Graph (0, 0)][DBLP ] Conf ] Daniel Bienstock Computational Study of a Family of Mixed-Integer Quadratic Programming Problems. [Citation Graph (0, 0)][DBLP ] Conf ] David Pisinger A Minimal Algorithm for the Bounded Knapsack Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Laureano F. Escudero , Silvano Martello , Paolo Toth A Framework for Tightening 0-1 Programs Based on Extensions of Pure 0-1 KP and SS Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Christoph Helmberg , Svatopluk Poljak , Franz Rendl , Henry Wolkowicz Combining Semidefinite and Polyhedral Relaxations for Integer Programs. [Citation Graph (0, 0)][DBLP ] Conf ] Xiaotie Deng Distributed Near-Optimal Matching. [Citation Graph (0, 0)][DBLP ] Conf ] Ulrich Pferschy The Random Linear Bottleneck Assignment Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Boris V. Cherkassky , Andrew V. Goldberg On Implementing Push-Relabel Method for the Maximum Flow Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Agha Iqbal Ali , Hyun-Soo Han , Jeffery L. Kennington Use of Hidden Network Structure in the Set Partitioning Problem. [Citation Graph (0, 0)][DBLP ] Conf ] David Hartvigsen Generalized Max Flows and Augmenting Paths. [Citation Graph (0, 0)][DBLP ] Conf ] Peter Kleinschmidt , Shmuel Onn Oriented Matroid Polytopes and Polyhedral Fans are Signable. [Citation Graph (0, 0)][DBLP ] Conf ] Beth Novick , András Sebö On Combinatorial Properties of Binary Spaces. [Citation Graph (0, 0)][DBLP ] Conf ] André Bouchet Coverings and Delta-Coverings. [Citation Graph (0, 0)][DBLP ] Conf ] Imre Bárány , Herbert E. Scarf , David Shallcross The Topological Structure of Maximal Lattice Free Convex Bodies: The General Case. [Citation Graph (0, 0)][DBLP ] Conf ] François Laburthe The Hilbert Basis of the Cut Cone over the Complete Graph K 6 . [Citation Graph (0, 0)][DBLP ] Conf ] Serkan Hosten , Bernd Sturmfels GRIN: An Implementation of Gröbner Bases for Integer Programming. [Citation Graph (0, 0)][DBLP ] Conf ] Yves Crama , Frits C. R. Spieksma Scheduling Jobs of Equal Length: Complexity, Facets and Computational Results. [Citation Graph (0, 0)][DBLP ] Conf ] Han Hoogeveen , Steef L. van de Velde Formulating a Scheduling Problem with Almost Identical Jobs by Using Positional Completion Times. [Citation Graph (0, 0)][DBLP ] Conf ] Maurice Queyranne , Andreas S. Schulz Scheduling Unit Jobs with Compatible Release Dates on Parallel Machines with Nonstationary Speeds. [Citation Graph (0, 0)][DBLP ] Conf ] Michele Conforti , Gérard Cornuéjols , Ajai Kapoor , Kristina Vuskovic A Mickey-Mouse Decomposition Theorem. [Citation Graph (0, 0)][DBLP ] Conf ] Bettina Klinz , Gerhard J. Woeginger Minimum Cost Dynamic Flows: The Series-Parallel Case. [Citation Graph (0, 0)][DBLP ] Conf ] Paolo Nobili , Antonio Sassano (0, ±1) Ideal Matrices. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Juvan , Joze Marincek , Bojan Mohar Embedding Graphs in the Torus in Linear Time. [Citation Graph (0, 0)][DBLP ] Conf ] Alexander A. Ageev , Alexandr V. Kostochka , Zoltán Szigeti A Characterization of Seymour Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] J. Eric Bartels , Dominic Welsh The Markov Chain of Colourings. [Citation Graph (0, 0)][DBLP ] Conf ] Harold N. Gabow , K. S. Manu Packing Algorithms for Arborescences (and Spanning Trees) in Capacitated Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Hiroshi Nagamochi , Toshihide Ibaraki A Faster Edge Splitting Algorithm in Multigraphs and its Application to the Edge-Connectivity Augmentation Problem. [Citation Graph (0, 0)][DBLP ] Conf ] András Frank , Tibor Jordán How to Make a Strongly Connected Digraph Two-Connected. [Citation Graph (0, 0)][DBLP ] Conf ] Geir Dahl Polyhedra and Optimization in Connection with a Weak Majorization Ordering. [Citation Graph (0, 0)][DBLP ] Conf ] Sebastián Ceria , Gérard Cornuéjols , Milind Dawande Combining and Strengthening Gomory Cuts. [Citation Graph (0, 0)][DBLP ] Conf ] Zonghao Gu , George L. Nemhauser , Martin W. P. Savelsbergh Sequence Independent Lifting of Cover Inequalities. [Citation Graph (0, 0)][DBLP ] Conf ] 