OPTIMA Mathematical Optimization Society Newsletter 84

June 15, 2018. The ISMP in Bordeaux is only a few weeks away when I write this column. I am looking forward to the opening session with some appropriate tension! But, I am sure that the wine tasting on Sunday, meeting up with all colleagues, some of whom I have not seen since Pittsburgh, will make everything fall into place. It has been a hectic winter and spring, but when I see how many people are involved in the whole process of making the symposium a success, I am humbled. The organizers and program committee have been busy over a long period. But we have also had seven juries working hard on selecting the prize winners, the Publications Committee searching for new editors, and the Executive Committee helping out with a lot of practical issues. MOS is a society ran by volunteers and I am very grateful to all of you who invest considerable time in the activities of the Society! A BIG thank you to you all! Since the last column we have new Editors-in-Chief for MPA and MPB. Jon Lee succeeded Alexander Shapiro as E-i-C for MPA, and Sven Leyffer succeeded Jong-Shi Pang as E-i-C for MPB. Both journals are in great shape and are for many of us the first choice as scientific outlet. This OPTIMA issue is also the last issue edited by Volker, Sam, Jeff, and Christoph as a team, since Volker, Sam, and Jeff step down. You have given us a series of really interesting newsletters that are very much valued. Thanks to all our editors and their boards, and good luck to the new teams! See you in Bordeaux! Karen Aardal Delft Institute of Applied Mathematics k.i.aardal@tudelft.nl

[1]  Jean-Louis Goffin,et al.  On the non-polynomiality of the relaxation method for systems of linear inequalities , 1982, Math. Program..

[2]  Tamás Terlaky,et al.  Central Path Curvature and Iteration-Complexity for Redundant Klee—Minty Cubes , 2009 .

[3]  Jure Leskovec,et al.  Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters , 2008, Internet Math..

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

[5]  A.J. Conejo,et al.  Modeling of start-up and shut-down power trajectories of thermal units , 2004, IEEE Transactions on Power Systems.

[6]  Laurence A. Wolsey,et al.  Lot-Sizing with Constant Batches: Formulation and Valid Inequalities , 1993, Math. Oper. Res..

[7]  A. Tamura,et al.  A revision of Minty's algorithm for finding a maximum weight stable set of a claw-free graph , 2001 .

[8]  Oliver Friedmann,et al.  A Subexponential Lower Bound for Zadeh's Pivoting Rule for Solving Linear Programs and Games , 2011, IPCO.

[9]  Laurence A. Wolsey,et al.  Production Planning by Mixed Integer Programming , 2010 .

[10]  Dimitri P. Bertsekas,et al.  Dynamic Programming and Optimal Control, Two Volume Set , 1995 .

[11]  Martin Jaggi,et al.  An Exponential Lower Bound on the Complexity of Regularization Paths , 2009, J. Comput. Geom..

[12]  M. Ziegler.  Volume 152 of Graduate Texts in Mathematics , 1995 .

[13]  Yinyu Ye,et al.  The Simplex and Policy-Iteration Methods Are Strongly Polynomial for the Markov Decision Problem with a Fixed Discount Rate , 2011, Math. Oper. Res..

[14]  James Renegar.  Central Swaths (A Generalization of the Central Path) , 2010 .

[15]  Leon S. Lasdon,et al.  Optimization Theory of Large Systems , 1970 .

[16]  David P. Williamson,et al.  The Design of Approximation Algorithms , 2011 .

[17]  Mirjam Dür,et al.  An improved algorithm to test copositivity , 2012, J. Glob. Optim..

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

[19]  Egon Balas,et al.  Lexicography and degeneracy: can a pure cutting plane algorithm work? , 2011, Math. Program..

[20]  Mirjam Dür,et al.  Copositive Programming – a Survey , 2010 .

[21]  A. M. Geoffrion.  Duality in Nonlinear Programming: A Simplified Applications-Oriented Development , 1971 .

[22]  Arik Wolak,et al.  Accuracy of Diagnosing Atrial Flutter and Atrial Fibrillation From a Surface Electrocardiogram by Hospital Physicians: Analysis of Data From Internal Medicine Departments , 2010, The American journal of the medical sciences.

