Integer Programming and Combinatorial Optimization

[1]  Michel X. Goemans,et al.  Smallest compact formulation for the permutahedron , 2015, Math. Program..

[2]  Yasushige Watase,et al.  Introduction to Diophantine Approximation , 2015, Formaliz. Math..

[3]  Thomas Dueholm Hansen,et al.  Errata for: A subexponential lower bound for the Random Facet algorithm for Parity Games , 2014, ArXiv.

[4]  Mathieu Van Vyve,et al.  Fixed-charge transportation on a path: optimization, LP formulations and separation , 2013, Math. Program..

[5]  Alexandr V. Kostochka,et al.  Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree , 2013, J. Graph Theory.

[6]  Pan Changchun,et al.  Mixed-Integer Linear Programming Model for Refinery Short-Term Scheduling of Crude Oil Unloading with Inventory Management , 2013 .

[7]  Franz Rendl,et al.  Semidefinite relaxations of ordering problems , 2013, Math. Program..

[8]  Andreas S. Schulz,et al.  The Gomory-Chvátal Closure of a Non-Rational Polytope is a Rational Polytope , 2012, OR.

[9]  Sanjeeb Dash,et al.  Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra , 2012, Math. Program..

[10]  Dirk Oliver Theis,et al.  Symmetry Matters for Sizes of Extended Formulations , 2012, SIAM J. Discret. Math..

[11]  Satoru Fujishige,et al.  Lattice polyhedra and submodular flows , 2012, Japan Journal of Industrial and Applied Mathematics.

[12]  Martin W. P. Savelsbergh,et al.  Fixed-Charge Transportation with Product Blending , 2012, Transp. Sci..

[13]  Kerem Akartunali,et al.  A computational analysis of lower bounds for big bucket production planning problems , 2012, Computational Optimization and Applications.

[14]  Federico Malucelli,et al.  Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation , 2012, INFORMS J. Comput..

[15]  Mohit Singh,et al.  A Randomized Rounding Approach to the Traveling Salesman Problem , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[16]  Laurence A. Wolsey,et al.  Mixing Sets Linked by Bidirected Paths , 2011, SIAM J. Optim..

[17]  Yanjun Li,et al.  Maximum Cardinality Simple 2-matchings in Subcubic Graphs , 2011, SIAM J. Optim..

[18]  Masakazu Kojima,et al.  Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion , 2011, Math. Program..

[19]  Miguel F. Anjos,et al.  A branch-and-cut algorithm based on semidefinite programming for the minimum k-partition problem , 2011, Ann. Oper. Res..

[20]  Andreas Wiese,et al.  Universal Packet Routing with Arbitrary Bandwidths and Transit Times , 2011, IPCO.

[21]  Oliver Friedmann,et al.  An Exponential Lower Bound for the Latest Deterministic Strategy Iteration Algorithms , 2011, Log. Methods Comput. Sci..

[22]  Luís Gouveia,et al.  Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs , 2011, Math. Program..

[23]  Paolo Toth,et al.  A Freight Service Design Problem for a Railway Corridor , 2011, Transp. Sci..

[24]  Alan Crispin,et al.  Quantum annealing of the graph coloring problem , 2011, Discret. Optim..

[25]  Paolo Toth,et al.  An exact approach for the Vertex Coloring Problem , 2011, Discret. Optim..

[26]  Daniel Dadush,et al.  The Chvátal-Gomory Closure of a Strictly Convex Body , 2011, Math. Oper. Res..

[27]  Thomas Rothvoß,et al.  The entropy rounding method in approximation algorithms , 2011, SODA.

[28]  V. Kaibel.  Extended Formulations in Combinatorial Optimization , 2011, 1104.1023.

[29]  Paul S. Bonsma,et al.  A Constant Factor Approximation Algorithm for Unsplittable Flow on Paths , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[30]  Satoru Iwata,et al.  On the Kronecker Canonical Form of Mixed Matrix Pencils , 2011, SIAM J. Matrix Anal. Appl..

[31]  Jing Hu,et al.  On linear programs with linear complementarity constraints , 2011, Journal of Global Optimization.

[32]  Friedrich Eisenbrand,et al.  Connected facility location via random facility sampling and core detouring , 2010, J. Comput. Syst. Sci..

[33]  Spyridon Antonakopoulos,et al.  Minimum-Cost Network Design with (Dis)economies of Scale , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

[34]  Jin-Kao Hao,et al.  An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring , 2010, Comput. Oper. Res..

[35]  Sven Leyffer,et al.  FilMINT: An Outer Approximation-Based Solver for Convex Mixed-Integer Nonlinear Programs , 2010, INFORMS J. Comput..

[36]  Sanjeev Khanna,et al.  Approximability of Capacitated Network Design , 2010, Algorithmica.

[37]  Chaitanya Swamy,et al.  Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems , 2010, IPCO.

[38]  Günther R. Raidl,et al.  Variable Neighborhood Search and Ant Colony Optimization for the Rooted Delay-Constrained Minimum Spanning Tree Problem , 2010, PPSN.

[39]  Claire Mathieu,et al.  The Train Delivery Problem - Vehicle Routing Meets Bin Packing , 2010, WAOA.

[40]  D. S. Bhusan,et al.  Linear Programming, the Simplex Algorithm and Simple Polytopes , 2010 .

[41]  Laurence A. Wolsey,et al.  Projecting an Extended Formulation for Mixed-Integer Covers on Bipartite Graphs , 2010, Math. Oper. Res..

[42]  Satoshi Tayu,et al.  On two-directional orthogonal ray graphs , 2010, Proceedings of 2010 IEEE International Symposium on Circuits and Systems.

[43]  Mohamed Haouari,et al.  An Exact Algorithm for the Steiner Tree Problem with Delays , 2010, Electron. Notes Discret. Math..

[44]  Ivana Ljubic,et al.  Modelling the Hop Constrained Connected Facility Location Problem on Layered Graphs , 2010, Electron. Notes Discret. Math..

[45]  Friedrich Eisenbrand,et al.  Bin packing via discrepancy of permutations , 2010, SODA '11.

[46]  Fabrizio Grandoni,et al.  Network Design via Core Detouring for Problems without a Core , 2010, ICALP.

[47]  André Raspaud,et al.  Covering a Graph by Forests and a Matching , 2010, SIAM J. Discret. Math..

[48]  Laurence A. Wolsey,et al.  Two row mixed-integer cuts via lifting , 2010, Math. Program..

[49]  Avner Magen,et al.  Extending SDP Integrality Gaps to Sherali-Adams with Applications to Quadratic Programming and MaxCutGain , 2010, IPCO.

[50]  Volker Kaibel,et al.  Branched Polyhedral Systems , 2010, IPCO.

[51]  Juan Pablo Vielma,et al.  The Chvátal-Gomory Closure of an Ellipsoid Is a Polyhedron , 2010, IPCO.

[52]  Fabrizio Grandoni,et al.  An improved LP-based approximation for steiner tree , 2010, STOC '10.

[53]  André Raspaud,et al.  Decomposition of sparse graphs, with application to game coloring number , 2010, Discret. Math..

[54]  Marco E. Lübbecke,et al.  Experiments with a Generic Dantzig-Wolfe Decomposition for Integer Programs , 2010, SEA.

[55]  Martin Skutella,et al.  Packet Routing on the Grid , 2010, LATIN.

[56]  John Fearnley,et al.  Exponential Lower Bounds for Policy Iteration , 2010, ICALP.

