DOCSLIB.ORG

At Play with Combinatorial Optimization, Integer Programming and Polyhedra Gautier Stauffer

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
At Play with Combinatorial Optimization, Integer Programming and Polyhedra Gautier Stauffer At Play with Combinatorial Optimization, Integer Programming and Polyhedra Gautier Stauffer To cite this version: Gautier Stauffer. At Play with Combinatorial Optimization, Integer Programming and Polyhedra. Optimization and Control [math.OC]. Université Sciences et Technologies - Bordeaux I, 2011. tel- 00653059 HAL Id: tel-00653059 https://tel.archives-ouvertes.fr/tel-00653059 Submitted on 17 Dec 2011 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Universite´ Bordeaux 1 Institut de Math´ematiques de Bordeaux Habilitation a` diriger des recherches Ecole doctorale de Math´ematiques et Informatique de Bordeaux At play with Combinatorial Optimization, Integer Programming and Polyhedra ou Excursions en Optimisation Combinatoire, Programmation Enti`ere et Polyh`edres. Soutenue et pr´esent´ee publiquement par Gautier Stauffer le 28 novembre 2011 devant la commission d’examen form´ee de : Michele Conforti Universit`adi Padova rapporteur Volker Kaibel Otto-von-Guericke Universit¨at rapporteur Ridha Majhoub Universit´ede Paris-Dauphine rapporteur Arnaud Pˆecher Universit´ede Bordeaux 1 examinateur Fran¸cois Vanderbeck Universit´ede Bordeaux 1 examinateur 2 `aMadame Patate 3 4 Contents 1 Introduction 9 2 Dynamic programming and shortest path 13 2.1 Inventorycontrol ................................ 13 2.2 Stable sets in graphs with bounded width stability number ............ 14 3 Building upon network flows 17 3.1 Set packing problem associated with circular one matrices............. 17 3.2 Separating over the set packing polytope associated with circular one matrices . 18 3.3 Inventory control in one-warehouse multi-retailer systems as a fixed charge net- workflow ........................................ 19 4 Matching and beyond 21 4.1 Linegraphsandcompositionofstrips . ........ 21 4.2 Stablesetsinclaw-freegraphs. ........ 24 4.3 p-medianinY-freegraphs . ..... 25 5 Structural graph theory 29 5.1 Algorithmic decomposition theorem for claw-free graphs.............. 29 5.2 Recognizing fuzzy circular interval graphs : a simple induction .......... 32 6 Polyhedra 35 6.1 Some properties of the matching polytope . ......... 35 6.2 p-medianpolytopeofY-freegraphs. ........ 36 6.3 Stable set polytope of quasi-line graphs . .......... 37 6.4 Rank-facets for SSP of quasi-line graphs by sequential lifting ........... 39 7 Extended formulations 43 7.1 Extended formulation for distance claw-free graphs . .............. 43 7.2 Combinatorial union of polytopes . ........ 43 7.3 Extended formulation for the stable set polytope of claw-freegraphs . 45 8 Cutting-plane and Column generation 47 8.1 Chv`atal-Gomory cuts, split cuts and the SSP of quasi-linegraphs. 47 8.2 A lower bound on the Chv`atal-Gomory rank for polytope in the 0/1 cube . 48 8.3 An industrial cutting stock problem by Column Generation ............ 50 9 Approximation algorithms 53 9.1 OWMRCD : Performance analysis through convex optimization.......... 53 9.2 OWMR : a 2-approximation through extended formulation . ........... 55 10 Conclusion and perspectives 59 Glossary α(G) Stability number of G i.e. size of a maximum cardinality stable set. We sometimes abuse notation and given a subset of vertices U of a graph G, use α(U) for α(G[V ]). CIG Circular interval graphs. Circular interval graphs A circular interval graph G(V, E) is defined by the following con- struction: Take a circle , a set of vertices V and a mapping Φ : V of the vertices on C 7→ C the circle. Take a subset of closed and proper intervals of , with no interval including J C another, and say that u, v V are adjacent (i.e. (u, v) E) if Φ(u), Φ(v) is a subset of ∈ ∈ { } one of the intervals. (V, Φ, ) is a interval model of G. J Circular one matrix Let A be a m n matrix with zeros and ones. A is a circular one matrix × if in each row, the ones appear in consecutive columns (where column 1 is considered consecutive to column n). Claw A claw (u; v,w,z) is a graph with vertex set u,v,w,z and edge set (u, v), (u, w), (u, z) . { } { } Clique A clique is a complete subgraph. Clique family inequality Let G be a graph and let = K ,...,K be a set of cliques o G, F { 1 n} 1 p n be integral and r = n mod p. Let V V (G) be the set of vertices covered ≤ ≤ p−1 ⊆ by exactly (p 1) cliques of and V V (G) the set of vertices covered by p or more − F ≥p ⊆ cliques of . The inequality F n (p r 1) x(v) + (p r) x(v) (p r) − − − ≤ − p v∈XVp−1 v∈XV≥p is valid for STAB(G) and is called the clique family inequality associated with and p. F n Combinatorial union of polytopes Let Pi R , i = 1, ..., k be k non empty polyhedra. Let 1 l k ⊆ λ , ..., λ 0, 1 . The combinatorial union of the polyhedron Pi w.r.t. λ1, ..., λl is the ∈ { } l j { } set P = conv.hull( j=1 λ (i)Pi) where the sum is the Minkowsky sum. Composition of stripsSLet P = (Gi, i), i = 1, ..., k be a family of vertex disjoint strips. H { A } Let ( ) denote the multi-family of the extremities of those strips, i.e., ( )= i, A H A H i=1..k A and let = P , P , ..., P be the classes of a partition of ( ). We associate to the pair P 1 2 q A H S ( , ) the graph G that is made of the disjoint union of the graphs G1,...Gk, with H P additional edges E := (u, v) : u = v and u and v belong to different extremities in a same { 6 class P , for some 1 i q . G is called the composition of the strips with respect to i ≤ ≤ } H partition . P Distance simplicial strip A strip (G, ) is distance simplicial if for all A , α(N (A)) 1 A ∈A i ≤ for all i 0. ≥ 5 6 Glossary Edmonds’ inequality Let G be a graph. Given a set of n cliques and a set of vertices Q covered by at least two of those cliques, one can write an inequality x(v) Q /2 v∈Q ≤ ⌊| | ⌋ which is valid for STAB(G) and such an inequality is called an Edmonds’ inequality. P FCIG Fuzzy circular interval graphs. Fuzzy circular interval graphs A graph G = (V, E) is a fuzzy circular interval graph if the following conditions hold: (i) There is a map Φ from V to a circle ; (ii) There is a set C of closed and proper intervals of , none including another, such that no point of is J C C the end of more than one interval and (iia) If two vertices u and v are adjacent, then Φ(u) and Φ(v) belong to a common interval ; (iib) If two vertices u and v belong to the same interval, which is not an interval with endpoints Φ(u) and Φ(v), then they are adjacent. Γ(S) is the strong neighborhood of S i.e. given a graph G(V, E) and a set S V , Γ(S)= v ⊆ { ∈ V S : (u, v) E for all u S . \ ∈ ∈ } Intersection property a polyhedra P has the intersection property if P x : x = k ∩ { e∈E e } is integral for every integer k. P JRP Joint Replenishment Problem, see Section 3.3. Krausz family Given a graph G, we call a family of cliques of G a Krausz family (of G) if F it satisfies that every edge of G is covered by some clique of and every vertex of G is F covered by exactly two cliques of . F Line graph The line graph L(G) of a graph G is the intersection graph of the edges of G i.e. there is a vertex for each edge in G and two vertices are adjacent if and only if their corresponding edges in G are incident. Line strip a strip (S, ) is line if it admits a Krausz family with . A K A ⊆ K MATCH(G) The matching polytope of a graph G i.e. the convex hull of all incidence vectors of matchings in a graph G. Matching A matching in a (multi-) graph G(V, E) is a subset of pairwise non incident edges. Minkowsky sum Given two polyhedra P1, P2, the Minkowsky sum of P1 and P2 is denoted by P + P and is defined by P + P = x + x : x P ,x P . 1 2 1 2 { 1 2 1 ∈ 1 2 ∈ 2} MWSS Maximum Weighted Stable Set. N (S) the neighborhood of the set S i.e. given an undirected graph G(V, E), and S V , ⊆ N(S)= v V S : (u, v) E for some u S . { ∈ \ ∈ ∈ } N(v) the neighborhood of v i.e N( v ). { } N[S] the closed neighborhood of S i.e. N(S) S. ∪ N[v] the closed neighborhood of v i.e N[ v ]. { } N (v) the i-th neighborhood of v defined by the following recursion : N (v) = v , N (v) = i 0 { } i+1 N(N (v)) i N (v). i \ l=1 l S Glossary 7 Net A net (u , u , u ; v , v , v ) is a graph with vertex set u , u , u , v , v , v and edge set 1 2 3 1 2 3 { 1 2 3 1 2 3} (u , u ), (u , u ), (u , u ), (u , v ), (u , v ), (u , v ) .
Load more