[23]  Roman Vershynin,et al.  Beyond Hirsch Conjecture: Walks on Random Polytopes and Smoothed Complexity of the Simplex Method , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[24]  Victor Klee,et al.  Convex and Linear Orientations of Polytopal Graphs , 2000, Discret. Comput. Geom..

[25]  Leslie E. Trotter,et al.  On stable set polyhedra for K1, 3-free graphs , 1981, J. Comb. Theory, Ser. B.

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

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

[28]  G. Cohen.  Auxiliary problem principle and decomposition of optimization problems , 1980 .

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

[30]  Tamon Stephen,et al.  Embedding a Pair of Graphs in a Surface, and the Width of 4-dimensional Prismatoids , 2012, Discret. Comput. Geom..

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

[32]  Thorsten Koch,et al.  On the Effects of Minor Changes in Model Formulations , 2008 .

[33]  M. Hall,et al.  Copositive and completely positive quadratic forms , 1963, Mathematical Proceedings of the Cambridge Philosophical Society.

[34]  François Margot,et al.  Symmetric ILP: Coloring and small integers , 2007, Discret. Optim..

[35]  Gianpaolo Oriolo,et al.  A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs , 2008, IPCO.

[36]  Claude Lemaréchal,et al.  A geometric study of duality gaps, with applications , 2001, Math. Program..

[37]  Dimitris Bertsimas,et al.  Persistence in discrete optimization under data uncertainty , 2006, Math. Program..

[38]  Laurence A. Wolsey,et al.  MIP formulations and heuristics for two-level production-transportation problems , 2012, Comput. Oper. Res..

[39]  Sergei Chubanov.  A strongly polynomial algorithm for linear systems having a binary solution , 2012, Math. Program..

[40]  Hans Raj Tiwary,et al.  Exponential Lower Bounds for Polytopes in Combinatorial Optimization , 2011, J. ACM.

[41]  Sebastian Sager,et al.  Optimal Control for Cancer Chemotherapy ODE Models: Potential of Optimal Schedules and Choice of Objective Function , 2010 .

[42]  D. R. Fulkerson,et al.  Two computationally difficult set covering problems that arise in computing the 1-width of incidence matrices of Steiner triple systems , 1974 .

[43]  C. Gentile,et al.  2-clique-bond of stable set polyhedra , 2009 .

[44]  Volker Kaibel,et al.  Two New Bounds for the Random-Edge Simplex-Algorithm , 2007, SIAM J. Discret. Math..

[45]  Paul D. Seymour,et al.  Claw-free graphs. IV. Decomposition theorem , 2008, J. Comb. Theory, Ser. B.

[46]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[47]  Edward D. Kim.  Polyhedral graph abstractions and an approach to the Linear Hirsch Conjecture , 2011, Electron. Notes Discret. Math..

[48]  Antonio Sassano,et al.  The Rank Facets of the Stable Set Polytope for Claw-Free Graphs , 1997, J. Comb. Theory, Ser. B.

[49]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, Comb..

[50]  Stefan Feltenmark,et al.  Dual Applications of Proximal Bundle Methods, Including Lagrangian Relaxation of Nonconvex Problems , 1999, SIAM J. Optim..

[51]  D. Noble.  A modification of the Hodgkin—Huxley equations applicable to Purkinje fibre action and pacemaker potentials , 1962, The Journal of physiology.

[52]  Tamás Terlaky,et al.  A Continuous d-Step Conjecture for Polytopes , 2009, Discret. Comput. Geom..

[53]  Egon Balas,et al.  Optimizing over the split closure , 2008, Math. Program..

[54]  K. Schmüdgen.  TheK-moment problem for compact semi-algebraic sets , 1991 .

[55]  E. Mapother,et al.  Collected papers, vol. I , 1925 .

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

[57]  M. Resende,et al.  A probabilistic heuristic for a computationally difficult set covering problem , 1989 .

[58]  Oktay Günlük,et al.  Mixing mixed-integer inequalities , 2001, Math. Program..

[59]  Chung-Piaw Teo,et al.  Persistency Model and Its Applications in Choice Modeling , 2009, Manag. Sci..

[60]  Ali Ridha Mahjoub,et al.  Compositions of Graphs and Polyhedra II: Stable Sets , 1994, SIAM J. Discret. Math..