[57]  R. Ravi,et al.  Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems , 2010, Math. Oper. Res..

[58]  Etienne de Klerk,et al.  Exploiting special structure in semidefinite programming: A survey of theory and applications , 2010, Eur. J. Oper. Res..

[59]  Yuk Hei Chan,et al.  On linear and semidefinite programming relaxations for hypergraph matching , 2010, Mathematical Programming.

[60]  Martin W. P. Savelsbergh,et al.  Information-based branching schemes for binary linear mixed integer problems , 2009, Math. Program. Comput..

[61]  Peter J. Stuckey,et al.  Dantzig-Wolfe decomposition and branch-and-price solving in G12 , 2009, Constraints.

[62]  Zeev Nutov.  Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[63]  Prasad Raghavendra,et al.  Integrality Gaps for Strong SDP Relaxations of UNIQUE GAMES , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[64]  Piotr Sankowski,et al.  Maximum weight bipartite matching in matrix multiplication time , 2009, Theor. Comput. Sci..

[65]  Günther R. Raidl,et al.  A Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem , 2009, EUROCAST.

[66]  Christos Koufogiannakis,et al.  Distributed Fractional Packing and Maximum Weighted b-Matching via Tail-Recursive Duality , 2009, DISC.

[67]  Martin Skutella,et al.  Packet Routing: Complexity and Algorithms , 2009, WAOA.

[68]  Chandra Chekuri,et al.  Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs , 2009, APPROX-RANDOM.

[69]  Madhur Tulsiani,et al.  Optimal Sherali-Adams Gaps from Pairwise Independence , 2009, APPROX-RANDOM.

[70]  Ronald Koch,et al.  Real-Time Message Routing and Scheduling , 2009, APPROX-RANDOM.

[71]  Aravind Srinivasan,et al.  On k-Column Sparse Packing Programs , 2009, IPCO.

[72]  Oliver Friedmann,et al.  An Exponential Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it , 2009, 2009 24th Annual IEEE Symposium on Logic In Computer Science.

[73]  Alper Atamtürk,et al.  Conic mixed-integer rounding cuts , 2009, Math. Program..

[74]  William J. Cook,et al.  Numerically Safe Gomory Mixed-Integer Cuts , 2009, INFORMS J. Comput..

[75]  Leah Epstein,et al.  Bin packing with general cost structures , 2009, Mathematical Programming.

[76]  Leah Epstein,et al.  AFPTAS Results for Common Variants of Bin Packing: A New Method for Handling the Small Items , 2009, SIAM J. Optim..

[77]  Ernst Althaus,et al.  Fast and Accurate Bounds on Linear Programs , 2009, SEA.

[78]  Nicholas J. A. Harvey.  Algebraic Algorithms for Matching and Matroid Problems , 2009, SIAM J. Comput..

[79]  Venkatesan Guruswami,et al.  MaxMin allocation via degree lower-bounded arborescences , 2009, STOC '09.

[80]  Moses Charikar,et al.  Integrality gaps for Sherali-Adams relaxations , 2009, STOC '09.

[81]  Madhur Tulsiani.  CSP gaps and reductions in the lasserre hierarchy , 2009, STOC '09.

[82]  Yuri Malitsky,et al.  Backdoors to Combinatorial Optimization: Feasibility and Optimality , 2009, CPAIOR.

[83]  Deeparnab Chakrabarty,et al.  Approximability of Sparse Integer Programs , 2009, Algorithmica.

[84]  Masakazu Kojima,et al.  Recognizing underlying sparsity in optimization , 2009, Math. Program..

[85]  Laurence A. Wolsey,et al.  Reformulation and Decomposition of Integer Programs , 2009, 50 Years of Integer Programming.

[86]  Tobias Achterberg,et al.  SCIP: solving constraint integer programs , 2009, Math. Program. Comput..

[87]  Toniann Pitassi,et al.  Exponential Lower Bounds and Integrality Gaps for Tree-Like Lovász-Schrijver Procedures , 2009, SIAM J. Comput..

[88]  Claire Mathieu,et al.  A Quasipolynomial Time Approximation Scheme for Euclidean Capacitated Vehicle Routing , 2008, Algorithmica.

[89]  Leah Epstein,et al.  Asymptotic fully polynomial approximation schemes for variants of open-end bin packing , 2008, Inf. Process. Lett..

[90]  László A. Végh,et al.  An algorithm to increase the node-connectivity of a digraph by one , 2008, Discret. Optim..

[91]  Miroslav Chlebík,et al.  The Steiner tree problem on graphs: Inapproximability results , 2008, Theor. Comput. Sci..

[92]  Grant Schoenebeck,et al.  Linear Level Lasserre Lower Bounds for Certain k-CSPs , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[93]  Sanjeev Khanna,et al.  Algorithms for Single-Source Vertex Connectivity , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[94]  Gyanit Singh,et al.  Improved Approximation Guarantees through Higher Levels of SDP Hierarchies , 2008, APPROX-RANDOM.

[95]  D. Gonçalves,et al.  Covering planar graphs with forests, one having a bounded maximum degree , 2008, Electron. Notes Discret. Math..

[96]  Alexandr V. Kostochka,et al.  Decomposing a planar graph with girth 9 into a forest and a matching , 2008, Eur. J. Comb..

[97]  Diogo Vieira Andrade,et al.  Fast local search for the maximum independent set problem , 2008, Journal of Heuristics.

[98]  Daniel G. Espinoza.  Computing with multi-row Gomory cuts , 2008, Oper. Res. Lett..

[99]  Mohit Singh,et al.  Degree bounded matroids and submodular flows , 2008, Comb..

[100]  Konstantinos Georgiou,et al.  Vertex Cover Resists SDPs Tightened by Local Hypermetric Inequalities , 2008, IPCO.

[101]  S. Thomas McCormick,et al.  A Polynomial Algorithm for Weighted Abstract Flow , 2008, IPCO.

[102]  Prasad Raghavendra,et al.  Optimal algorithms and inapproximability results for every CSP? , 2008, STOC.

[103]  Anthony Vannelli,et al.  Computing Globally Optimal Solutions for Single-Row Layout Problems Using Semidefinite Programming and Cutting Planes , 2008, INFORMS J. Comput..

[104]  Daniel Bienstock,et al.  Approximate formulations for 0-1 knapsack sets , 2008, Oper. Res. Lett..

[105]  Leah Epstein,et al.  An APTAS for Generalized Cost Variable-Sized Bin Packing , 2008, SIAM J. Comput..

[106]  Javier Peña,et al.  Exploiting equalities in polynomial programming , 2008, Oper. Res. Lett..

[107]  Matteo Fischetti,et al.  Projected Chvátal–Gomory cuts for mixed integer linear programs , 2008, Math. Program..

[108]  Ulrich Faigle,et al.  Two-phase greedy algorithms for some classes of combinatorial linear programs , 2008, TALG.

[109]  S. Thomas McCormick,et al.  Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization , 2008, SODA '08.

[110]  Chandra Chekuri,et al.  Improved algorithms for orienteering and related problems , 2008, SODA '08.

[111]  Isabel Méndez-Díaz,et al.  A cutting plane algorithm for graph coloring , 2008, Discret. Appl. Math..

[112]  Adam Shwartz,et al.  Exact finite approximations of average-cost countable Markov decision processes , 2007, Autom..

