Conferences in DBLP
Imre Bárány , Shmuel Onn Colourful Linear Programming. [Citation Graph (0, 0)][DBLP ] Conf ] Rekha R. Thomas , Robert Weismantel Test Sets and Inequalities for Integer Programs. [Citation Graph (0, 0)][DBLP ] Conf ] Carsten Rössner , Claus-Peter Schnorr An Optimal, Stable Continued Fraction Algorithm. [Citation Graph (0, 0)][DBLP ] Conf ] Sunil Chopra , Itzhak Gilboa , S. Trilochan Sastry Algorithms and Extended Formulations for One and Two Facility Network Design. [Citation Graph (0, 0)][DBLP ] Conf ] Cynthia Barnhart , Christopher A. Hane , Pamela H. Vance Integer Muticommodity Flow Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Alberto Caprara , Matteo Fischetti , Paolo Toth A Heuristic Algorithm for the Set Covering Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Paul Tseng , Dimitri P. Bertsekas A epsilon-Relaxation Method for Generalized Separable Convex Cost Network Flow Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Stavros G. Kolliopoulos , Clifford Stein Finding Real-Valued Single-Source Shortest Paths. [Citation Graph (0, 0)][DBLP ] Conf ] Sándor P. Fekete , Samir Khuller , Monika Klemmstein , Balaji Raghavachari , Neal E. Young A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Magnús M. Halldórsson Approximating k -Set Cover and Complementary Graph Coloring. [Citation Graph (0, 0)][DBLP ] Conf ] Sanjiv Kapoor On Minimum 3-Cuts and Approximating k -Cuts Using Cut Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Michel X. Goemans , David P. Williamson Primal-Dual Approximation Algorithms for Feedback Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Gábor Pataki Cone-LP's and Semidefinite Programs: Geometry. [Citation Graph (0, 0)][DBLP ] Conf ] Christoph Helmberg , Franz Rendl , Robert Weismantel Quadratic Knapsack Relaxations Using Cutting Planes. [Citation Graph (0, 0)][DBLP ] Conf ] Nabil Kahale A Semidefinite Bound for Mixing Rates of Markov Chains. [Citation Graph (0, 0)][DBLP ] Conf ] Rainer E. Burkard , Eranda Çela , Günter Rote , Gerhard J. Woeginger The Quadratic Assignment Problem with a Monotone Anti-Monge and a Symmetric Toeplitz Matrix: Easy and Hard Cases. [Citation Graph (0, 0)][DBLP ] Conf ] Edith Cohen On Optimizing Multiplications of Sparse Matrices. [Citation Graph (0, 0)][DBLP ] Conf ] Kurt M. Anstreicher , Marcia Fampa , Jon Lee , Joy Williams Continuous Relaxations for Constrained Maximum-Entropy Sampling. [Citation Graph (0, 0)][DBLP ] Conf ] David Hartvigsen A Submodular Optimization Problem with Side Constraints. [Citation Graph (0, 0)][DBLP ] Conf ] Kazuo Murota Convexity and Steinitz's Exchange Property. [Citation Graph (0, 0)][DBLP ] Conf ] Beth Novick , András Sebö On Ideal Clutters, Metrics and Multiflows. [Citation Graph (0, 0)][DBLP ] Conf ] Michel X. Goemans A Supermodular Relaxation for Scheduling with Release Dates. [Citation Graph (0, 0)][DBLP ] Conf ] Andreas S. Schulz Scheduling to Minimize Total Weighted Completion Time: Performance Guarantees of LP-Based Heuristics and Lower Bounds. [Citation Graph (0, 0)][DBLP ] Conf ] Neil Simonetti , Egon Balas Implementation of a Linear Time Algorithm for Certain Generalized Traveling Salesman Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Dimitris Bertsimas , Chung-Piaw Teo , Rakesh Vohra On Dependent Randomized Rounding Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Hui Chen , Alan M. Frieze Coloring Bipartite Hypergraphs. [Citation Graph (0, 0)][DBLP ] Conf ] Chung-Piaw Teo , Dimitris Bertsimas Improved Randomized Approximation Algorithms for Lot-Sizing Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Han Hoogeveen , Tsuyoshi Kawaguchi Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special Cases. [Citation Graph (0, 0)][DBLP ] Conf ] Paul Martin , David B. Shmoys A New Approach to Computing Optimal Schedules for the Job-Shop Scheduling Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Han Hoogeveen , Arjen P. A. Vestjens Optimal On-Line Algorithms for Single-Machine Scheduling. [Citation Graph (0, 0)][DBLP ] Conf ] Michel X. Goemans , Leslie A. Hall The Strongest Facets of the Acyclic Subgraph Polytope Are Unknown. [Citation Graph (0, 0)][DBLP ] Conf ] Rudolf Müller , Andreas S. Schulz Transitive Packing. [Citation Graph (0, 0)][DBLP ] Conf ] Meinrad Funke , Gerhard Reinelt A Polyhedral Approach to the Feedback Vertex Set Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Robert Carr Separating over Classes of TSP Inequalities Defined by 0 Node-Lifting in Polynominal Time. [Citation Graph (0, 0)][DBLP ] Conf ] Lisa Fleischer , Éva Tardos Separating Maximally Violated Comb Inequalities in Planar Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Rainer E. Burkard , Vladimir G. Deineko , Gerhard J. Woeginger The Travelling Salesman and the PQ-Tree. [Citation Graph (0, 0)][DBLP ] Conf ] 