[61]  Paul D. Seymour,et al.  Claw-free graphs. V. Global structure , 2008, J. Comb. Theory, Ser. B.

[62]  Shinji Mizuno,et al.  Klee-Minty's LP and upper bounds for Dantzig's simplex method , 2011, Oper. Res. Lett..

[63]  Mirjam Dür,et al.  Algorithmic copositivity detection by simplicial partition , 2008 .

[64]  Immanuel M. Bomze,et al.  Think co(mpletely)positive ! Matrix properties, examples and a clustered bibliography on copositive optimization , 2012, J. Glob. Optim..

[65]  Jeff T. Linderoth,et al.  Solving large Steiner Triple Covering Problems , 2011, Oper. Res. Lett..

[66]  Thomas L. Magnanti,et al.  The convex hull of two core capacitated network design problems , 1993, Math. Program..

[67]  Leo Liberti.  Reformulations in Mathematical Programming: Symmetry , 2008 .

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

[69]  John Dunagan,et al.  Smoothed analysis of condition numbers and complexity implications for linear programming , 2011, Math. Program..

[70]  Jack Edmonds,et al.  Matroids and the greedy algorithm , 1971, Math. Program..

[71]  I. Grossmann.  Review of Nonlinear Mixed-Integer and Disjunctive Programming Techniques , 2002 .

[72]  François Margot,et al.  Exploiting orbits in symmetric ILP , 2003, Math. Program..

[73]  Jesús A. De Loera,et al.  The Central Curve in Linear Programming , 2010, Found. Comput. Math..

[74]  Claudio Gentile,et al.  The stable set polytope of claw-free graphs with large stability number , 2010, Electron. Notes Discret. Math..

[75]  Gianpaolo Oriolo,et al.  Clique family inequalities for the stable set polytope of quasi-line graphs , 2003, Discret. Appl. Math..

[76]  Immanuel M. Bomze,et al.  Copositive optimization - Recent developments and applications , 2012, Eur. J. Oper. Res..

[77]  Gautier Stauffer,et al.  On the facets of the stable set polytope of quasi-line graphs , 2011, Oper. Res. Lett..

[78]  G. Kalai,et al.  A quasi-polynomial bound for the diameter of graphs of polyhedra , 1992, math/9204233.

[79]  Marcus Poggi de Aragão,et al.  Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems , 2010, Math. Program. Comput..

[80]  R. Kipp Martin,et al.  Using separation algorithms to generate mixed integer model reformulations , 1991, Oper. Res. Lett..

[81]  Monique Laurent,et al.  Semidefinite bounds for the stability number of a graph via sums of squares of polynomials , 2005, Math. Program..

[82]  Maria Chudnovsky,et al.  quasi-line graphs , 2011 .

[83]  Thomas C. Hales,et al.  Sphere Packings, VI. Tame Graphs and Linear Programs , 2006, Discret. Comput. Geom..

[84]  Martin Grötschel,et al.  The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..

[85]  Tamás Terlaky,et al.  Polytopes and arrangements: Diameter and curvature , 2008, Oper. Res. Lett..

[86]  Mam Riess Jones.  Color Coding , 1962, Human factors.

[87]  I. J. Schoenberg,et al.  The Relaxation Method for Linear Inequalities , 1954, Canadian Journal of Mathematics.

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

[89]  T. Motzkin,et al.  Maxima for Graphs and a New Proof of a Theorem of Turán , 1965, Canadian Journal of Mathematics.

[90]  Santosh S. Vempala,et al.  A simple polynomial-time rescaling algorithm for solving linear programs , 2004, STOC '04.

[91]  Henry Wolkowicz,et al.  On Equivalence of Semidefinite Relaxations for Quadratic Matrix Programming , 2011, Math. Oper. Res..

[92]  Volker Kaibel,et al.  Constructing Extended Formulations from Reflection Relations , 2010, IPCO.

[93]  Philip M. Wolfe,et al.  Multiproject Scheduling with Limited Resources: A Zero-One Programming Approach , 1969 .

[94]  Robert D. Nowak,et al.  Distilled Sensing: Adaptive Sampling for Sparse Detection and Estimation , 2010, IEEE Transactions on Information Theory.

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

[96]  F. B. Shepherd,et al.  Formulations for the stable set polytope , 1992 .