[113]  William J. Cook,et al.  Exact solutions to linear programming problems , 2007, Oper. Res. Lett..

[114]  T. Pitassi,et al.  Integrality gaps of 2 - o(1) for Vertex Cover SDPs in the Lovész-Schrijver Hierarchy , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[115]  Eden Chlamtác,et al.  Approximation Algorithms Using Hierarchies of Semidefinite Programming Relaxations , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[116]  Yota Otachi,et al.  Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs , 2007, Discret. Appl. Math..

[117]  Tobias Achterberg,et al.  Constraint integer programming , 2007 .

[118]  Chandra Chekuri,et al.  Multicommodity demand flow in a tree and packing integer programs , 2007, TALG.

[119]  Satoru Iwata,et al.  Submodular function minimization , 2007, Math. Program..

[120]  Tamás Terlaky,et al.  A Survey of the S-Lemma , 2007, SIAM Rev..

[121]  Franz Rendl,et al.  A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations , 2007, IPCO.

[122]  Mohit Singh,et al.  Approximating minimum bounded degree spanning trees to within one of optimal , 2007, STOC '07.

[123]  Madhur Tulsiani,et al.  Electronic Colloquium on Computational Complexity, Report No. 132 (2006) Tight Integrality Gaps for Lovasz-Schrijver LP Relaxations of Vertex Cover and Max Cut , 2022 .

[124]  Etienne de Klerk,et al.  Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem , 2007, Math. Program..

[125]  Kent Andersen,et al.  Coefficient strengthening: a tool for reformulating mixed-integer programs , 2007, Math. Program..

[126]  David Pisinger,et al.  The quadratic knapsack problem - a survey , 2007, Discret. Appl. Math..

[127]  Moshe Dror,et al.  Probabilistic Analysis of Unit-Demand Vehicle Routeing Problems , 2007, Journal of Applied Probability.

[128]  Martin Skutella,et al.  An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times , 2007, Algorithmica.

[129]  Juliane Jung,et al.  The Traveling Salesman Problem: A Computational Study , 2007 .

[130]  Martin Skutella,et al.  Quickest Flows Over Time , 2007, SIAM J. Comput..

[131]  E. D. Klerk,et al.  Exploiting group symmetry in truss topology optimization , 2007 .

[132]  Alexander Schrijver,et al.  Reduction of symmetric semidefinite programs using the regular $$\ast$$-representation , 2007, Math. Program..

[133]  Franz Rendl,et al.  Semidefinite programming relaxations for graph coloring and maximal clique problems , 2007, Math. Program..

[134]  Franz Rendl,et al.  Bounds for the quadratic assignment problem using the bundle method , 2007, Math. Program..

[135]  Wenceslas Fernandez de la Vega,et al.  Linear programming relaxations of maxcut , 2007, SODA '07.

[136]  Fabrizio Grandoni,et al.  Improved Approximation for Single-Sink Buy-at-Bulk , 2006, ISAAC.

[137]  Laurence A. Wolsey,et al.  Network Formulations of Mixed-Integer Programs , 2006, Math. Oper. Res..

[138]  M. Charikar,et al.  An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem , 2006, SIAM J. Comput..

[139]  M. Hajiaghayi,et al.  Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[140]  David P. Williamson,et al.  Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems , 2006, J. Comput. Syst. Sci..

