Conferences in DBLP
Satoru Iwata A Faster Scaling Algorithm for Minimizing Submodular Functions. [Citation Graph (0, 0)][DBLP ] Conf ] Bianca Spille , Robert Weismantel A Generalization of Edmonds' Matching and Matroid Intersection Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Akihisa Tamura A Coordinatewise Domain Scaling Algorithm for M-convex Function Minimization. [Citation Graph (0, 0)][DBLP ] Conf ] Lisa Fleischer , Martin Skutella The Quickest Multicommodity Flow Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Oktay Günlük A New Min-Cut Max-Flow Ratio for Multicommodity Flows. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Lewin , Dror Livnat , Uri Zwick Improved Rounding Techniques for the MAX 2-SAT and MAX DI-CUT Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Sylvia C. Boyd , Geneviève Labonté Finding the Exact Integrality Gap for Small Traveling Salesman Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Adam N. Letchford , Andrea Lodi Polynomial-Time Separation of Simple Comb Inequalities. [Citation Graph (0, 0)][DBLP ] Conf ] Klaus M. Wenger A New Approach to Cactus Construction Applied to TSP Support Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Kent Andersen , Gérard Cornuéjols , Yanjun Li Split Closure and Intersection Cuts. [Citation Graph (0, 0)][DBLP ] Conf ] Sanjeeb Dash An Exponential Lower Bound on the Length of Some Classes of Branch-and-Cut Proofs. [Citation Graph (0, 0)][DBLP ] Conf ] Jean-Philippe P. Richard , Ismael R. de Farias Jr. , George L. Nemhauser Lifted Inequalities for 0-1 Mixed Integer Programming: Basic Theory and Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Ron Aharoni , Tamás Fleiner On a Lemma of Scarf. [Citation Graph (0, 0)][DBLP ] Conf ] Bertrand Guenin A Short Proof of Seymour's Characterization of the Matroids with the Max-Flow Min-Cut Property. [Citation Graph (0, 0)][DBLP ] Conf ] Jay Sethuraman , Chung-Piaw Teo , Rakesh Vohra Integer Programming and Arrovian Social Welfare Functions. [Citation Graph (0, 0)][DBLP ] Conf ] Ravi Ramamoorthi , Amitabh Sinha II Integrated Logistics: Approximation Algorithms Combining Facility Location and Network Design. [Citation Graph (0, 0)][DBLP ] Conf ] René Sitters The Minimum Latency Problem Is NP-Hard for Weighted Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Maxim Sviridenko An Improved Approximation Algorithm for the Metric Uncapacitated Facility Location Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Ernst Althaus , Christian Fink A Polyhedral Approach to Surface Reconstruction from Planar Contours. [Citation Graph (0, 0)][DBLP ] Conf ] Andreas Eisenblätter The Semidefinite Relaxation of the k -Partition Polytope Is Strong. [Citation Graph (0, 0)][DBLP ] Conf ] Ismael R. de Farias Jr. , George L. Nemhauser A Polyhedral Study of the Cardinality Constrained Knapsack Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Mao-cheng Cai , Xiaotie Deng , Haodi Feng , Guojun Li , Guizhen Liu A PTAS for Minimizing Total Completion Time of Bounded Batch Scheduling. [Citation Graph (0, 0)][DBLP ] Conf ] Alberto Caprara , Andrea Lodi , Michele Monaci An Approximation Scheme for the Two-Stage, Two-Dimensional Bin Packing Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Klaus Jansen , Lorant Porkolab On Preemptive Resource Constrained Scheduling: Polynomial-Time Approximation Schemes. [Citation Graph (0, 0)][DBLP ] Conf ] Karen Aardal , Arjen K. Lenstra Hard Equality Constrained Integer Knapsacks. [Citation Graph (0, 0)][DBLP ] Conf ] Alexander I. Barvinok , Tamon Stephen The Distribution of Values in the Quadratic Assignment Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Diego Klabjan A New Subadditive Approach to Integer Programming. [Citation Graph (0, 0)][DBLP ] Conf ] Gruia Calinescu , Amit Chakrabarti , Howard J. Karloff , Yuval Rabani Improved Approximation Algorithms for Resource Allocation. [Citation Graph (0, 0)][DBLP ] Conf ] Ari Freund , Joseph Naor Approximating the Advertisement Placement Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Rajiv Gandhi , Samir Khuller , Yoo Ah Kim , Yung-Chun (Justin) Wan Algorithms for Minimizing Response Time in Broadcast Scheduling. [Citation Graph (0, 0)][DBLP ] Conf ] Chandra Chekuri , Anupam Gupta , Amit Kumar , Joseph Naor , Danny Raz Building Edge-Failure Resilient Networks. [Citation Graph (0, 0)][DBLP ] Conf ] F. Bruce Shepherd , Adrian Vetta The Demand Matching Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Kunal Talwar The Single-Sink Buy-at-Bulk LP Has Constant Integrality Gap. [Citation Graph (0, 0)][DBLP ] Conf ] 