[97]  R. Tyrrell Rockafellar,et al.  Scenarios and Policy Aggregation in Optimization Under Uncertainty , 1991, Math. Oper. Res..

[98]  Edward D. Kim,et al.  An Update on the Hirsch Conjecture , 2009, 0907.1186.

[99]  Holger Diedam,et al.  Optimization as an Analysis Tool for Human Complex Problem Solving , 2011, SIAM J. Optim..

[100]  Jacques F. Benders,et al.  Partitioning procedures for solving mixed-variables programming problems , 2005, Comput. Manag. Sci..

[101]  C. Berge.  Fractional Graph Theory , 1978 .

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

[103]  Edoardo Amaldi,et al.  Boundedness Theorems for the Relaxation Method , 2005, Math. Oper. Res..

[104]  Joachim Funke,et al.  Negative affective environments improve complex solving performance , 2010 .

[105]  Harold N. Gabow,et al.  Data structures for weighted matching and nearest common ancestors with linking , 1990, SODA '90.

[106]  Karthik Natarajan,et al.  MIXED ZERO-ONE LINEAR PROGRAMS UNDER OBJECTIVE UNCERTAINTY : A COMPLETELY POSITIVE REPRESENTATION , 2010 .

[107]  Matteo Fischetti,et al.  On the separation of disjunctive cuts , 2011, Math. Program..

[108]  Carlo Mannino,et al.  Solving hard set covering problems , 1995, Oper. Res. Lett..

[109]  Andrew D. King.  Claw-free graphs and two conjectures on omega, delta, and chi , 2009 .

[110]  Stanislav Busygin,et al.  Copositive Programming , 2009, Encyclopedia of Optimization.

[111]  Kh. D. Ikramov,et al.  Conditionally definite matrices , 2000 .

[112]  J. Stoer,et al.  Estimating the complexity of a class of path-following methods for solving linear programs by curvature integrals , 1993 .

[113]  Etienne de Klerk,et al.  On Copositive Programming and Standard Quadratic Optimization Problems , 2000, J. Glob. Optim..

[114]  Teofilo F. Gonzalez,et al.  P-Complete Approximation Problems , 1976, J. ACM.

[115]  Peter J. C. Dickinson.  Geometry of the copositive and completely positive cones , 2011 .

[116]  G. L..  Collected Papers , 1912, Nature.

[117]  A. Borghetti,et al.  An MILP Approach for Short-Term Hydro Scheduling and Unit Commitment With Head-Dependent Reservoir , 2008, IEEE Transactions on Power Systems.

[118]  Francisco Santos,et al.  A counterexample to the Hirsch conjecture , 2010, ArXiv.

[119]  Etienne de Klerk,et al.  Solving Standard Quadratic Optimization Problems via Linear, Semidefinite and Copositive Programming , 2002, J. Glob. Optim..

[120]  A. Bonato,et al.  Graphs and Hypergraphs , 2021, Clustering.

[121]  Jeff T. Linderoth,et al.  Orbital branching , 2007, Math. Program..

[122]  David W. Barnette.  An upper bound for the diameter of a polytope , 1974, Discret. Math..

[123]  Ola Svensson,et al.  Approximating Graphic TSP by Matchings , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[124]  Joel E. Cohen,et al.  Nonnegative ranks, decompositions, and factorizations of nonnegative matrices , 1993 .

[125]  Ali Ridha Mahjoub,et al.  Compositions of Graphs and Polyhedra I: Balanced Induced Subgraphs and Acyclic Subgraphs , 1994, SIAM J. Discret. Math..

[126]  Najiba Sbihi,et al.  Algorithme de recherche d'un stable de cardinalite maximum dans un graphe sans etoile , 1980, Discret. Math..

[127]  Jesús A. De Loera,et al.  Graphs of transportation polytopes , 2007, J. Comb. Theory, Ser. A.

[128]  G. Stengle.  A nullstellensatz and a positivstellensatz in semialgebraic geometry , 1974 .

[129]  József Balogh,et al.  The Klee-Minty random edge chain moves with linear speed , 2007, Random Struct. Algorithms.

[130]  Krzysztof C. Kiwiel,et al.  A Proximal Bundle Method with Approximate Subgradient Linearizations , 2006, SIAM J. Optim..