Recommended publications
  • 7 LATTICE POINTS and LATTICE POLYTOPES Alexander Barvinok
    7 LATTICE POINTS AND LATTICE POLYTOPES Alexander Barvinok INTRODUCTION Lattice polytopes arise naturally in algebraic geometry, analysis, combinatorics, computer science, number theory, optimization, probability and representation the- ory. They possess a rich structure arising from the interaction of algebraic, convex, analytic, and combinatorial properties. In this chapter, we concentrate on the the- ory of lattice polytopes and only sketch their numerous applications. We briefly discuss their role in optimization and polyhedral combinatorics (Section 7.1). In Section 7.2 we discuss the decision problem, the problem of finding whether a given polytope contains a lattice point. In Section 7.3 we address the counting problem, the problem of counting all lattice points in a given polytope. The asymptotic problem (Section 7.4) explores the behavior of the number of lattice points in a varying polytope (for example, if a dilation is applied to the polytope). Finally, in Section 7.5 we discuss problems with quantifiers. These problems are natural generalizations of the decision and counting problems. Whenever appropriate we address algorithmic issues. For general references in the area of computational complexity/algorithms see [AB09]. We summarize the computational complexity status of our problems in Table 7.0.1. TABLE 7.0.1 Computational complexity of basic problems. PROBLEM NAME BOUNDED DIMENSION UNBOUNDED DIMENSION Decision problem polynomial NP-hard Counting problem polynomial #P-hard Asymptotic problem polynomial #P-hard∗ Problems with quantifiers unknown; polynomial for ∀∃ ∗∗ NP-hard ∗ in bounded codimension, reduces polynomially to volume computation ∗∗ with no quantifier alternation, polynomial time 7.1 INTEGRAL POLYTOPES IN POLYHEDRAL COMBINATORICS We describe some combinatorial and computational properties of integral polytopes.
    [Show full text]
  • Combinatorial and Discrete Problems in Convex Geometry
    COMBINATORIAL AND DISCRETE PROBLEMS IN CONVEX GEOMETRY A dissertation submitted to Kent State University in partial fulfillment of the requirements for the degree of Doctor of Philosophy by Matthew R. Alexander September, 2017 Dissertation written by Matthew R. Alexander B.S., Youngstown State University, 2011 M.A., Kent State University, 2013 Ph.D., Kent State University, 2017 Approved by Dr. Artem Zvavitch , Co-Chair, Doctoral Dissertation Committee Dr. Matthieu Fradelizi , Co-Chair Dr. Dmitry Ryabogin , Members, Doctoral Dissertation Committee Dr. Fedor Nazarov Dr. Feodor F. Dragan Dr. Jonathan Maletic Accepted by Dr. Andrew Tonge , Chair, Department of Mathematical Sciences Dr. James L. Blank , Dean, College of Arts and Sciences TABLE OF CONTENTS LIST OF FIGURES . vi ACKNOWLEDGEMENTS ........................................ vii NOTATION ................................................. viii I Introduction 1 1 This Thesis . .2 2 Preliminaries . .4 2.1 Convex Geometry . .4 2.2 Basic functions and their properties . .5 2.3 Classical theorems . .6 2.4 Polarity . .8 2.5 Volume Product . .8 II The Discrete Slicing Problem 11 3 The Geometry of Numbers . 12 3.1 Introduction . 12 3.2 Lattices . 12 3.3 Minkowski's Theorems . 14 3.4 The Ehrhart Polynomial . 15 4 Geometric Tomography . 17 4.1 Introduction . 17 iii 4.2 Projections of sets . 18 4.3 Sections of sets . 19 4.4 The Isomorphic Busemann-Petty Problem . 20 5 The Discrete Slicing Problem . 22 5.1 Introduction . 22 5.2 Solution in Z2 ............................................. 23 5.3 Approach via Discrete F. John Theorem . 23 5.4 Solution using known inequalities . 26 5.5 Solution for Unconditional Bodies . 27 5.6 Discrete Brunn's Theorem .
    [Show full text]
  • Classification of Ehrhart Polynomials of Integral Simplices Akihiro Higashitani
    Classification of Ehrhart polynomials of integral simplices Akihiro Higashitani To cite this version: Akihiro Higashitani. Classification of Ehrhart polynomials of integral simplices. 24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012), 2012, Nagoya, Japan. pp.587-594. hal-01283113 HAL Id: hal-01283113 https://hal.archives-ouvertes.fr/hal-01283113 Submitted on 5 Mar 2016 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. FPSAC 2012, Nagoya, Japan DMTCS proc. AR, 2012, 587–594 Classification of Ehrhart polynomials of integral simplices Akihiro Higashitani y Department of Pure and Applied Mathematics, Graduate School of Information Science and Technology, Osaka University, Toyonaka, Osaka 560-0043, Japan Abstract. Let δ(P) = (δ0; δ1; : : : ; δd) be the δ-vector of an integral convex polytope P of dimension d. First, by Pd using two well-known inequalities on δ-vectors, we classify the possible δ-vectors with i=0 δi ≤ 3. Moreover, by Pd means of Hermite normal forms of square matrices, we also classify the possible δ-vectors with i=0 δi = 4. In Pd Pd addition, for i=0 δi ≥ 5, we characterize the δ-vectors of integral simplices when i=0 δi is prime.
    [Show full text]
  • Polyhedral Combinatorics, Complexity & Algorithms
    POLYHEDRAL COMBINATORICS, COMPLEXITY & ALGORITHMS FOR k-CLUBS IN GRAPHS By FOAD MAHDAVI PAJOUH Bachelor of Science in Industrial Engineering Sharif University of Technology Tehran, Iran 2004 Master of Science in Industrial Engineering Tarbiat Modares University Tehran, Iran 2006 Submitted to the Faculty of the Graduate College of Oklahoma State University in partial fulfillment of the requirements for the Degree of DOCTOR OF PHILOSOPHY July, 2012 COPYRIGHT c By FOAD MAHDAVI PAJOUH July, 2012 POLYHEDRAL COMBINATORICS, COMPLEXITY & ALGORITHMS FOR k-CLUBS IN GRAPHS Dissertation Approved: Dr. Balabhaskar Balasundaram Dissertation Advisor Dr. Ricki Ingalls Dr. Manjunath Kamath Dr. Ramesh Sharda Dr. Sheryl Tucker Dean of the Graduate College iii Dedicated to my parents iv ACKNOWLEDGMENTS I would like to wholeheartedly express my sincere gratitude to my advisor, Dr. Balabhaskar Balasundaram, for his continuous support of my Ph.D. study, for his patience, enthusiasm, motivation, and valuable knowledge. It has been a great honor for me to be his first Ph.D. student and I could not have imagined having a better advisor for my Ph.D. research and role model for my future academic career. He has not only been a great mentor during the course of my Ph.D. and professional development but also a real friend and colleague. I hope that I can in turn pass on the research values and the dreams that he has given to me, to my future students. I wish to express my warm and sincere thanks to my wonderful committee mem- bers, Dr. Ricki Ingalls, Dr. Manjunath Kamath and Dr. Ramesh Sharda for their support, guidance and helpful suggestions throughout my Ph.D.
    [Show full text]
  • Unimodular Triangulations of Dilated 3-Polytopes
    Trudy Moskov. Matem. Obw. Trans. Moscow Math. Soc. Tom 74 (2013), vyp. 2 2013, Pages 293–311 S 0077-1554(2014)00220-X Article electronically published on April 9, 2014 UNIMODULAR TRIANGULATIONS OF DILATED 3-POLYTOPES F. SANTOS AND G. M. ZIEGLER Abstract. A seminal result in the theory of toric varieties, by Knudsen, Mumford and Waterman (1973), asserts that for every lattice polytope P there is a positive integer k such that the dilated polytope kP has a unimodular triangulation. In dimension 3, Kantor and Sarkaria (2003) have shown that k = 4 works for every polytope. But this does not imply that every k>4 works as well. We here study the values of k for which the result holds, showing that: (1) It contains all composite numbers. (2) It is an additive semigroup. These two properties imply that the only values of k that may not work (besides 1 and 2, which are known not to work) are k ∈{3, 5, 7, 11}.Withanad-hocconstruc- tion we show that k =7andk = 11 also work, except in this case the triangulation cannot be guaranteed to be “standard” in the boundary. All in all, the only open cases are k =3andk =5. § 1. Introduction Let Λ ⊂ Rd be an affine lattice. A lattice polytope (or an integral polytope [4]) is a polytope P with all its vertices in Λ. We are particularly interested in lattice (full- dimensional) simplices. The vertices of a lattice simplex Δ are an affine basis for Rd, hence they induce a sublattice ΛΔ of Λ of index equal to the normalized volume of Δ with respect to Λ.
    [Show full text]
  • The $ H^* $-Polynomial of the Order Polytope of the Zig-Zag Poset
    THE h∗-POLYNOMIAL OF THE ORDER POLYTOPE OF THE ZIG-ZAG POSET JANE IVY COONS AND SETH SULLIVANT Abstract. We describe a family of shellings for the canonical tri- angulation of the order polytope of the zig-zag poset. This gives a new combinatorial interpretation for the coefficients in the numer- ator of the Ehrhart series of this order polytope in terms of the swap statistic on alternating permutations. 1. Introduction and Preliminaries The zig-zag poset Zn on ground set {z1,...,zn} is the poset with exactly the cover relations z1 < z2 > z3 < z4 > . That is, this partial order satisfies z2i−1 < z2i and z2i > z2i+1 for all i between n−1 1 and ⌊ 2 ⌋. The order polytope of Zn, denoted O(Zn) is the set n of all n-tuples (x1,...,xn) ∈ R that satisfy 0 ≤ xi ≤ 1 for all i and xi ≤ xj whenever zi < zj in Zn. In this paper, we introduce the “swap” permutation statistic on alternating permutations to give a new combinatorial interpretation of the numerator of the Ehrhart series of O(Zn). We began studying this problem in relation to combinatorial proper- ties of the Cavender-Farris-Neyman model with a molecular clock (or CFN-MC model) from mathematical phylogenetics [4]. We were inter- ested in the polytope associated to the toric variety obtained by ap- plying the discrete Fourier transform to the Cavender-Farris-Neyman arXiv:1901.07443v2 [math.CO] 1 Apr 2020 model with a molecular clock on a given rooted binary phylogenetic tree. We call this polytope the CFN-MC polytope.
    [Show full text]
  • Triangulations of Integral Polytopes, Examples and Problems
    数理解析研究所講究録 955 巻 1996 年 133-144 133 Triangulations of integral polytopes, examples and problems Jean-Michel KANTOR We are interested in polytopes in real space of arbitrary dimension, having vertices with integral co- ordinates: integral polytopes. The recent increase of interest for the study of these $\mathrm{p}\mathrm{o}\mathrm{l}\mathrm{y}$ topes and their triangulations has various motivations; let us mention the main ones: . the beautiful theory of toric varieties has built a bridge between algebraic geometry and the combina- torics of these integral polytopes [12]. Triangulations of cones and polytopes occur naturally for example in problems of existence of crepant resolution of singularities $[1,5]$ . The work of the school of $\mathrm{I}.\mathrm{M}$ . Gelfand on secondary polytopes gives a new insight on triangulations, with applications to algebraic geometry and group theory [13]. In statistical physics, random tilings lead to some interesting problems dealing with triangulations of order polytopes $[6,29]$ . With these motivations in mind, we introduce new tools: Generalizations of the Ehrhart polynomial (counting points “modulo congruence”), discrete length between integral points (and studying the geometry associated to it), arithmetic Euler-Poincar\'e formula which gives, in dimension 3, the Ehrhart polynomial in terms of the $\mathrm{f}$-vector of a minimal triangulation of the polytope (Theorem 7). Finally, let us mention the results in dimension 2 of the late Peter Greenberg, they led us to the study of “Arithmetical $\mathrm{P}\mathrm{L}$-topology” which, we believe with M. Gromov, D. Sullivan, and P. Vogel, has not yet revealed all its beauties.
    [Show full text]
  • 3. Linear Programming and Polyhedral Combinatorics Summary of What Was Seen in the Introductory Lectures on Linear Programming and Polyhedral Combinatorics
    Massachusetts Institute of Technology Handout 6 18.433: Combinatorial Optimization February 20th, 2009 Michel X. Goemans 3. Linear Programming and Polyhedral Combinatorics Summary of what was seen in the introductory lectures on linear programming and polyhedral combinatorics. Definition 3.1 A halfspace in Rn is a set of the form fx 2 Rn : aT x ≤ bg for some vector a 2 Rn and b 2 R. Definition 3.2 A polyhedron is the intersection of finitely many halfspaces: P = fx 2 Rn : Ax ≤ bg. Definition 3.3 A polytope is a bounded polyhedron. n n−1 Definition 3.4 If P is a polyhedron in R , the projection Pk ⊆ R of P is defined as fy = (x1; x2; ··· ; xk−1; xk+1; ··· ; xn): x 2 P for some xkg. This is a special case of a projection onto a linear space (here, we consider only coordinate projection). By repeatedly projecting, we can eliminate any subset of coordinates. We claim that Pk is also a polyhedron and this can be proved by giving an explicit description of Pk in terms of linear inequalities. For this purpose, one uses Fourier-Motzkin elimination. Let P = fx : Ax ≤ bg and let • S+ = fi : aik > 0g, • S− = fi : aik < 0g, • S0 = fi : aik = 0g. T Clearly, any element in Pk must satisfy the inequality ai x ≤ bi for all i 2 S0 (these inequal- ities do not involve xk). Similarly, we can take a linear combination of an inequality in S+ and one in S− to eliminate the coefficient of xk. This shows that the inequalities: ! ! X X aik aljxj − alk aijxj ≤ aikbl − alkbi (1) j j for i 2 S+ and l 2 S− are satisfied by all elements of Pk.
    [Show full text]
  • Linear Programming and Polyhedral Combinatorics Summary of What Was Seen in the Introductory Lectures on Linear Programming and Polyhedral Combinatorics
    Massachusetts Institute of Technology Handout 8 18.433: Combinatorial Optimization March 6th, 2007 Michel X. Goemans Linear Programming and Polyhedral Combinatorics Summary of what was seen in the introductory lectures on linear programming and polyhedral combinatorics. Definition 1 A halfspace in Rn is a set of the form fx 2 Rn : aT x ≤ bg for some vector a 2 Rn and b 2 R. Definition 2 A polyhedron is the intersection of finitely many halfspaces: P = fx 2 Rn : Ax ≤ bg. Definition 3 A polytope is a bounded polyhedron. n Definition 4 If P is a polyhedron in R , the projection Pk of P is defined as fy = (x1; x2; · · · ; xk−1; xk+1; · · · ; xn) : x 2 P for some xkg. We claim that Pk is also a polyhedron and this can be proved by giving an explicit description of Pk in terms of linear inequalities. For this purpose, one uses Fourier-Motzkin elimination. Let P = fx : Ax ≤ bg and let • S+ = fi : aik > 0g, • S− = fi : aik < 0g, • S0 = fi : aik = 0g. T Clearly, any element in Pk must satisfy the inequality ai x ≤ bi for all i 2 S0 (these inequal- ities do not involve xk). Similarly, we can take a linear combination of an inequality in S+ and one in S− to eliminate the coefficient of xk. This shows that the inequalities: aik aljxj − alk akjxj ≤ aikbl − alkbi (1) j ! j ! X X for i 2 S+ and l 2 S− are satisfied by all elements of Pk. Conversely, for any vector (x1; x2; · · · ; xk−1; xk+1; · · · ; xn) satisfying (1) for all i 2 S+ and l 2 S− and also T ai x ≤ bi for all i 2 S0 (2) we can find a value of xk such that the resulting x belongs to P (by looking at the bounds on xk that each constraint imposes, and showing that the largest lower bound is smaller than the smallest upper bound).
    [Show full text]
  • ADDENDUM the Following Remarks Were Added in Proof (November 1966). Page 67. an Easy Modification of Exercise 4.8.25 Establishes
    ADDENDUM The following remarks were added in proof (November 1966). Page 67. An easy modification of exercise 4.8.25 establishes the follow­ ing result of Wagner [I]: Every simplicial k-"complex" with at most 2 k ~ vertices has a representation in R + 1 such that all the "simplices" are geometric (rectilinear) simplices. Page 93. J. H. Conway (private communication) has established the validity of the conjecture mentioned in the second footnote. Page 126. For d = 2, the theorem of Derry [2] given in exercise 7.3.4 was found earlier by Bilinski [I]. Page 183. M. A. Perles (private communication) recently obtained an affirmative solution to Klee's problem mentioned at the end of section 10.1. Page 204. Regarding the question whether a(~) = 3 implies b(~) ~ 4, it should be noted that if one starts from a topological cell complex ~ with a(~) = 3 it is possible that ~ is not a complex (in our sense) at all (see exercise 11.1.7). On the other hand, G. Wegner pointed out (in a private communication to the author) that the 2-complex ~ discussed in the proof of theorem 11.1 .7 indeed satisfies b(~) = 4. Page 216. Halin's [1] result (theorem 11.3.3) has recently been genera­ lized by H. A. lung to all complete d-partite graphs. (Halin's result deals with the graph of the d-octahedron, i.e. the d-partite graph in which each class of nodes contains precisely two nodes.) The existence of the numbers n(k) follows from a recent result of Mader [1] ; Mader's result shows that n(k) ~ k.2(~) .
    [Show full text]
  • Combinatorial Optimization, Packing and Covering
    Combinatorial Optimization: Packing and Covering G´erard Cornu´ejols Carnegie Mellon University July 2000 1 Preface The integer programming models known as set packing and set cov- ering have a wide range of applications, such as pattern recognition, plant location and airline crew scheduling. Sometimes, due to the spe- cial structure of the constraint matrix, the natural linear programming relaxation yields an optimal solution that is integer, thus solving the problem. Sometimes, both the linear programming relaxation and its dual have integer optimal solutions. Under which conditions do such integrality properties hold? This question is of both theoretical and practical interest. Min-max theorems, polyhedral combinatorics and graph theory all come together in this rich area of discrete mathemat- ics. In addition to min-max and polyhedral results, some of the deepest results in this area come in two flavors: “excluded minor” results and “decomposition” results. In these notes, we present several of these beautiful results. Three chapters cover min-max and polyhedral re- sults. The next four cover excluded minor results. In the last three, we present decomposition results. We hope that these notes will encourage research on the many intriguing open questions that still remain. In particular, we state 18 conjectures. For each of these conjectures, we offer $5000 as an incentive for the first correct solution or refutation before December 2020. 2 Contents 1Clutters 7 1.1 MFMC Property and Idealness . 9 1.2 Blocker . 13 1.3 Examples .......................... 15 1.3.1 st-Cuts and st-Paths . 15 1.3.2 Two-Commodity Flows . 17 1.3.3 r-Cuts and r-Arborescences .
    [Show full text]
  • Polyhedral Combinatorics : an Annotated Bibliography
    Polyhedral combinatorics : an annotated bibliography Citation for published version (APA): Aardal, K. I., & Weismantel, R. (1996). Polyhedral combinatorics : an annotated bibliography. (Universiteit Utrecht. UU-CS, Department of Computer Science; Vol. 9627). Utrecht University. Document status and date: Published: 01/01/1996 Document Version: Publisher’s PDF, also known as Version of Record (includes final page, issue and volume numbers) Please check the document version of this publication: • A submitted manuscript is the version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version and the galley proof are versions of the publication after peer review. • The final published version features the final layout of the paper including the volume, issue and page numbers. Link to publication General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal.
    [Show full text]