[141]  Iannis Tourlakis,et al.  New Lower Bounds for Vertex Cover in the Lovasz-Schrijver Hierarchy , 2006, 21st Annual IEEE Conference on Computational Complexity (CCC'06).

[142]  Jochen Könemann,et al.  Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree , 2006, STOC '06.

[143]  David Zuckerman.  Linear degree extractors and the inapproximability of max clique and chromatic number , 2006, STOC '06.

[144]  Adam N. Letchford,et al.  Exploring the Relationship Between Max-Cut and Stable Set Relaxations , 2006, Math. Program..

[145]  Isabel Méndez-Díaz,et al.  A Branch-and-Cut algorithm for graph coloring , 2006, Discret. Appl. Math..

[146]  Esther M. Arkin,et al.  Approximations for minimum and min-max vehicle routing problems , 2006, J. Algorithms.

[147]  Daniel G. Espinoza.  On Linear Programming, Integer Programming and Cutting Planes , 2006 .

[148]  Christodoulos A. Floudas,et al.  Global optimization of a combinatorially complex generalized pooling problem , 2006 .

[149]  Ignacio E. Grossmann,et al.  Global optimization for the synthesis of integrated water systems in chemical processes , 2006, Comput. Chem. Eng..

[150]  Matteo Fischetti,et al.  An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem , 2006, Math. Program..

[151]  Daniel Král,et al.  Unions of perfect matchings in cubic graphs , 2005, Electron. Notes Discret. Math..

[152]  Hanif D. Sherali,et al.  Partial convexification cuts for 0-1 mixed-integer programs , 2005, Eur. J. Oper. Res..

[153]  Moshe Lewenstein,et al.  An improved upper bound for the TSP in cubic 3-edge-connected graphs , 2005, Oper. Res. Lett..

[154]  Mehmet Tolga Çezik,et al.  Cuts for mixed 0-1 conic programming , 2005, Math. Program..

[155]  Piotr Krysta,et al.  Greedy Approximation via Duality for Packing, Combinatorial Auctions and Routing , 2005, MFCS.

[156]  Martin Skutella,et al.  New Approaches for Virtual Private Network Design , 2005, SIAM J. Comput..

[157]  Matteo Fischetti,et al.  Optimizing over the first Chvátal closure , 2005, Math. Program..

[158]  Nikolaos V. Sahinidis,et al.  Accelerating Branch-and-Bound through a Modeling Language Construct for Relaxation-Specific Constraints , 2005, J. Glob. Optim..

[159]  S. Fomin,et al.  Root systems and generalized associahedra , 2005, math/0505518.

[160]  Naveen Garg,et al.  Saving an epsilon: a 2-approximation for the k-MST problem in graphs , 2005, STOC '05.

[161]  Sanjeev Arora,et al.  Towards Strong Nonapproximability Results in the Lovász-Schrijver Hierarchy , 2005, STOC '05.

[162]  Masakazu Kojima,et al.  Sparsity in sums of squares of polynomials , 2005, Math. Program..

[163]  George L. Nemhauser,et al.  A polyhedral study of nonconvex quadratic programs with box constraints , 2005, Math. Program..

[164]  Joseph Naor,et al.  On the approximability of some network design problems , 2005, SODA '05.

[165]  Luca Becchetti,et al.  Sharing the cost more efficiently: improved approximation for multicommodity rent-or-buy , 2005, SODA '05.

[166]  Friedrich Eisenbrand,et al.  An improved approximation algorithm for virtual private network design , 2005, SODA '05.

[167]  M. Caramia,et al.  Bounding vertex coloring by truncated multistage branch and bound , 2004, Networks.

[168]  James Demmel,et al.  Minimizing Polynomials via Sum of Squares over the Gradient Ideal , 2004, Math. Program..

[169]  Piotr Sankowski,et al.  Maximum matchings via Gaussian elimination , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[170]  Piotr Sankowski,et al.  Maximum matchings in planar graphs via gaussian elimination , 2004, Algorithmica.

[171]  Paul G. Spirakis,et al.  Direct routing: Algorithms and complexity , 2004, Algorithmica.

[172]  László Lovász,et al.  Approximating Min Sum Set Cover , 2004, Algorithmica.

[173]  Amit Kumar,et al.  Maximum Coverage Problem with Group Budget Constraints and Applications , 2004, APPROX-RANDOM.

[174]  R. Ravi,et al.  Min-max tree covers of graphs , 2004, Oper. Res. Lett..

[175]  Sanjeev Arora,et al.  Expander flows, geometric embeddings and graph partitioning , 2004, STOC '04.

[176]  Daniel Bienstock,et al.  Tree-width and the Sherali-Adams operator , 2004, Discret. Optim..

[177]  Francisco Barahona,et al.  Fractional Packing of T-Joins , 2004, SIAM J. Discret. Math..

[178]  Zeger Degraeve,et al.  Improved lower bounds for the capacitated lot sizing problem with setup times , 2004, Oper. Res. Lett..

[179]  T. Koch.  The final NETLIB-LP results , 2004, Oper. Res. Lett..

[180]  Arnold Neumaier,et al.  Safe bounds in linear and mixed-integer linear programming , 2004, Math. Program..

[181]  Graciela L. Nasini,et al.  Lift and project relaxations for the matching and related polytopes , 2004, Discret. Appl. Math..

[182]  Ümit V. Çatalyürek,et al.  Permuting Sparse Rectangular Matrices into Block-Diagonal Form , 2004, SIAM J. Sci. Comput..

[183]  József Solymosi,et al.  One line and n points , 2003, STOC.

[184]  David R. Karger,et al.  Approximation algorithms for orienteering and discounted-reward TSP , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[185]  Toniann Pitassi,et al.  Rank bounds and integrality gaps for cutting planes procedures , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[186]  Bart Selman,et al.  Backdoors To Typical Case Complexity , 2003, IJCAI.

[187]  András A. Benczúr,et al.  Pushdown-reduce: an algorithm for connectivity augmentation and poset covering problems , 2003, Discret. Appl. Math..

[188]  R. Vohra,et al.  Combinatorial Auctions: A Survey , 2003, INFORMS J. Comput..

[189]  Martin Skutella,et al.  Multicommodity flows over time: Efficient algorithms and complexity , 2003, Theor. Comput. Sci..

[190]  Satish Rao,et al.  A tight bound on approximating arbitrary metrics by tree metrics , 2003, STOC '03.

[191]  Robert Krauthgamer,et al.  Polylogarithmic inapproximability , 2003, STOC '03.

[192]  Pablo A. Parrilo,et al.  Semidefinite programming relaxations for semialgebraic problems , 2003, Math. Program..

[193]  Gloria Pérez,et al.  An O(n log n) procedure for identifying facets of the knapsack polytope , 2003, Oper. Res. Lett..

[194]  Stéphan Ceroi,et al.  A Weighted Version of the Jump Number Problem on Two-Dimensional Orders is NP-Complete , 2003, Order.

[195]  Martin Skutella,et al.  Minimum cost flows over time without intermediate storage , 2003, SODA '03.

[196]  Satish Rao,et al.  The k-traveling repairman problem , 2003, SODA '03.

[197]  Kurt Mehlhorn,et al.  Certifying and repairing solutions to large LPs how good are LP-solvers? , 2003, SODA '03.

[198]  Judith Keijsper,et al.  A Vizing-type theorem for matching forests , 2003, Discret. Math..

[199]  P. Parrilo,et al.  Symmetry groups, semidefinite programs, and sums of squares , 2002, math/0211450.

[200]  Béla Bollobás,et al.  Proving integrality gaps without knowing the linear program , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[201]  Nikolaos V. Sahinidis,et al.  Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming , 2002 .

[202]  Franz Rendl,et al.  Computational Experience with Stable Set Relaxations , 2002, SIAM J. Optim..

[203]  Torsten Fahle,et al.  Simple and Fast: Improving a Branch-And-Bound Algorithm for Maximum Clique , 2002, ESA.

[204]  Arnold L. Rosenberg,et al.  Scheduling Time-Constrained Communication in Linear Networks , 2002, SPAA '98.

[205]  Adrian Vetta,et al.  The Demand Matching Problem , 2002, IPCO.

[206]  Sylvia C. Boyd,et al.  Finding the Exact Integrality Gap for Small Traveling Salesman Problems , 2002, Math. Oper. Res..

[207]  Robert D. Carr,et al.  Randomized metarounding , 2002, Random Struct. Algorithms.

[208]  Jean B. Lasserre,et al.  Semidefinite Programming vs. LP Relaxations for Polynomial Programming , 2002, Math. Oper. Res..

[209]  Etienne de Klerk,et al.  Approximation of the Stability Number of a Graph via Copositive Programming , 2002, SIAM J. Optim..

[210]  Jean B. Lasserre,et al.  An Explicit Equivalent Positive Semidefinite Program for Nonlinear 0-1 Programs , 2002, SIAM J. Optim..

[211]  Marek Karpinski,et al.  Approximability of dense and sparse instances of minimum 2-connectivity, TSP and path problems , 2002, SODA '02.

[212]  Reuven Bar-Yehuda,et al.  Scheduling split intervals , 2002, SODA '02.

[213]  Moses Charikar,et al.  On semidefinite programming relaxations for graph coloring and vertex cover , 2002, SODA '02.

[214]  Gérard Cornuéjols,et al.  On the Rank of Mixed 0, 1 Polyhedra , 2001, IPCO.

[215]  Jean B. Lasserre,et al.  An Explicit Exact SDP Relaxation for Nonlinear 0-1 Programs , 2001, IPCO.

[216]  R. Ravi,et al.  On the Integrality Gap of a Natural Formulation of the Single-Sink Buy-at-Bulk Network Design Problem , 2001, IPCO.

[217]  A. Ben-Tal,et al.  Lectures on modern convex optimization - analysis, algorithms, and engineering applications , 2001, MPS-SIAM series on optimization.

[218]  Arkadi Nemirovski,et al.  On Polyhedral Approximations of the Second-Order Cone , 2001, Math. Oper. Res..

[219]  Satoru Iwata,et al.  Combinatorial relaxation algorithm for mixed polynomial matrices , 2001, Math. Program..

[220]  Renato F. Werneck,et al.  Dual Heuristics on the Exact Solution of Large Steiner Problems , 2001, Electron. Notes Discret. Math..

[221]  Miguel J. Bagajewicz,et al.  A review of recent design procedures for water networks in refineries and process plants , 2000 .

[222]  R. Ravi,et al.  A polylogarithmic approximation algorithm for the group Steiner tree problem , 2000, SODA '98.

[223]  Josef Kallrath,et al.  Mixed Integer Optimization in the Chemical Process Industry: Experience, Potential and Future Perspectives , 2000 .

[224]  Marcin Jurdzinski,et al.  A Discrete Strategy Improvement Algorithm for Solving Parity Games , 2000, CAV.

[225]  Kent D. Wilken,et al.  Optimal instruction scheduling using integer programming , 2000, PLDI '00.

[226]  Joseph Naor,et al.  Resource optimization in QoS multicast routing of real-time multimedia , 2000, IEEE/ACM Transactions on Networking.

[227]  Jean B. Lasserre,et al.  Global Optimization with Polynomials and the Problem of Moments , 2000, SIAM J. Optim..

[228]  Robert D. Carr,et al.  Strengthening integrality gaps for capacitated network design and covering problems , 2000, SODA '00.

[229]  Alex Zelikovsky,et al.  Improved Steiner tree approximation in graphs , 2000, SODA '00.

[230]  Kazuo Murota,et al.  Matrices and Matroids for Systems Analysis , 2000 .

[231]  Martin W. P. Savelsbergh,et al.  Lifted flow cover inequalities for mixed 0-1 integer programs , 1999, Math. Program..

[232]  Friedrich Eisenbrand,et al.  Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube , 1999, IPCO.

[233]  S. Khanna,et al.  Time-constrained scheduling of weighted packets on trees and meshes , 1999, SPAA '99.

[234]  Michael Plantholt,et al.  A sublinear bound on the chromatic index of multigraphs , 1999, Discret. Math..

[235]  Patric R. J. Östergård,et al.  A New Algorithm for the Maximum-Weight Clique Problem , 1999, Electron. Notes Discret. Math..

[236]  Steven Skiena,et al.  Optimizing combinatorial library construction via split synthesis , 1999, RECOMB.

[237]  Friedhelm Meyer auf der Heide,et al.  Shortest-Path Routing in Arbitrary Networks , 1999, J. Algorithms.

[238]  András Frank,et al.  Finding Minimum Generators of Path Systems' , 1999, J. Comb. Theory, Ser. B.

[239]  J. Håstad.  Clique is hard to approximate withinn1−ε , 1999 .

[240]  Joseph S. B. Mitchell.  Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems , 1999, SIAM J. Comput..

[241]  R. Borndörfer,et al.  Aspects of Set Packing, Partitioning, and Covering , 1998 .

[242]  Vipin Kumar,et al.  A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs , 1998, SIAM J. Sci. Comput..

[243]  E. Balas.  Disjunctive Programming: Properties of the Convex Hull of Feasible Points , 1998, Discret. Appl. Math..

[244]  Kamal Jain,et al.  A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[245]  H. Sherali,et al.  Enumeration Approach for Linear Complementarity Problems Based on a Reformulation-Linearization Technique , 1998 .

[246]  Thorsten Koch,et al.  Solving Steiner tree problems in graphs to optimality , 1998, Networks.

[247]  Sanjeev Arora,et al.  Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems , 1998, JACM.

[248]  S. Guha,et al.  Rounding via trees: deterministic approximation algorithms for group Steiner trees and k-median , 1998, STOC '98.

[249]  Christian Scheideler,et al.  Universal Routing Strategies for Interconnection Networks , 1998, Lecture Notes in Computer Science.

[250]  Miriam Di Ianni,et al.  Efficient Delay Routing , 1998, Theor. Comput. Sci..

[251]  Karen Aardal,et al.  Capacitated facility location: Separation algorithms and computational experience , 1998, Math. Program..

[252]  Edward C. Sewell,et al.  A Branch and Bound Algorithm for the Stability Number of a Sparse Graph , 1998, INFORMS J. Comput..

[253]  Luís Gouveia,et al.  Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints , 1998, INFORMS J. Comput..

[254]  Martin W. P. Savelsbergh,et al.  An Updated Mixed Integer Programming Library: MIPLIB 3.0 , 1998 .

[255]  Gerhard J. Woeginger,et al.  There is no Asymptotic PTAS for Two-Dimensional Vector Packing , 1997, Inf. Process. Lett..

[256]  Kazuo Murota,et al.  CHARACTERIZING A VALUATED DELTA-MATROID AS A FAMILY OF DELTA-MATROIDS* , 1997 .

[257]  Michael C. Ferris,et al.  Engineering and Economic Applications of Complementarity Problems , 1997, SIAM Rev..

[258]  Mohit Singh,et al.  Approximation Algorithms , 1997, Encyclopedia of Algorithms.

[259]  Yossi Azar,et al.  Buy-at-bulk network design , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[260]  Masakazu Kojima,et al.  Semidefinite Programming Relaxation for Nonconvex Quadratic Programs , 1997, J. Glob. Optim..

[261]  Hanif D. Sherali,et al.  Comparison of Two Reformulation-Linearization Technique Based Linear Programming Relaxations for Polynomial Programming Problems , 1997, J. Glob. Optim..

[262]  Aravind Srinivasan,et al.  A constant-factor approximation algorithm for packet routing, and balancing local vs. global criteria , 1997, STOC '97.

[263]  Piotr Berman,et al.  On-line algorithms for Steiner tree problems (extended abstract) , 1997, STOC '97.

[264]  Rafail Ostrovsky,et al.  Universal O(congestion + dilation + log1+εN) local control packet switching algorithms , 1997, STOC '97.

[265]  Alex Zelikovsky,et al.  A series of approximation algorithms for the acyclic directed steiner tree problem , 1997, Algorithmica.

[266]  Robert Weismantel,et al.  On the 0/1 knapsack polytope , 1997, Math. Program..

[267]  Jérôme Amilhastre,et al.  Computing a minimum biclique cover is polynomial for bipartite domino-free graphs , 1997, SODA '97.

[268]  Cristina G. Fernandes.  A better approximation ratio for the minimum k-edge-connected spanning subgraph problem , 1997, SODA '97.

[269]  Kazuo Murota,et al.  Valuated Matroid Intersection I: Optimality Criteria , 1996, SIAM J. Discret. Math..

[270]  Michael A. Trick,et al.  A Column Generation Approach for Graph Coloring , 1996, INFORMS J. Comput..

[271]  Jeff Kahn,et al.  Asymptotics of the Chromatic Index for Multigraphs , 1996, J. Comb. Theory, Ser. B.

[272]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[273]  Carla D. Savage,et al.  Balanced Gray Codes , 1996, Electron. J. Comb..

[274]  Yuval Rabani,et al.  Distributed packet switching in arbitrary networks , 1996, STOC '96.

[275]  U. Feige.  A threshold of ln n for approximating set cover (preliminary version) , 1996, STOC '96.

[276]  Egon Balas,et al.  Gomory cuts revisited , 1996, Oper. Res. Lett..

[277]  Satoru Iwata,et al.  Primal-Dual Combinatorial Relaxation Algorithms for the Maximum Degree of Subdeterminants , 1996, SIAM J. Sci. Comput..

[278]  Donald E. Knuth.  Irredundant intervals , 1996, JEAL.

[279]  Haiko Müller,et al.  On edge perfectness and classes of bipartite graphs , 1996, Discret. Math..

[280]  Matthias F. Stallmann,et al.  Some Approximation Results in Multicasting , 1996 .

[281]  S. Thomas McCormick,et al.  A polynomial algorithm for abstract maximum flow , 1996, SODA '96.

[282]  Jon M. Kleinberg,et al.  An improved approximation ratio for the minimum latency problem , 1996, SODA '96.

[283]  I. Grossmann,et al.  Global optimization of bilinear process networks with multicomponent flows , 1995 .

[284]  Christos H. Papadimitriou,et al.  An approximation scheme for planar graph TSP , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[285]  S. Khuller,et al.  Balancing minimum spanning trees and shortest-path trees , 1995, Algorithmica.

[286]  Leon S. Lasdon,et al.  The Evolution of Texaco's Blending Systems: From OMEGA to StarBlend , 1995 .

[287]  Fillia Makedon,et al.  A 2n−2 step algorithm for routing in ann ×n array with constant-size queues , 1995, SPAA '89.

[288]  András Frank,et al.  Minimal Edge-Coverings of Pairs of Sets , 1995, J. Comb. Theory B.

[289]  Kazuo Murota,et al.  Computing the Degree of Determinants Via Combinatorial Relaxation , 1995, SIAM J. Comput..

[290]  Kazuo Murota,et al.  Combinatorial relaxation algorithm for the maximum degree of subdeterminants: Computing Smith-Mcmillan form at infinity and structural indices in Kronecker form , 1995, Applicable Algebra in Engineering, Communication and Computing.

[291]  Vasek Chvátal,et al.  Resolution Search , 1995, Discret. Appl. Math..

[292]  Alexandr V. Kostochka,et al.  A Characterization of Seymour Graphs , 1995, IPCO.

[293]  R. Raz.  A parallel repetition theorem , 1995, STOC '95.

[294]  Boaz Patt-Shamir,et al.  Many-to-one packet routing on grids , 1995, STOC '95.

[295]  Martin E. Dyer,et al.  The Worst-Case Running Time of the Random Simplex Algorithm is Exponential in the Height , 1995, Inf. Process. Lett..

[296]  D. Karger,et al.  Random sampling in graph optimization problems , 1995 .

[297]  Éva Tardos,et al.  “The quickest transshipment problem” , 1995, SODA '95.

[298]  Bruce M. Maggs,et al.  Fast Algorithms for Finding O(Congestion + Dilation) Packet Routing Schedules , 1995, Proceedings of the Twenty-Eighth Annual Hawaii International Conference on System Sciences.

[299]  Bernd Gärtner,et al.  Randomized Simplex Algorithms on Klee-Minty Cubes , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[300]  Carsten Lund,et al.  On the hardness of approximating minimization problems , 1994, JACM.

[301]  Elias Dahlhaus,et al.  The Computation of the Jump Number of Convex Graphs , 1994, ORDAL.

[302]  Madhu Sudan,et al.  The minimum latency problem , 1994, STOC '94.

[303]  Luitpold Babel,et al.  A fast algorithm for the maximum weight clique problem , 1994, Computing.

[304]  Egon Balas,et al.  Polyhedral methods for the maximum clique problem , 1994, Cliques, Coloring, and Satisfiability.

[305]  Andrew V. Goldberg,et al.  Improved approximation algorithms for network design problems , 1994, SODA '94.

[306]  W. Wenzel.  Δ-matroids with the strong exchange conditions , 1993 .

[307]  Zoltán Füredi,et al.  On the fractional matching polytope of a hypergraph , 1993, Comb..

[308]  George C. Polyzos,et al.  Multicast routing for multimedia communication , 1993, TNET.

[309]  Michel X. Goemans,et al.  Survivable networks, linear programming relaxations and the parsimonious property , 1993, Math. Program..

[310]  E. Balas,et al.  A lift-and-project cutting plane algorithm for mixed 0–1 programs , 1993, Math. Program..

[311]  Maurice Queyranne,et al.  Structure of a simple scheduling polyhedron , 1993, Math. Program..

[312]  Mihalis Yannakakis,et al.  The Traveling Salesman Problem with Distances One and Two , 1993, Math. Oper. Res..

[313]  Carsten Lund,et al.  Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[314]  Sanguthevar Rajasekaran,et al.  Randomised algorithms for packet routing on the mesh , 1992 .

[315]  Micha Sharir,et al.  A subexponential bound for linear programming , 1992, SCG '92.

[316]  Gil Kalai,et al.  A subexponential randomized simplex algorithm (extended abstract) , 1992, STOC '92.

[317]  Bert Gerards,et al.  On shortest T-joins and packing T-cuts , 1992, J. Comb. Theory B.

[318]  Heiner Fauck,et al.  Covering Polygons with Rectangles via Edge Coverings of Bipartite Permutation Graphs , 1991, J. Inf. Process. Cybern..

[319]  Mihalis Yannakakis,et al.  Expressing combinatorial optimization problems by linear programs , 1991, STOC '88.

[320]  Erich Kaltofen,et al.  On fast multiplication of polynomials over arbitrary algebras , 1991, Acta Informatica.

[321]  David Goldberg,et al.  What every computer scientist should know about floating-point arithmetic , 1991, CSUR.

[322]  R. Ravi,et al.  When trees collide: an approximation algorithm for the generalized Steiner problem on networks , 1991, STOC '91.

[323]  Laurence A. Wolsey,et al.  Valid inequalities for 0-1 knapsacks and mips with generalised upper bound constraints , 1990, Discret. Appl. Math..

[324]  Bezalel Gavish,et al.  Technical Note - Heuristics for Delivery Problems with Constant Error Guarantees , 1990, Transp. Sci..

[325]  David P. Williamson,et al.  Analyzing the Held-Karp TSP Bound: A Monotonicity Property with Application , 1990, Inf. Process. Lett..

[326]  Baruch Awerbuch,et al.  Cost-sensitive analysis of communication protocols , 1990, PODC '90.

[327]  Kazuo Murota,et al.  Computing Puiseux-Series Solutions to Determinantal Equations via Combinatorial Relaxation , 1990, SIAM J. Comput..

[328]  William J. Cook,et al.  Chvátal closures for mixed integer programming problems , 1990, Math. Program..

[329]  Anna Lubiw,et al.  A weighted min-max relation for intervals , 1990, J. Comb. Theory, Ser. B.

[330]  Haiko Müller,et al.  Alternating cycle-free matchings , 1990 .

[331]  Ronald L. Rardin,et al.  Polyhedral Characterization of Discrete Dynamic Programming , 1990, Oper. Res..

[332]  Andreas Brandstädt,et al.  The Jump Number Problem for Biconvex Graphs and Rectangle Covers of Rectangular Regions , 1989, FCT.

[333]  William J. Cook,et al.  On cutting-plane proofs in combinatorial optimization , 1989 .

[334]  Leon S. Lasdon,et al.  OMEGA: An Improved Gasoline Blending System for Texaco , 1989 .

[335]  András Frank,et al.  Generalized polymatroids and submodular flows , 1988, Math. Program..

[336]  George Steiner,et al.  A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders , 1987 .

[337]  William J. Cook,et al.  On the complexity of cutting-plane proofs , 1987, Discret. Appl. Math..

[338]  Jan Karel Lenstra,et al.  Approximation algorithms for scheduling unrelated parallel machines , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[339]  André Bouchet,et al.  Greedy algorithm and symmetric matroids , 1987, Math. Program..

[340]  B. Gavish,et al.  Heuristics for unequal weight delivery problems with a fixed error guarantee , 1987 .

[341]  Laurence A. Wolsey,et al.  Solving Mixed Integer Programming Problems Using Automatic Reformulation , 1987, Oper. Res..

[342]  A. Schrijver.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[343]  Timothy F. Havel,et al.  Some Combinatorial Properties of Discriminants in Metric Vector Spaces , 1986 .

[344]  Daniel J. Kleitman,et al.  An Algorithm for Covering Polygons with Rectangles , 1986, Inf. Control..

[345]  Egon Balas,et al.  Finding a Maximum Clique in an Arbitrary Graph , 1986, SIAM J. Comput..

[346]  N. Biggs.  THE TRAVELING SALESMAN PROBLEM A Guided Tour of Combinatorial Optimization , 1986 .

[347]  Yahya Fathi,et al.  Affirmative action algorithms , 1986, Math. Program..

[348]  Alexander H. G. Rinnooy Kan,et al.  Bounds and Heuristics for Capacitated Routing Problems , 1985, Math. Oper. Res..

[349]  Laurence A. Wolsey,et al.  Valid Linear Inequalities for Fixed Charge Problems , 1985, Oper. Res..

[350]  M. Iri,et al.  Structural solvability of systems of equations —A mathematical formulation for distinguishing accurate and inaccurate numbers in structural analysis of systems— , 1985 .

[351]  Ervin Györi,et al.  A minimax theorem on intervals , 1984, J. Comb. Theory, Ser. B.

[352]  Rick Giles,et al.  Optimum matching forests I: Special weights , 1982, Math. Program..

[353]  Rick Giles,et al.  Optimum matching forests III: Facets of matching forest polyhedra , 1982, Math. Program..

[354]  Rick Giles,et al.  Optimum matching forests II: General weights , 1982, Math. Program..

[355]  Richard M. Karp,et al.  An efficient approximation scheme for the one-dimensional bin-packing problem , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[356]  G. S. Lueker,et al.  Bin packing can be solved within 1 + ε in linear time , 1981 .

[357]  D. Kleitman,et al.  Covering Regions by Rectangles , 1981 .

[358]  Robert J. Fowler,et al.  Optimal Packing and Covering in the Plane are NP-Complete , 1981, Inf. Process. Lett..

[359]  Paul D. Seymour,et al.  Decomposition of regular matroids , 1980, J. Comb. Theory, Ser. B.

[360]  Norman Zadeh.  What is the Worst Case Behavior of the Simplex Algorithm , 1980 .

[361]  László Lovász,et al.  Matroid matching and some applications , 1980, J. Comb. Theory, Ser. B.

[362]  Thomas Kailath,et al.  Rational matrix structure , 1979, 1979 18th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes.

[363]  Martin Grötschel,et al.  On the symmetric travelling salesman problem II: Lifting theorems and facets , 1979, Math. Program..

[364]  Martin Grötschel,et al.  On the symmetric travelling salesman problem I: Inequalities , 1979, Math. Program..

[365]  William Y. Sit,et al.  Worst case behavior of the steepest edge simplex method , 1979, Discret. Appl. Math..

[366]  Vasek Chvátal,et al.  A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..

[367]  Daniel Brélaz,et al.  New methods to color the vertices of a graph , 1979, CACM.

[368]  Dana S. Nau,et al.  A mathematical analysis of human leukocyte antigen serology , 1978 .

[369]  Paul D. Seymour,et al.  The matroids with the max-flow min-cut property , 1977, J. Comb. Theory B.

[370]  Eugene L. Lawler,et al.  Fast approximation algorithms for knapsack problems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[371]  David S. Johnson,et al.  The Planar Hamiltonian Circuit Problem is NP-Complete , 1976, SIAM J. Comput..

[372]  Garth P. McCormick,et al.  Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems , 1976, Math. Program..

[373]  Chul E. Kim,et al.  Approximation algorithms for some routing problems , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[374]  Oscar H. Ibarra,et al.  Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems , 1975, JACM.

[375]  L. Lovász.  2-Matchings and 2-covers of hypergraphs , 1975 .

[376]  Alan J. Hoffman,et al.  A generalization of max flow—min cut , 1974, Math. Program..

[377]  Ludwig Nastansky,et al.  Cost-minimal trees in directed acyclic graphs , 1974, Z. Oper. Research.

[378]  James S. Thorp,et al.  The singular pencil of a linear dynamical system , 1973 .

[379]  C. Burdet,et al.  On cutting planes , 1973 .

[380]  Vasek Chvátal,et al.  Edmonds polytopes and a hierarchy of combinatorial problems , 1973, Discret. Math..

[381]  Robert G. Jeroslow,et al.  The simplex algorithm with the pivot rule of maximizing criterion improvement , 1973, Discret. Math..

[382]  Erwin H. Bareiss,et al.  Computational Solutions of Matrix Problems Over an Integral Domain , 1972 .

[383]  D. R. Fulkerson,et al.  Blocking and anti-blocking pairs of polyhedra , 1971, Math. Program..

[384]  G. Ribiere,et al.  Experiments in mixed-integer linear programming , 1971, Math. Program..

[385]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[386]  V. Klee,et al.  HOW GOOD IS THE SIMPLEX ALGORITHM , 1970 .

[387]  E. Bareiss.  Sylvester’s identity and multistep integer-preserving Gaussian elimination , 1968 .

[388]  J. E. Kelley,et al.  The Cutting-Plane Method for Solving Convex Programs , 1960 .

[389]  R. Howard.  Dynamic Programming and Markov Processes , 1960 .

[390]  Ted K. Ralphs,et al.  Integer and Combinatorial Optimization , 2013 .

[391]  Anupam Gupta.  Approximation Algorithms for VRP with Stochastic Demands , 2012 .

[392]  André Raspaud,et al.  Decomposing a graph into forests , 2012, J. Comb. Theory, Ser. B.

[393]  Miguel F. Anjos,et al.  Second-Order Cone Relaxations for Binary Quadratic Polynomial Programs , 2011, SIAM J. Optim..

[394]  Eric V. Denardo,et al.  Flows in Networks , 2011 .

[395]  Ralph E. Gomory,et al.  Outline of an Algorithm for Integer Solutions to Linear Programs and An Algorithm for the Mixed Integer Problem , 2010, 50 Years of Integer Programming.

[396]  Thomas Dueholm Hansen,et al.  Subexponential lower bounds for randomized pivoting rules for solving linear programs , 2010 .

[397]  Rong Qu,et al.  A hybrid scatter search meta-heuristic for delay-constrained multicast routing problems , 2010, Applied Intelligence.

[398]  Konstantinos Georgiou,et al.  The Sherali-Adams System Applied to Vertex Cover: Why Borsuk Graphs Fool Strong LPs and some Tight Integrality Gaps for SDPs , 2010, Electron. Colloquium Comput. Complex..

[399]  William J. Cook,et al.  Topics in exact precision mathematical programming , 2010 .

[400]  Paolo Toth,et al.  A survey on vertex coloring problems , 2010, Int. Trans. Oper. Res..

[401]  Mohit Tawarmalani,et al.  Inclusion Certificates and Simultaneous Convexification of Functions , 2010 .

[402]  Christodoulos A. Floudas,et al.  ADVANCES FOR THE POOLING PROBLEM: MODELING, GLOBAL OPTIMIZATION, AND COMPUTATIONAL STUDIES , 2009 .

[403]  Ying XuRong Qu,et al.  A GRASP approach for the delay-constrained multicast routing problem , 2009 .

[404]  Masakazu Muramatsu,et al.  A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones , 2009, Comput. Optim. Appl..

[405]  R. Ravi,et al.  Approximation algorithms for sequencing problems , 2009 .

[406]  Rishi Saket,et al.  SDP Integrality Gaps with Local̀ 1-Embeddability Subhash Khot , 2009 .

[407]  Richard Weber.  Dynamic Programming and Optimal Control Problem Set: Deterministic Systems and the Shortest Path Problem , 2008 .

[408]  David P. Williamson,et al.  A Faster, Better Approximation Algorithm for the Minimum Latency Problem , 2008, SIAM J. Comput..

[409]  Deeparnab Chakrabarty,et al.  Knapsack Problems , 2008 .

[410]  Guy Kortsarz,et al.  Approximating Minimum-Cost Connectivity Problems , 2007, Handbook of Approximation Algorithms and Metaheuristics.

[411]  Marek Karpinski,et al.  8 = 7-Approximation Algorithm for (1,2)-TSP (cid:3) (Extended Version) , 2006 .

[412]  Illya V. Hicks,et al.  Combinatorial Branch-and-Bound for the Maximum Weight Independent Set Problem , 2006 .

[413]  Laurence A. Wolsey,et al.  Approximate extended formulations , 2006, Math. Program..

[414]  Nil. I. Fcbniary.  ON THE MATRIX-CUT RANK OF POLYHEDRA , 2005 .

[415]  Masakazu Muramatsu,et al.  SparsePOP: a Sparse Semidefinite Programming Relaxation of Polynomial Optimization Problems , 2005 .

[416]  Masakazu Muramatsu,et al.  Sums of Squares and Semidefinite Programming Relaxations for Polynomial Optimization Problems with Structured Sparsity , 2004 .

[417]  Clifford Stein,et al.  Approximating disjoint-path problems using packing integer programs , 2004, Math. Program..

[418]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[419]  Monique Laurent,et al.  A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0-1 Programming , 2003, Math. Oper. Res..

[420]  P. Parrilo.  An explicit construction of distinguished representations of polynomials nonnegative over finite sets , 2002 .

[421]  Tetsuya Fujie,et al.  On grötschel-lovász-schrijver's relaxation of stable set polytopes , 2002 .

[422]  C. Lemaréchal,et al.  SDP Relaxations in Combinatorial Optimization from a Lagrangian Viewpoint , 2001 .

[423]  Jorge J. Moré,et al.  Benchmarking optimization software with performance profiles , 2001, Math. Program..

[424]  Sudipto Guha,et al.  Approximation algorithms for facility location problems , 2000 .

[425]  Piercar Nicola,et al.  Linear Programming and Extensions , 2000 .

[426]  Stéphan Ceroi.  Ordres et géométrie plane : application au nombre de sauts , 2000 .

[427]  Alexander Schrijver,et al.  Total Dual Integrality of Matching Forest Constraints , 2000, Comb..

[428]  A. Storjohann.  Algorithms for matrix canonical forms , 2000 .

[429]  P. Parrilo.  Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization , 2000 .

[430]  R. Saigal,et al.  Handbook of semidefinite programming : theory, algorithms, and applications , 2000 .

[431]  András Frank,et al.  Increasing the rooted-connectivity of a digraph by one , 1999, Math. Program..

[432]  Satoru Iwata,et al.  Computing the Maximum Degree of Minors in Matrix Pencils via Combinatorial Relaxation , 1999, SODA '99.

[433]  Luis Gouveia,et al.  Using Hop-Indexed Models For Constrained Spanning and Steiner Tree Models , 1999 .

[434]  Michael C. Ferris,et al.  Partitioning mathematical programs for parallel solution , 1998, Math. Program..

[435]  Kazuo Murota,et al.  On the Degree of Mixed Polynomial Matrices , 1998, SIAM J. Matrix Anal. Appl..

[436]  Philip N. Klein,et al.  A polynomial-time approximation scheme for weighted planar graph TSP , 1998, SODA '98.

[437]  Paul G. Spirakis,et al.  Graph Properties that Facilitate Travelling , 1998, Electron. Colloquium Comput. Complex..

[438]  S. Guha,et al.  Greedy strikes back: improved facility location algorithms , 1998, SODA '98.

[439]  Nilay Shah,et al.  Mathematical programming techniques for crude oil scheduling , 1996 .

[440]  M. R. Rao,et al.  Combinatorial Optimization , 1992, NATO ASI Series.

[441]  Alexander Schrijver,et al.  Cones of Matrices and Set-Functions and 0-1 Optimization , 1991, SIAM J. Optim..

[442]  Walter Wenzel,et al.  A greedy-algorithm characterization of valuated Δ-matroids , 1991 .

[443]  Egon Balas,et al.  Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs , 1991, SIAM J. Comput..

[444]  Hanif D. Sherali,et al.  A Hierarchy of Relaxations Between the Continuous and Convex Hull Representations for Zero-One Programming Problems , 1990, SIAM J. Discret. Math..

[445]  András Sebö,et al.  Undirected distances and the postman-structure of graphs , 1990, J. Comb. Theory, Ser. B.

[446]  André Bouchet,et al.  Matchings and -matroids , 1989, Discret. Appl. Math..

[447]  室田 一雄.  Systems analysis by graphs and matroids : structural solvability and controllability , 1987 .

[448]  N. Z. Shor.  Class of global minimum bounds of polynomial functions , 1987 .

[449]  János Komlós,et al.  Sorting in c log n parallel sets , 1983, Comb..

[450]  A. Hoffman,et al.  Lattice Polyhedra II: Generalization, Constructions and Examples , 1982 .

[451]  P. Seymour.  On Odd Cuts and Plane Multicommodity Flows , 1981 .

[452]  William R. Pulleyblank,et al.  Matchings in regular graphs , 1981, Discret. Math..

[453]  Nobuji Saito,et al.  NP-Completeness of the Hamiltonian Cycle Problem for Bipartite Graphs , 1980 .

[454]  L. Wolsey.  Heuristic analysis, linear programming and branch and bound , 1980 .

[455]  László Lovász,et al.  On the Shannon capacity of a graph , 1979, IEEE Trans. Inf. Theory.

[456]  W. Cunningham,et al.  A primal algorithm for optimum matching , 1978 .

[457]  Robert G. Jeroslow,et al.  Cutting-Planes for Complementarity Constraints , 1978 .

[458]  A. Hoffman.  On lattice polyhedra III: Blockers and anti-blockers of lattice clutters , 1978 .

[459]  V. Chvátal,et al.  Notes on Bland’s pivoting rule , 1978 .

[460]  E. Balas,et al.  Facets of the Knapsack Polytope From Minimal Covers , 1978 .

[461]  J. Orlin.  Contentment in graph theory: Covering graphs with cliques , 1977 .

[462]  J. Edmonds,et al.  A Min-Max Relation for Submodular Functions on Graphs , 1977 .

[463]  J. Krarup,et al.  Plant location, Set Covering and Economic Lot Size: An 0 (mn)-Algorithm for Structured Problems , 1977 .

[464]  László Lovász,et al.  On the ratio of optimal integral and fractional covers , 1975, Discret. Math..

[465]  Harold Neil Gabow,et al.  Implementation of algorithms for maximum matching on nonbipartite graphs , 1973 .

[466]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[467]  S. E. Dreyfus,et al.  The steiner problem in graphs , 1971, Networks.

[468]  Peter Lancaster,et al.  The theory of matrices , 1969 .

[469]  J. Edmonds.  Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.

[470]  Jack Edmonds,et al.  Maximum matching and a polyhedron with 0,1-vertices , 1965 .

[471]  C. Nash-Williams.  Decomposition of Finite Graphs Into Forests , 1964 .

[472]  D. R. Fulkerson,et al.  Maximal Flow Through a Network , 1956, Canadian Journal of Mathematics.

[473]  Jan Mycielski.  Sur le coloriage des graphs , 1955 .

[474]  P. Erdos-L Lovász.  Problems and Results on 3-chromatic Hypergraphs and Some Related Questions , 2022 .

[475]  Evangelos Markakis,et al.  Integrality Gaps of Semidefinite Programs for Vertex Cover and Relations to 1 Embeddability of Negative Type Metrics , 2022 .

[476]  A. Naor,et al.  integrality gap for the Sparsest Cut SDP , 2022 .