[131]  Claude Lemaréchal,et al.  Bundle Methods in Stochastic Optimal Power Management: A Disaggregated Approach Using Preconditioners , 2001, Comput. Optim. Appl..

[132]  Mats O Karlsson,et al.  Model of chemotherapy-induced myelosuppression with parameter consistency across drugs. , 2002, Journal of clinical oncology : official journal of the American Society of Clinical Oncology.

[133]  T. Terlaky,et al.  On the existence of a short admissible pivot sequence for feasibility and linear optimization problems , 1999 .

[134]  Hanif D. Sherali,et al.  Disjunctive Programming , 2009, Encyclopedia of Optimization.

[135]  安藤 毅.  Completely positive matrices , 1991 .

[136]  H. P. Williams.  THEORY OF LINEAR AND INTEGER PROGRAMMING (Wiley-Interscience Series in Discrete Mathematics and Optimization) , 1989 .

[137]  Victor Klee,et al.  Many Polytopes Meeting the Conjectured Hirsch Bound , 1998, Discret. Comput. Geom..

[138]  Leen Stougie,et al.  A Linear Bound On The Diameter Of The Transportation Polytope* , 2006, Comb..

[139]  Shang-Hua Teng,et al.  Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time , 2001, STOC '01.

[140]  D. Bayer,et al.  The nonlinear geometry of linear programming. II. Legendre transform coordinates and central trajectories , 1989 .

[141]  Erik Jan van Leeuwen,et al.  Domination When the Stars Are Out , 2010, ICALP.

[142]  Igor L. Markov,et al.  Exploiting structure in symmetry detection for CNF , 2004, Proceedings. 41st Design Automation Conference, 2004..

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

[144]  L. G. H. Cijan.  A polynomial algorithm in linear programming , 1979 .

[145]  Emmanuel J. Candès,et al.  Decoding by linear programming , 2005, IEEE Transactions on Information Theory.

[146]  Leslie E. Trotter,et al.  Properties of vertex packing and independence system polyhedra , 1974, Math. Program..

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

[148]  Luís Gouveia,et al.  A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem , 1995, Oper. Res..

[149]  Robert G. Jeroslow,et al.  Trivial integer programs unsolvable by branch-and-bound , 1974, Math. Program..

[150]  Santosh S. Vempala,et al.  Solving convex programs by random walks , 2004, JACM.

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

[152]  François Margot,et al.  Symmetry in Integer Linear Programming , 2010, 50 Years of Integer Programming.

[153]  Samuel Burer,et al.  On the copositive representation of binary and continuous nonconvex quadratic programs , 2009, Math. Program..

[154]  Jan Telgen,et al.  On relaxation methods for systems of linear inequalities , 1982 .

[155]  N. Biggs.  GEOMETRIC ALGORITHMS AND COMBINATORIAL OPTIMIZATION: (Algorithms and Combinatorics 2) , 1990 .

[156]  M. Shahidehpour,et al.  Price-based unit commitment: a case of Lagrangian relaxation versus mixed integer programming , 2005, IEEE Transactions on Power Systems.

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

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

[159]  D. R. Fulkerson,et al.  Width sequences for special classes of (0,1)-matrices.: , 1963 .

[160]  Hector J. Levesque,et al.  A New Method for Solving Hard Satisfiability Problems , 1992, AAAI.

[161]  D. Larman.  Paths on Polytopes , 1970 .

[162]  Henryk Wozniakowski,et al.  Complexity of linear programming , 1982, Oper. Res. Lett..

[163]  B. McKay.  nauty User ’ s Guide ( Version 2 . 4 ) , 1990 .

[164]  George J. Minty,et al.  On maximal independent sets of vertices in claw-free graphs , 1980, J. Comb. Theory, Ser. B.

[165]  Nesa L'abbe Wu,et al.  Linear programming and extensions , 1981 .

[166]  Leslie E. Trotter,et al.  Vertex packings: Structural properties and algorithms , 1975, Math. Program..

[167]  Jirí Matousek,et al.  Random edge can be exponential on abstract cubes , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[168]  Viet Hung Nguyen,et al.  On the Convex Hull of Huffman Trees , 2010, Electron. Notes Discret. Math..

[169]  M. Laurent.  Sums of Squares, Moment Matrices and Optimization Over Polynomials , 2009 .

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

[171]  Gil Kalai.  Upper bounds for the diameter and height of graphs of convex polyhedra , 1992, Discret. Comput. Geom..

[172]  Antonio Frangioni,et al.  0-1 Reformulations of the Multicommodity Capacitated Network Design Problem , 2009, Discret. Appl. Math..

[173]  Claude Lemaréchal,et al.  A primal-proximal heuristic applied to the French Unit-commitment problem , 2005, Math. Program..

[174]  Yinyu Ye,et al.  A primal-dual interior point method whose running time depends only on the constraint matrix , 1996, Math. Program..

[175]  Jeff T. Linderoth,et al.  Constraint Orbital Branching , 2008, IPCO.

[176]  Joao P. S. Catalao,et al.  Scheduling of head-dependent cascaded reservoirs considering discharge ramping constraints and start/stop of units , 2010 .

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

[178]  Gianpaolo Oriolo,et al.  On non-rank facets of the stable set polytope of claw-free graphs and circulant graphs , 2004, Math. Methods Oper. Res..

[179]  Chung-Piaw Teo,et al.  Choice Prediction With Semidefinite Optimization When Utilities are Correlated , 2012, IEEE Transactions on Automatic Control.

[180]  Bernd Gärtner.  The Random-Facet simplex algorithm on combinatorial cubes , 2002, Random Struct. Algorithms.

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

[182]  Victor Klee,et al.  The d-Step Conjecture and Its Relatives , 1987, Math. Oper. Res..

[183]  Henryk Minc,et al.  On the Matrix Equation X′X = A , 1962, Proceedings of the Edinburgh Mathematical Society.

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

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

[186]  Jiří Matoušek,et al.  Lower Bounds for a Subexponential Optimization Algorithm , 1994, Random Struct. Algorithms.

[187]  Claude Lemaréchal,et al.  On a primal-proximal heuristic in discrete optimization , 2005, Math. Program..

[188]  M. R. Rao,et al.  Odd Minimum Cut-Sets and b-Matchings , 1982, Math. Oper. Res..

[189]  Friedrich Eisenbrand,et al.  On Sub-determinants and the Diameter of Polyhedra , 2011, SoCG '12.

[190]  Thomas C. Hales.  Sphere packings, I , 1997, Discret. Comput. Geom..

[191]  Volker Kaibel,et al.  Extended Formulations for Packing and Partitioning Orbitopes , 2008, Math. Oper. Res..

[192]  D. Bertsekas,et al.  Optimal short-term scheduling of large-scale power systems , 1981, 1981 20th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes.

[193]  Martin E. Dyer,et al.  Random walks, totally unimodular matrices, and a randomised dual simplex algorithm , 1994, IPCO.

[194]  Gilberto Calvillo,et al.  The Concavity and Intersection Properties for Integral Polyhedra , 1980 .

[195]  Jirí Matousek,et al.  Violator spaces: Structure and algorithms , 2006, Discret. Appl. Math..

[196]  Wojciech Szatzschneider,et al.  An Inequality , 1991, SIAM Rev..

[197]  Micha Sharir,et al.  The Simplex Algorithm in Dimension Three , 2004, SIAM J. Comput..

[198]  Renato F. Werneck,et al.  Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem , 2004, Math. Program..

[199]  G. Dantzig,et al.  Maximum Diameter of Abstract Polytopes , 1974 .

[200]  Claudio Gentile,et al.  Gear composition and the stable set polytope , 2008, Oper. Res. Lett..

[201]  Claudia A. Sagastizábal,et al.  Bundle Relaxation and Primal Recovery in Unit Commitment Problems. The Brazilian Case , 2003, Ann. Oper. Res..

[202]  K. G. Murty,et al.  Existence of A-avoiding paths in abstract polytopes , 1974 .

[203]  Santosh S. Vempala,et al.  A New Approach to Strongly Polynomial Linear Programming , 2010, ICS.

[204]  J. G. Pierce,et al.  Geometric Algorithms and Combinatorial Optimization , 2016 .

[205]  Manfred W. Padberg,et al.  On the facial structure of set packing polyhedra , 1973, Math. Program..

[206]  Sonoko Moriyama,et al.  On Combinatorial Properties of Linear Program Digraphs , 2008 .

[207]  László Lovász,et al.  Energy of Convex Sets, Shortest Paths, and Resistance , 2001, J. Comb. Theory, Ser. A.

[208]  Klaus Truemper,et al.  Polynomial algorithms for a class of linear programs , 1981, Math. Program..

[209]  Paul D. Seymour,et al.  The structure of claw-free graphs , 2005, BCC.

[210]  Bernd Gärtner,et al.  Understanding and using linear programming , 2007, Universitext.

[211]  Ulrich Betke.  Relaxation, New Combinatorial and Polynomial Algorithms for the Linear Feasibility Problem , 2004, Discret. Comput. Geom..

[212]  G. Nemhauser,et al.  Integer Programming , 2020 .

[213]  John N. Tsitsiklis,et al.  Introduction to linear optimization , 1997, Athena scientific optimization and computation series.

[214]  Mauricio G. C. Resende,et al.  An interior point algorithm to solve computationally difficult set covering problems , 1991, Math. Program..

[215]  Jean B. Lasserre,et al.  A New Look at Nonnegativity on Closed Sets and Polynomial Optimization , 2010, SIAM J. Optim..

[216]  Miron Livny,et al.  Condor-a hunter of idle workstations , 1988, [1988] Proceedings. The 8th International Conference on Distributed.

[217]  W. Marsden.  I and J , 2012 .

[218]  Roland Hildebrand,et al.  The extreme rays of the 5 × 5 copositive cone , 2012 .

[219]  Hans van Maaren,et al.  Improved Solutions to the Steiner Triple Covering Problem , 1998, Inf. Process. Lett..

[220]  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.

[221]  Tamás Terlaky,et al.  Criss-cross methods: A fresh view on pivot algorithms , 1997, Math. Program..

[222]  E. Alper Yildirim,et al.  On the accuracy of uniform polyhedral approximations of the copositive cone , 2012, Optim. Methods Softw..

[223]  A. J. Quist,et al.  Copositive relaxation for general quadratic programming. , 1998 .

[224]  George B. Dantzig,et al.  Decomposition Principle for Linear Programs , 1960 .

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

[226]  N. Amenta,et al.  Deformed products and maximal shadows of polytopes , 1996 .

[227]  Philip Wolfe,et al.  Contributions to the theory of games , 1953 .

[228]  Bernd Gärtner,et al.  Pivoting in Linear Complementarity: Two Polynomial-Time Cases , 2008, Discret. Comput. Geom..

[229]  S. Vempala.  Geometric Random Walks: a Survey , 2007 .

[230]  François Margot,et al.  Pruning by isomorphism in branch-and-cut , 2001, Math. Program..

[231]  Claude Lemaréchal,et al.  Lagrangian Relaxation , 2000, Computational Combinatorial Optimization.

[232]  Mirjam Dür,et al.  An Adaptive Linear Approximation Algorithm for Copositive Programs , 2009, SIAM J. Optim..

[233]  Annegret Wagler,et al.  On facets of stable set polytopes of claw-free graphs with stability number 3 , 2010, Discret. Math..

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

[235]  Michael Elad,et al.  From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images , 2009, SIAM Rev..

[236]  Jan Vondrák,et al.  Maximizing a Monotone Submodular Function Subject to a Matroid Constraint , 2011, SIAM J. Comput..

[237]  Yoshio Okamoto,et al.  The Holt-Klee condition for oriented matroids , 2009, Eur. J. Comb..

[238]  Claudio Gentile,et al.  Gear Composition of Stable Set Polytopes and G-Perfection , 2009, Math. Oper. Res..

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

[240]  M. Laurent.  THE OPERATOR FOR THE CHROMATIC NUMBER OF AGRAPH , 2008 .

[241]  Sergei Chubanov.  A polynomial relaxation-type algorithm for linear programming , 2011 .

[242]  Yuval Rabani,et al.  Linear Programming , 2007, Handbook of Approximation Algorithms and Metaheuristics.

[243]  Uri Zwick,et al.  Subexponential lower bounds for randomized pivoting rules for the simplex algorithm , 2011, STOC '11.

[244]  Santosh S. Vempala,et al.  On The Approximability Of The Traveling Salesman Problem , 2006, Comb..

[245]  D. Bayer,et al.  The Non-Linear Geometry of Linear Pro-gramming I: A?ne and projective scaling trajectories , 1989 .

[246]  Walter D. Morris.  Randomized pivot algorithms for P-matrix linear complementarity problems , 2002, Math. Program..

[247]  David W. Walkup,et al.  A 3-Sphere Counterexample to the Wv-Path Conjecture , 1980, Math. Oper. Res..

[248]  Miguel Constantino,et al.  Lower Bounds in Lot-Sizing Models: A Polyhedral Study , 1998, Math. Oper. Res..

[249]  Claudio Gentile,et al.  On the Stable Set Polytope of Claw-Free Graphs , 2008, COCOA.

[250]  Michael Shub,et al.  On the Curvature of the Central Path of Linear Programming Theory , 2003, Found. Comput. Math..

[251]  Friedrich Eisenbrand,et al.  The stable set polytope of quasi-line graphs , 2010, Comb..

[252]  Martin L. Puterman,et al.  Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .

[253]  João C. N. Clímaco,et al.  The generalized simplex method , 1992, Oper. Res. Lett..

[254]  Takashi Tsuchiya,et al.  A strong bound on the integral of the central path curvature and its relationship with the iteration-complexity of primal-dual path-following LP algorithms , 2008, Math. Program..

[255]  Mauricio G. C. Resende,et al.  Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..

[256]  Claude Lemaréchal,et al.  Variable metric bundle methods: From conceptual to implementable forms , 1997, Math. Program..

[257]  V. Chvátal.  On certain polytopes associated with graphs , 1975 .

[258]  Michael J. Todd,et al.  The many facets of linear programming , 2002, Math. Program..

[259]  Jean-Louis Goffin,et al.  The Relaxation Method for Solving Systems of Linear Inequalities , 1980, Math. Oper. Res..

[260]  Daniel A. Spielman,et al.  A randomized polynomial-time simplex algorithm for linear programming , 2006, STOC '06.

[261]  P. Parrilo,et al.  Semidefinite programming based tests for matrix copositivity , 2000, Proceedings of the 39th IEEE Conference on Decision and Control (Cat. No.00CH37187).

[262]  Annegret Wagler,et al.  A note on the Chvátal-rank of clique family inequalities , 2007, RAIRO Oper. Res..

[263]  James Renegar,et al.  Hyperbolic Programs, and Their Derivative Relaxations , 2006, Found. Comput. Math..

[264]  Denis Noble,et al.  How the Hodgkin–Huxley equations inspired the Cardiac Physiome Project , 2012, The Journal of physiology.

[265]  David R. Karger,et al.  A new approach to the minimum cut problem , 1996, JACM.

[266]  Josef Stoer,et al.  On the complexity of following the central path of linear programs by linear extrapolation II , 1991, Math. Program..

[267]  Javier Peña,et al.  Computing the Stability Number of a Graph Via Linear and Semidefinite Programming , 2007, SIAM J. Optim..

[268]  Egon Balas,et al.  programming: Properties of the convex hull of feasible points * , 1998 .

[269]  E. Upfal,et al.  On factors in random graphs , 1981 .

[270]  Igor Rivin.  Combinatorial optimization in geometry , 2003, Adv. Appl. Math..

[271]  Mirjam Dür,et al.  The difference between 5×5 doubly nonnegative and completely positive matrices , 2009 .

[272]  G. Oriolo,et al.  The hidden-matching structure of the composition of strips : a polyhedral perspective , 2010 .

[273]  Florian Jarre,et al.  A note on Burer’s copositive representation of mixed-binary QPs , 2010, Optim. Lett..

[274]  Diwakar Gupta,et al.  A Sequential Bounding Approach for Optimal Appointment Scheduling , 2003 .

[275]  Jean Clairambault,et al.  Modelling Physiological and Pharmacological Control on Cell Proliferation to Optimise Cancer Treatments , 2009 .

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

[277]  Katta G. Murty,et al.  Some NP-complete problems in quadratic and nonlinear programming , 1987, Math. Program..

[278]  Alexander A. Razborov,et al.  Diameter of polyhedra: limits of abstraction , 2009, SCG '09.

[279]  F. Bruce Shepherd,et al.  Applying Lehman's theorems to packing problems , 1995, Math. Program..