A New Facet Generating Procedure for the Stable Set Polytope
|
|
- Blaise Alexander
- 6 years ago
- Views:
Transcription
1 1 / 22 A New Facet Generating Procedure for the Stable Set Polytope Álinson S. Xavier a Manoel Campêlo b a Mestrado e Doutorado em Ciência da Computação Universidade Federal do Ceará Fortaleza, Brazil b Departamento de Estatística e Matemática Aplicada Universidade Federal do Ceará Fortaleza, Brazil LAGOS 11
2 2 / 22 Outline 1. Introduction 2. Preliminaries 3. The Procedure Concluding Remarks
3 3 / 22 Stable Set Polytope: Definition Given a simple, undirected graph G = (V, E) Definition A stable set is a set of pairwise non-adjacent vertices. Not an example
4 3 / 22 Stable Set Polytope: Definition Given a simple, undirected graph G = (V, E) Definition A stable set is a set of pairwise non-adjacent vertices. Not an example Definition The stable set polytope is the convex hull of the incidence vectors of all the stable sets: STAB(G) = conv{x {0, 1} V : x u + x v 1, {u, v} E}
5 4 / 22 Stable Set Polytope: Applications Applications in various fields (Bomze, Budinich, Pardalos & Pedillo (1999)): Coding theory Computer vision and pattern matching Molecular biology Scheduling
6 4 / 22 Stable Set Polytope: Applications Applications in various fields (Bomze, Budinich, Pardalos & Pedillo (1999)): Coding theory Computer vision and pattern matching Molecular biology Scheduling Model other important combinatorial problems: Set packing and set partitioning (Padberg (1973)) Graph coloring (Cornaz & Jost (2008))
7 5 / 22 Previous Research: Facet Producing Subgraphs Facet producing subgraphs: Cliques (Padberg (1973)) P 5 i=1 x i 1
8 5 / 22 Previous Research: Facet Producing Subgraphs Facet producing subgraphs: Cliques (Padberg (1973)) Odd holes (Padberg (1973)) Odd anti-holes (Nemhauser & Trotter (1974)) P 7 i=1 x i 3
9 5 / 22 Previous Research: Facet Producing Subgraphs Facet producing subgraphs: Cliques (Padberg (1973)) Odd holes (Padberg (1973)) Odd anti-holes (Nemhauser & Trotter (1974)) Webs and anti-webs (Trotter (1975)) P 7 i=1 x i 2
10 5 / 22 Previous Research: Facet Producing Subgraphs Facet producing subgraphs: Cliques (Padberg (1973)) Odd holes (Padberg (1973)) Odd anti-holes (Nemhauser & Trotter (1974)) Webs and anti-webs (Trotter (1975)) Subdivided wheels (Cheng & Cunningham (1996)) x 8 + P 7 i=1 x i 3
11 5 / 22 Previous Research: Facet Producing Subgraphs Facet producing subgraphs: Cliques (Padberg (1973)) Odd holes (Padberg (1973)) Odd anti-holes (Nemhauser & Trotter (1974)) Webs and anti-webs (Trotter (1975)) Subdivided wheels (Cheng & Cunningham (1996)) others x 8 + P 7 i=1 x i 3
12 6 / 22 Previous Research: Facet Generating Procedures Facet generating procedures: Subdividing edges (Wolsey (1976)) x 6 + P 5 i=1 x i 2 2x 6 + P 5 i=1 x i + x 7 + x 8 3
13 6 / 22 Previous Research: Facet Generating Procedures Facet generating procedures: Subdividing edges (Wolsey (1976)) Subdividing stars (Barahona & Mahjoub (1994)) x 6 + P 5 i=1 x i 2 3x 6 + P 5 i=1 x i + P 11 i=7 x i 5
14 6 / 22 Previous Research: Facet Generating Procedures Facet generating procedures: Subdividing edges (Wolsey (1976)) Subdividing stars (Barahona & Mahjoub (1994)) Replacing vertices with stars (Cánovas, Landete & Marín (2003)) x 1 + P 5 i=2 x i 1 2x 1 + P 5 i=2 x i + P 8 i=6 x i 3
15 6 / 22 Previous Research: Facet Generating Procedures Facet generating procedures: Subdividing edges (Wolsey (1976)) Subdividing stars (Barahona & Mahjoub (1994)) Replacing vertices with stars (Cánovas, Landete & Marín (2003)) Replacing edges with gears (Galluccio, Gentile & Ventura (2008)) P 3 i=1 x i + x 4 + x 5 2 P 3 i=1 x i + 2x 4 + 2x 5 + P 11 i=6 x i 4
16 6 / 22 Previous Research: Facet Generating Procedures Facet generating procedures: Subdividing edges (Wolsey (1976)) Subdividing stars (Barahona & Mahjoub (1994)) Replacing vertices with stars (Cánovas, Landete & Marín (2003)) Replacing edges with gears (Galluccio, Gentile & Ventura (2008)) others P 3 i=1 x i + x 4 + x 5 2 P 3 i=1 x i + 2x 4 + 2x 5 + P 11 i=6 x i 4
17 7 / 22 The New Procedure Replace (k 1)-cliques with certain k-partite graphs Particular case: replace vertices with bipartite graphs
18 7 / 22 The New Procedure Replace (k 1)-cliques with certain k-partite graphs Particular case: replace vertices with bipartite graphs Unifies and generalizes many previous procedures: Subdividing edges Subdividing stars Replacing vertices with stars
19 7 / 22 The New Procedure Replace (k 1)-cliques with certain k-partite graphs Particular case: replace vertices with bipartite graphs Unifies and generalizes many previous procedures: Subdividing edges Subdividing stars Replacing vertices with stars Generates many new facet-defining inequalities
20 7 / 22 The New Procedure Replace (k 1)-cliques with certain k-partite graphs Particular case: replace vertices with bipartite graphs Unifies and generalizes many previous procedures: Subdividing edges Subdividing stars Replacing vertices with stars Generates many new facet-defining inequalities The idea that leads to the procedure can be used with other polytopes
21 Preliminaries 8 / 22
22 9 / 22 Affine Isomorphism Definition (Ziegler (1994)) Two polytopes are affinely isomorphic (not. P 1 = P2) if there is an affine map that is a bijection between their points.
23 9 / 22 Affine Isomorphism Definition (Ziegler (1994)) Two polytopes are affinely isomorphic (not. P 1 = P2) if there is an affine map that is a bijection between their points. Implies combinatorial equivalence
24 9 / 22 Affine Isomorphism Definition (Ziegler (1994)) Two polytopes are affinely isomorphic (not. P 1 = P2) if there is an affine map that is a bijection between their points. Implies combinatorial equivalence Easy to transform facets of P 1 into facets of P 2
25 10 / 22 Facets from Faces: Overview Convert facets of a face F into facets of the polytope P:
26 10 / 22 Facets from Faces: Overview Convert facets of a face F into facets of the polytope P: Find a sequence F 1,..., F k such that: F 1 = F and F k = P F i is a facet of F i+1 Repeatedly apply the following theorem:
27 10 / 22 Facets from Faces: Overview Convert facets of a face F into facets of the polytope P: Find a sequence F 1,..., F k such that: F 1 = F and F k = P F i is a facet of F i+1 Repeatedly apply the following theorem: Theorem Let P be a convex polytope and S a finite set such that P = conv(s). If cx d is facet-defining for P and πx π is facet-defining for {x P : cx = d}, then πx + α(cx d) π is facet-defining for P, where α = max j π πx cx d ff : x S, cx < d
28 10 / 22 Facets from Faces: Overview Convert facets of a face F into facets of the polytope P: Find a sequence F 1,..., F k such that: F 1 = F and F k = P F i is a facet of F i+1 Repeatedly apply the following theorem: Theorem Let P be a convex polytope and S a finite set such that P = conv(s). If cx d is facet-defining for P and πx π is facet-defining for {x P : cx = d}, then πx + α(cx d) π is facet-defining for P, where α = max j π πx cx d ff : x S, cx < d Extension of the sequential lifting procedure Different sequences may yield different facets
29 11 / 22 Facets from Faces: Geometric View P = conv{(0, 0), (2, 0), (2, 1), (1, 2), (0, 1)}
30 11 / 22 Facets from Faces: Geometric View P = conv{(0, 0), (2, 0), (2, 1), (1, 2), (0, 1)} F = {x P : x 1 + x 2 = 3}
31 11 / 22 Facets from Faces: Geometric View P = conv{(0, 0), (2, 0), (2, 1), (1, 2), (0, 1)} F = {x P : x 1 + x 2 = 3} x 1 1 is facet-defining for F
32 11 / 22 Facets from Faces: Geometric View P = conv{(0, 0), (2, 0), (2, 1), (1, 2), (0, 1)} F = {x P : x 1 + x 2 = 3} x 1 1 is facet-defining for F n o α = max x x 1 x 2 : x P, x 1 + x 2 < 3 = 1 2
33 11 / 22 Facets from Faces: Geometric View P = conv{(0, 0), (2, 0), (2, 1), (1, 2), (0, 1)} F = {x P : x 1 + x 2 = 3} x 1 1 is facet-defining for F n o α = max x x 1 x 2 : x P, x 1 + x 2 < 3 x (x1 + x2 3) 1 2 = 1 2
34 11 / 22 Facets from Faces: Geometric View P = conv{(0, 0), (2, 0), (2, 1), (1, 2), (0, 1)} F = {x P : x 1 + x 2 = 3} x 1 1 is facet-defining for F n o α = max x x 1 x 2 : x P, x 1 + x 2 < 3 x (x1 + x2 3) 1 2 x 1 + x 2 1 is facet-defining for P = 1 2
35 12 / 22 Strong Hypertrees: Definitions Definition Two hyperedges are strongly adjacent if they have same size k and share exactly k 1 vertices. Not an example
36 12 / 22 Strong Hypertrees: Definitions Definition A hypergraph H = (V, E) is a strong hypertree either if E = {V } or there is a leaf v incident to an hyperedge e such that: e is strongly adjacent to some other hyperedge, (V \ {v}, E \ {e}) is also a strong hypertree. (hyperedges are represented as cliques)
37 12 / 22 Strong Hypertrees: Definitions Definition A hypergraph H = (V, E) is a strong hypertree either if E = {V } or there is a leaf v incident to an hyperedge e such that: e is strongly adjacent to some other hyperedge, (V \ {v}, E \ {e}) is also a strong hypertree. (hyperedges are represented as cliques)
38 12 / 22 Strong Hypertrees: Definitions Definition A hypergraph H = (V, E) is a strong hypertree either if E = {V } or there is a leaf v incident to an hyperedge e such that: e is strongly adjacent to some other hyperedge, (V \ {v}, E \ {e}) is also a strong hypertree. (hyperedges are represented as cliques)
39 12 / 22 Strong Hypertrees: Definitions Definition A hypergraph H = (V, E) is a strong hypertree either if E = {V } or there is a leaf v incident to an hyperedge e such that: e is strongly adjacent to some other hyperedge, (V \ {v}, E \ {e}) is also a strong hypertree. (hyperedges are represented as cliques)
40 12 / 22 Strong Hypertrees: Definitions Definition A hypergraph H = (V, E) is a strong hypertree either if E = {V } or there is a leaf v incident to an hyperedge e such that: e is strongly adjacent to some other hyperedge, (V \ {v}, E \ {e}) is also a strong hypertree. (hyperedges are represented as cliques)
41 12 / 22 Strong Hypertrees: Definitions Definition A hypergraph H = (V, E) is a strong hypertree either if E = {V } or there is a leaf v incident to an hyperedge e such that: e is strongly adjacent to some other hyperedge, (V \ {v}, E \ {e}) is also a strong hypertree. (hyperedges are represented as cliques)
42 12 / 22 Strong Hypertrees: Definitions Definition A hypergraph H = (V, E) is a strong hypertree either if E = {V } or there is a leaf v incident to an hyperedge e such that: e is strongly adjacent to some other hyperedge, (V \ {v}, E \ {e}) is also a strong hypertree. (hyperedges are represented as cliques)
43 12 / 22 Strong Hypertrees: Definitions Definition A hypergraph H = (V, E) is a strong hypertree either if E = {V } or there is a leaf v incident to an hyperedge e such that: e is strongly adjacent to some other hyperedge, (V \ {v}, E \ {e}) is also a strong hypertree. (hyperedges are represented as cliques)
44 12 / 22 Strong Hypertrees: Definitions Definition A hypergraph H = (V, E) is a strong hypertree either if E = {V } or there is a leaf v incident to an hyperedge e such that: e is strongly adjacent to some other hyperedge, (V \ {v}, E \ {e}) is also a strong hypertree. (hyperedges are represented as cliques)
45 12 / 22 Strong Hypertrees: Definitions Definition A hypergraph H = (V, E) is a strong hypertree either if E = {V } or there is a leaf v incident to an hyperedge e such that: e is strongly adjacent to some other hyperedge, (V \ {v}, E \ {e}) is also a strong hypertree. (hyperedges are represented as cliques)
46 12 / 22 Strong Hypertrees: Definitions Definition A hypergraph H = (V, E) is a strong hypertree either if E = {V } or there is a leaf v incident to an hyperedge e such that: e is strongly adjacent to some other hyperedge, (V \ {v}, E \ {e}) is also a strong hypertree. (hyperedges are represented as cliques)
47 12 / 22 Strong Hypertrees: Definitions Definition A hypergraph H = (V, E) is a strong hypertree either if E = {V } or there is a leaf v incident to an hyperedge e such that: e is strongly adjacent to some other hyperedge, (V \ {v}, E \ {e}) is also a strong hypertree. (hyperedges are represented as cliques)
48 12 / 22 Strong Hypertrees: Definitions Definition A hypergraph H = (V, E) is a strong hypertree either if E = {V } or there is a leaf v incident to an hyperedge e such that: e is strongly adjacent to some other hyperedge, (V \ {v}, E \ {e}) is also a strong hypertree. Not an example Not an example
49 12 / 22 Strong Hypertrees: Definitions Definition A strong hypertree is a strong hyperpath if it has exactly two leaves.
50 13 / 22 Strong Hypertrees: Properties Similarly to ordinary trees: Proposition Every strong hypertree with n vertices: is a k-uniform hypergraph, for some k has n k + 1 hyperedges k = 3 V = 10 E = 8
51 13 / 22 Strong Hypertrees: Properties Similarly to ordinary trees: Proposition Every strong hypertree with n vertices: is a k-uniform hypergraph, for some k has n k + 1 hyperedges has a full rank incidence matrix k = 3 V = 10 E = 8
52 13 / 22 Strong Hypertrees: Properties Similarly to ordinary trees: Proposition Every strong hypertree with n vertices: is a k-uniform hypergraph, for some k has n k + 1 hyperedges has a full rank incidence matrix contains a strong hyperpath between any pair of non-adjacent vertices k = 3 V = 10 E = 8
53 The Procedure 14 / 22
54 15 / 22 The Procedure: Context Q: set of maximal cliques of G C(G) = (V, Q): clique hypergraph of G T = (V T, Q T ) C(G): A k-uniform strong hypertree such that: G[V T ] is k-partite with classes V 1,..., V k No vertex in V 0 := V \ V T has neighbors in all classes V 1,..., V k V 0 = {6, 7, 8} V 1 = {2, 4} V 2 = {3, 5} V 3 = {1} 7
55 15 / 22 The Procedure: Context Q: set of maximal cliques of G C(G) = (V, Q): clique hypergraph of G T = (V T, Q T ) C(G): A k-uniform strong hypertree such that: G[V T ] is k-partite with classes V 1,..., V k No vertex in V 0 := V \ V T has neighbors in all classes V 1,..., V k Consider the face F T = {x STAB(G) : x Q = 1, Q Q T } V 0 = {6, 7, 8} V 1 = {2, 4} V 2 = {3, 5} V 3 = {1} 8 < x 1 + x 2 + x 3 = 1 F T = : x STAB(G) : x 1 + x 3 + x 4 = 1 x 1 + x 4 + x 5 = 1 9 = ;
56 16 / 22 The Procedure: Lemmas 1 and 2 Lemma The dimension of F T is V Q T.
57 16 / 22 The Procedure: Lemmas 1 and 2 Lemma The dimension of F T is V Q T. Each hyperedge we remove from T increases the dimension of F T by exactly one (if the remaining hypergraph is still a strong hypertree) Useful when building the sequence of faces
58 16 / 22 The Procedure: Lemmas 1 and 2 Lemma The dimension of F T is V Q T. Each hyperedge we remove from T increases the dimension of F T by exactly one (if the remaining hypergraph is still a strong hypertree) Useful when building the sequence of faces Lemma If x F T, then x u = x v, for all u, v V i, i {1,..., k}.
59 16 / 22 The Procedure: Lemmas 1 and 2 Lemma The dimension of F T is V Q T. Each hyperedge we remove from T increases the dimension of F T by exactly one (if the remaining hypergraph is still a strong hypertree) Useful when building the sequence of faces Lemma If x F T, then x u = x v, for all u, v V i, i {1,..., k}. Each class can be seen as a single vertex V k is selected if and only if no other class is selected
60 17 / 22 The Procedure: Lemma 3 Consider the graph G T obtained from G by: Contracting each class V i into a vertex v i V i, for i {1,..., k 1} Removing the vertices of V k
61 17 / 22 The Procedure: Lemma 3 Consider the graph G T obtained from G by: Contracting each class V i into a vertex v i V i, for i {1,..., k 1} Removing the vertices of V k Lemma If V 0 has no neighbors in V K then F T is affinely isomorphic to STAB(G T ).
62 17 / 22 The Procedure: Lemma 3 Consider the graph G T obtained from G by: Contracting each class V i into a vertex v i V i, for i {1,..., k 1} Removing the vertices of V k Lemma If V 0 has no neighbors in V K then F T is affinely isomorphic to STAB(G T ).
63 17 / 22 The Procedure: Lemma 3 Consider the graph G T obtained from G by: Contracting each class V i into a vertex v i V i, for i {1,..., k 1} Removing the vertices of V k Lemma If V 0 has no neighbors in V K then F T is affinely isomorphic to STAB(G T ).
64 17 / 22 The Procedure: Lemma 3 Consider the graph G T obtained from G by: Contracting each class V i into a vertex v i V i, for i {1,..., k 1} Removing the vertices of V k Lemma If V 0 has no neighbors in V K then F T is affinely isomorphic to STAB(G T ).
65 17 / 22 The Procedure: Lemma 3 Consider the graph G T obtained from G by: Contracting each class V i into a vertex v i V i, for i {1,..., k 1} Removing the vertices of V k Lemma If V 0 has no neighbors in V K then F T is affinely isomorphic to STAB(G T ).
66 17 / 22 The Procedure: Lemma 3 Consider the graph G T obtained from G by: Contracting each class V i into a vertex v i V i, for i {1,..., k 1} Removing the vertices of V k Lemma If V 0 has no neighbors in V K then F T is affinely isomorphic to STAB(G T ).
67 18 / 22 The Procedure: Main Theorem Theorem Suppose that V 0 has no neighbors in V K. If X π v x v π (1) v V (G T ) is facet-defining for STAB(G T ), then there exists α Q, Q Q T, such that X π v x v + X α Q (x Q 1) π (2) Q Q T v V (G T ) is facet-defining for STAB(G). Sketch of the proof. The inequality (1) is facet-defining for F T (lemma 3) Remove one hyperedge at a time from T, but keeping it a strong hypertree Each removal increases dim(f T ) by exactly one (lemma 1) We have the sequence needed for the procedure outlined previously
68 19 / 22
69 20 / 22 The Procedure:
70 20 / 22 The Procedure: P 8 i=4 x i 1 is facet-defining for STAB(G T )
71 20 / 22 The Procedure: P 8 i=4 x i 1 is facet-defining for F T
72 20 / 22 The Procedure: P 8 i=4 x i 8 1 is facet-defining for F T < P α = max 8 : i=4 x i 1 : x STAB(G), x 1 + x 2 + x 3 = 0, x 1 + x 3 + x 4 = 1, x 1 + x 4 + x 5 = 1 9 = ; = 1
73 20 / 22 The Procedure: P 3 i=1 x i + P 8 i=4 x i 2 is facet-defining for F T
74 20 / 22 The Procedure: P 3 i=1 x i + P 8 8 i=4 x i 2 is facet-defining for F T 9 < P α = max 3 : i=1 x i + P = 8 i=4 x i 2 : x STAB(G), x 1 + x 3 + x 4 = 0, x 1 + x 4 + x 5 = 1 ; = 1
75 20 / 22 The Procedure: x 1 + x 2 + 2x 3 + 2x 4 + P 8 i=5 x i 3 is facet-defining for F T
76 20 / 22 The Procedure: x 1 + x 2 + 2x 3 + 2x 4 + P 8 8 i=5 x i 3 is facet-defining for F T < α = max : 2x 1 + x 2 + 2x 3 + 2x 4 + P 8 i=5 x i 3 : x STAB(G), x 1 + x 4 + x 5 = 0 9 = ; = 0
77 20 / 22 The Procedure: x 1 + x 2 + 2x 3 + 2x 4 + P 8 i=5 x i 3 is facet-defining for STAB(G)
78 21 / 22 Concluding Remarks We presented a new facet generating procedure which: Unifies and generalizes many previous procedures Generates new facet-defining inequalities
79 21 / 22 Concluding Remarks We presented a new facet generating procedure which: Unifies and generalizes many previous procedures Generates new facet-defining inequalities We also introduced the concept of strong hypertree
80 21 / 22 Concluding Remarks We presented a new facet generating procedure which: Unifies and generalizes many previous procedures Generates new facet-defining inequalities We also introduced the concept of strong hypertree Future research: Use the procedure to find new facet producing subgraphs Apply the main idea to other polytopes: Find faces that are affinely isomorphic to known polytopes Convert their facets into facets of the polytope
81 Thank you! 22 / 22
2-clique-bond of stable set polyhedra
2-clique-bond of stable set polyhedra Anna Galluccio, Claudio Gentile, and Paolo Ventura IASI-CNR, viale Manzoni 30, 00185 Rome (Italy) E mail: {galluccio,gentile,ventura}@iasi.cnr.it Abstract The 2-bond
More informationInteger Programming ISE 418. Lecture 12. Dr. Ted Ralphs
Integer Programming ISE 418 Lecture 12 Dr. Ted Ralphs ISE 418 Lecture 12 1 Reading for This Lecture Nemhauser and Wolsey Sections II.2.1 Wolsey Chapter 9 ISE 418 Lecture 12 2 Generating Stronger Valid
More informationLOVÁSZ-SCHRIJVER SDP-OPERATOR AND A SUPERCLASS OF NEAR-PERFECT GRAPHS
LOVÁSZ-SCHRIJVER SDP-OPERATOR AND A SUPERCLASS OF NEAR-PERFECT GRAPHS S. BIANCHI, M. ESCALANTE, G. NASINI, L. TUNÇEL Abstract. We study the Lovász-Schrijver SDP-operator applied to the fractional stable
More informationIBM Research Report. On a Connection between Facility Location and Perfect Graphs. Mourad Baïou University of Clermont
RC24885 (W0910-175) October 28, 2009 Mathematics IBM Research Report On a Connection between Facility Location and Perfect Graphs Mourad Baïou University of Clermont Francisco Barahona IBM Research Division
More informationSolving the MWT. Recall the ILP for the MWT. We can obtain a solution to the MWT problem by solving the following ILP:
Solving the MWT Recall the ILP for the MWT. We can obtain a solution to the MWT problem by solving the following ILP: max subject to e i E ω i x i e i C E x i {0, 1} x i C E 1 for all critical mixed cycles
More informationOptimization Exercise Set n. 4 :
Optimization Exercise Set n. 4 : Prepared by S. Coniglio and E. Amaldi translated by O. Jabali 2018/2019 1 4.1 Airport location In air transportation, usually there is not a direct connection between every
More informationInteger Programming (reduced to 180 minutes)
Integer Programming (reduced to 10 minutes) 1 1 Departamento de Estadística e Investigación Operativa Universidad de Murcia doc-course Constructive approximation, Optimization and Mathematical Modeling
More informationON THE INTEGRALITY OF THE UNCAPACITATED FACILITY LOCATION POLYTOPE. 1. Introduction
ON THE INTEGRALITY OF THE UNCAPACITATED FACILITY LOCATION POLYTOPE MOURAD BAÏOU AND FRANCISCO BARAHONA Abstract We study a system of linear inequalities associated with the uncapacitated facility location
More informationAND ORBITOPES TIM JANUSCHOWSKI AND MARC E. PFETSCH
THE MAXIMUM k-colorable SUBGRAPH PROBLEM AND ORBITOPES TIM JANUSCHOWSKI AND MARC E. PFETSCH Abstract. Given an undirected node-weighted graph and a positive integer k, the maximum k-colorable subgraph
More informationThe extreme points of QSTAB(G) and its implications
Konrad-Zuse-Zentrum für Informationstechnik Berlin Takustraße 7 D-14195 Berlin-Dahlem Germany ARIE M.C.A. KOSTER ANNEGRET K. WAGLER The extreme points of QSTAB(G) and its implications ZIB-Report 06 30
More informationOptimization Exercise Set n.5 :
Optimization Exercise Set n.5 : Prepared by S. Coniglio translated by O. Jabali 2016/2017 1 5.1 Airport location In air transportation, usually there is not a direct connection between every pair of airports.
More informationThe Matching Polytope: General graphs
8.433 Combinatorial Optimization The Matching Polytope: General graphs September 8 Lecturer: Santosh Vempala A matching M corresponds to a vector x M = (0, 0,,, 0...0) where x M e is iff e M and 0 if e
More informationThe Chromatic Symmetric Function: Hypergraphs and Beyond
The : Hypergraphs and Beyond arxiv:6.0969 Department of Mathematics Michigan State University Graduate Student Combinatorics Conference, April 07 Outline Introducing the chromatic symmetric function Definition
More informationSEQUENTIAL AND SIMULTANEOUS LIFTING IN THE NODE PACKING POLYHEDRON JEFFREY WILLIAM PAVELKA. B.S., Kansas State University, 2011
SEQUENTIAL AND SIMULTANEOUS LIFTING IN THE NODE PACKING POLYHEDRON by JEFFREY WILLIAM PAVELKA B.S., Kansas State University, 2011 A THESIS Submitted in partial fulfillment of the requirements for the degree
More information3.8 Strong valid inequalities
3.8 Strong valid inequalities By studying the problem structure, we can derive strong valid inequalities which lead to better approximations of the ideal formulation conv(x ) and hence to tighter bounds.
More informationPartial characterizations of clique-perfect graphs II: diamond-free and Helly circular-arc graphs
Partial characterizations of clique-perfect graphs II: diamond-free and Helly circular-arc graphs Flavia Bonomo a,1, Maria Chudnovsky b,2 and Guillermo Durán c,3 a Departamento de Matemática, Facultad
More informationDiscrete Optimization 2010 Lecture 7 Introduction to Integer Programming
Discrete Optimization 2010 Lecture 7 Introduction to Integer Programming Marc Uetz University of Twente m.uetz@utwente.nl Lecture 8: sheet 1 / 32 Marc Uetz Discrete Optimization Outline 1 Intro: The Matching
More informationSUNS: A NEW CLASS OF FACET DEFINING STRUCTURES FOR THE NODE PACKING POLYHEDRON CHELSEA NICOLE IRVINE. B.S., Kansas State University, 2012
SUNS: A NEW CLASS OF FACET DEFINING STRUCTURES FOR THE NODE PACKING POLYHEDRON by CHELSEA NICOLE IRVINE B.S., Kansas State University, 01 A THESIS Submitted in partial fulfillment of the requirements for
More informationOrbitopes. Marc Pfetsch. joint work with Volker Kaibel. Zuse Institute Berlin
Orbitopes Marc Pfetsch joint work with Volker Kaibel Zuse Institute Berlin What this talk is about We introduce orbitopes. A polyhedral way to break symmetries in integer programs. Introduction 2 Orbitopes
More informationLifting theorems and facet characterization for a class of clique partitioning inequalities
Operations Research Letters 24 (1999) 235 243 www.elsevier.com/locate/orms Lifting theorems and facet characterization for a class of clique partitioning inequalities Hans-Jurgen Bandelt a, Maarten Oosten
More informationChapter 1. Preliminaries
Introduction This dissertation is a reading of chapter 4 in part I of the book : Integer and Combinatorial Optimization by George L. Nemhauser & Laurence A. Wolsey. The chapter elaborates links between
More informationCutting planes from extended LP formulations
Cutting planes from extended LP formulations Merve Bodur University of Wisconsin-Madison mbodur@wisc.edu Sanjeeb Dash IBM Research sanjeebd@us.ibm.com March 7, 2016 Oktay Günlük IBM Research gunluk@us.ibm.com
More informationThe minimum G c cut problem
The minimum G c cut problem Abstract In this paper we define and study the G c -cut problem. Given a complete undirected graph G = (V ; E) with V = n, edge weighted by w(v i, v j ) 0 and an undirected
More informationHow tight is the corner relaxation? Insights gained from the stable set problem
How tight is the corner relaxation? Insights gained from the stable set problem Gérard Cornuéjols a,1, Carla Michini b,,, Giacomo Nannicini c,3 a Tepper School of Business, Carnegie Mellon University,
More informationInduced Saturation of Graphs
Induced Saturation of Graphs Maria Axenovich a and Mónika Csikós a a Institute of Algebra and Geometry, Karlsruhe Institute of Technology, Englerstraße 2, 76128 Karlsruhe, Germany Abstract A graph G is
More informationProperties and Classification of the Wheels of the OLS Polytope.
Properties and Classification of the Wheels of the OLS Polytope. G. Appa 1, D. Magos 2, I. Mourtos 1 1 Operational Research Department, London School of Economics. email: {g.appa, j.mourtos}@lse.ac.uk
More information4 Packing T-joins and T-cuts
4 Packing T-joins and T-cuts Introduction Graft: A graft consists of a connected graph G = (V, E) with a distinguished subset T V where T is even. T-cut: A T -cut of G is an edge-cut C which separates
More informationInduced Cycles of Fixed Length
Induced Cycles of Fixed Length Terry McKee Wright State University Dayton, Ohio USA terry.mckee@wright.edu Cycles in Graphs Vanderbilt University 31 May 2012 Overview 1. Investigating the fine structure
More informationMy Favorite Theorem: Characterizations of Perfect Graphs
Konrad-Zuse-Zentrum für Informationstechnik Berlin Takustraße 7 D-14195 Berlin-Dahlem Germany MARTIN GRÖTSCHEL My Favorite Theorem: Characterizations of Perfect Graphs Preprint SC 99-17 (June 1999) MY
More informationPolyhedral Approaches to Online Bipartite Matching
Polyhedral Approaches to Online Bipartite Matching Alejandro Toriello joint with Alfredo Torrico, Shabbir Ahmed Stewart School of Industrial and Systems Engineering Georgia Institute of Technology Industrial
More informationInteger program reformulation for robust branch-and-cut-and-price
Integer program reformulation for robust branch-and-cut-and-price Marcus Poggi de Aragão Informática PUC-Rio Eduardo Uchoa Engenharia de Produção Universidade Federal Fluminense Outline of the talk Robust
More informationPartial characterizations of clique-perfect graphs I: subclasses of claw-free graphs
Partial characterizations of clique-perfect graphs I: subclasses of claw-free graphs Flavia Bonomo a,1, Maria Chudnovsky b,2 and Guillermo Durán c,3 a Departamento de Computación, Facultad de Ciencias
More informationFacets from Gadgets. Adam N. Letchford Anh Vu. December 2017
Facets from Gadgets Adam N. Letchford Anh Vu December 2017 Abstract We present a new tool for generating cutting planes for N P-hard combinatorial optimisation problems. It is based on the concept of gadgets
More informationTriangle-free graphs that do not contain an induced subdivision of K 4 are 3-colorable
Triangle-free graphs that do not contain an induced subdivision of K 4 are 3-colorable Maria Chudnovsky Princeton University, Princeton, NJ 08544 Chun-Hung Liu Princeton University, Princeton, NJ 08544
More informationGraph coloring, perfect graphs
Lecture 5 (05.04.2013) Graph coloring, perfect graphs Scribe: Tomasz Kociumaka Lecturer: Marcin Pilipczuk 1 Introduction to graph coloring Definition 1. Let G be a simple undirected graph and k a positive
More informationEven Cycles in Hypergraphs.
Even Cycles in Hypergraphs. Alexandr Kostochka Jacques Verstraëte Abstract A cycle in a hypergraph A is an alternating cyclic sequence A 0, v 0, A 1, v 1,..., A k 1, v k 1, A 0 of distinct edges A i and
More informationRecursive generation of partitionable graphs
Recursive generation of partitionable graphs E. Boros V. Gurvich S. Hougardy May 29, 2002 Abstract Results of Lovász (1972) and Padberg (1974) imply that partitionable graphs contain all the potential
More informationCircular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs
Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs Friedrich Eisenbrand Gianpaolo Oriolo Gautier Stauffer Paolo Ventura Abstract It is a long standing open problem to find an explicit
More informationCographs; chordal graphs and tree decompositions
Cographs; chordal graphs and tree decompositions Zdeněk Dvořák September 14, 2015 Let us now proceed with some more interesting graph classes closed on induced subgraphs. 1 Cographs The class of cographs
More information3. Linear Programming and Polyhedral Combinatorics
Massachusetts Institute of Technology 18.453: Combinatorial Optimization Michel X. Goemans April 5, 2017 3. Linear Programming and Polyhedral Combinatorics Summary of what was seen in the introductory
More informationInteger Programming, Part 1
Integer Programming, Part 1 Rudi Pendavingh Technische Universiteit Eindhoven May 18, 2016 Rudi Pendavingh (TU/e) Integer Programming, Part 1 May 18, 2016 1 / 37 Linear Inequalities and Polyhedra Farkas
More informationarxiv: v2 [cs.dm] 17 Nov 2012
The star and biclique coloring and choosability problems Marina Groshaus Francisco J. Soulignac Pablo Terlisky {groshaus,fsoulign,terlisky}@dc.uba.ar arxiv:1210.7269v2 [cs.dm] 17 Nov 2012 Abstract A biclique
More informationSTRUCTURE OF THE SET OF ALL MINIMAL TOTAL DOMINATING FUNCTIONS OF SOME CLASSES OF GRAPHS
Discussiones Mathematicae Graph Theory 30 (2010 ) 407 423 STRUCTURE OF THE SET OF ALL MINIMAL TOTAL DOMINATING FUNCTIONS OF SOME CLASSES OF GRAPHS K. Reji Kumar Department of Mathematics N.S.S College,
More informationHOW IS A CHORDAL GRAPH LIKE A SUPERSOLVABLE BINARY MATROID?
HOW IS A CHORDAL GRAPH LIKE A SUPERSOLVABLE BINARY MATROID? RAUL CORDOVIL, DAVID FORGE AND SULAMITA KLEIN To the memory of Claude Berge Abstract. Let G be a finite simple graph. From the pioneering work
More informationCutting Plane Methods II
6.859/5.083 Integer Programming and Combinatorial Optimization Fall 2009 Cutting Plane Methods II Gomory-Chvátal cuts Reminder P = {x R n : Ax b} with A Z m n, b Z m. For λ [0, ) m such that λ A Z n, (λ
More informationThe non-bipartite graphs with all but two eigenvalues in
The non-bipartite graphs with all but two eigenvalues in [ 1, 1] L.S. de Lima 1, A. Mohammadian 1, C.S. Oliveira 2 1 Departamento de Engenharia de Produção, Centro Federal de Educação Tecnológica Celso
More informationLP Relaxations of Mixed Integer Programs
LP Relaxations of Mixed Integer Programs John E. Mitchell Department of Mathematical Sciences RPI, Troy, NY 12180 USA February 2015 Mitchell LP Relaxations 1 / 29 LP Relaxations LP relaxations We want
More informationA Single-Exponential Fixed-Parameter Algorithm for Distance-Hereditary Vertex Deletion
A Single-Exponential Fixed-Parameter Algorithm for Distance-Hereditary Vertex Deletion Eduard Eiben a, Robert Ganian a, O-joung Kwon b a Algorithms and Complexity Group, TU Wien, Vienna, Austria b Logic
More informationAn approximate version of Hadwiger s conjecture for claw-free graphs
An approximate version of Hadwiger s conjecture for claw-free graphs Maria Chudnovsky Columbia University, New York, NY 10027, USA and Alexandra Ovetsky Fradkin Princeton University, Princeton, NJ 08544,
More informationNew Results on Graph Packing
Graph Packing p.1/18 New Results on Graph Packing Hemanshu Kaul hkaul@math.uiuc.edu www.math.uiuc.edu/ hkaul/. University of Illinois at Urbana-Champaign Graph Packing p.2/18 Introduction Let G 1 = (V
More informationOn Dominator Colorings in Graphs
On Dominator Colorings in Graphs Ralucca Michelle Gera Department of Applied Mathematics Naval Postgraduate School Monterey, CA 994, USA ABSTRACT Given a graph G, the dominator coloring problem seeks a
More informationWHEN DOES THE POSITIVE SEMIDEFINITENESS CONSTRAINT HELP IN LIFTING PROCEDURES?
MATHEMATICS OF OPERATIONS RESEARCH Vol. 6, No. 4, November 00, pp. 796 85 Printed in U.S.A. WHEN DOES THE POSITIVE SEMIDEFINITENESS CONSTRAINT HELP IN LIFTING PROCEDURES? MICHEL X. GOEMANS and LEVENT TUNÇEL
More informationACO Comprehensive Exam March 17 and 18, Computability, Complexity and Algorithms
1. Computability, Complexity and Algorithms (a) Let G(V, E) be an undirected unweighted graph. Let C V be a vertex cover of G. Argue that V \ C is an independent set of G. (b) Minimum cardinality vertex
More informationThe Turán number of sparse spanning graphs
The Turán number of sparse spanning graphs Noga Alon Raphael Yuster Abstract For a graph H, the extremal number ex(n, H) is the maximum number of edges in a graph of order n not containing a subgraph isomorphic
More informationSeparating Simple Domino Parity Inequalities
Separating Simple Domino Parity Inequalities Lisa Fleischer Adam Letchford Andrea Lodi DRAFT: IPCO submission Abstract In IPCO 2002, Letchford and Lodi describe an algorithm for separating simple comb
More informationPolyhedral results for the bipartite induced subgraph problem
Discrete Applied Mathematics 154 (2006) 2128 2149 www.elsevier.com/locate/dam Polyhedral results for the bipartite induced subgraph problem Pierre Fouilhoux, A. Ridha Mahjoub Laboratoire LIMOS, CNRS UMR
More informationTHE CO-2-PLEX POLYTOPE AND INTEGRAL SYSTEMS
THE CO-2-PLEX POLYTOPE AND INTEGRAL SYSTEMS BENJAMIN MCCLOSKY AND ILLYA V. HICKS Abstract. k-plexes are cohesive subgraphs which were introduced to relax the structure of cliques. A co-k-plex is the complement
More informationA short course on matching theory, ECNU Shanghai, July 2011.
A short course on matching theory, ECNU Shanghai, July 2011. Sergey Norin LECTURE 3 Tight cuts, bricks and braces. 3.1. Outline of Lecture Ear decomposition of bipartite graphs. Tight cut decomposition.
More informationIBM Research Report. On the Linear Relaxation of the p-median Problem I: Oriented Graphs
RC4396 (W07-007) November, 007 Mathematics IBM Research Report On the Linear Relaxation of the p-median Problem I: Oriented Graphs Mourad Baïou CNRS LIMOS Complexe scientifique des Czeaux 6377 Aubiere
More informationEnumerating minimal connected dominating sets in graphs of bounded chordality,
Enumerating minimal connected dominating sets in graphs of bounded chordality, Petr A. Golovach a,, Pinar Heggernes a, Dieter Kratsch b a Department of Informatics, University of Bergen, N-5020 Bergen,
More informationON SIZE, CIRCUMFERENCE AND CIRCUIT REMOVAL IN 3 CONNECTED MATROIDS
ON SIZE, CIRCUMFERENCE AND CIRCUIT REMOVAL IN 3 CONNECTED MATROIDS MANOEL LEMOS AND JAMES OXLEY Abstract. This paper proves several extremal results for 3-connected matroids. In particular, it is shown
More informationOn rank-width of (diamond, even hole)-free graphs
Discrete Mathematics and Theoretical Computer Science DMTCS vol. 19:1, 2017, #24 On rank-width of (diamond, even hole)-free graphs Isolde Adler 1 Ngoc Khang Le 2,3 Haiko Müller 1 Marko Radovanović 4 Nicolas
More informationMATHEMATICAL ENGINEERING TECHNICAL REPORTS. The Symmetric Quadratic Semi-Assignment Polytope
MATHEMATICAL ENGINEERING TECHNICAL REPORTS The Symmetric Quadratic Semi-Assignment Polytope Hiroo SAITO (Communicated by Kazuo MUROTA) METR 2005 21 August 2005 DEPARTMENT OF MATHEMATICAL INFORMATICS GRADUATE
More informationDECOMPOSITIONS OF MULTIGRAPHS INTO PARTS WITH THE SAME SIZE
Discussiones Mathematicae Graph Theory 30 (2010 ) 335 347 DECOMPOSITIONS OF MULTIGRAPHS INTO PARTS WITH THE SAME SIZE Jaroslav Ivančo Institute of Mathematics P.J. Šafári University, Jesenná 5 SK-041 54
More informationSeparation Techniques for Constrained Nonlinear 0 1 Programming
Separation Techniques for Constrained Nonlinear 0 1 Programming Christoph Buchheim Computer Science Department, University of Cologne and DEIS, University of Bologna MIP 2008, Columbia University, New
More informationFinite Induced Graph Ramsey Theory: On Partitions of Subgraphs
inite Induced Graph Ramsey Theory: On Partitions of Subgraphs David S. Gunderson and Vojtěch Rödl Emory University, Atlanta GA 30322. Norbert W. Sauer University of Calgary, Calgary, Alberta, Canada T2N
More informationNew Constructions of Antimagic Graph Labeling
New Constructions of Antimagic Graph Labeling Tao-Ming Wang and Cheng-Chih Hsiao Department of Mathematics Tunghai University, Taichung, Taiwan wang@thu.edu.tw Abstract An anti-magic labeling of a finite
More informationPolyhedral studies of vertex coloring problems: The standard formulation
Polyhedral studies of vertex coloring problems: The standard formulation Diego Delle Donne a,b,c, Javier Marenco a,b a Sciences Institute, National University of General Sarmiento, Buenos Aires, Argentina.
More informationThe 2 edge-disjoint 3-paths polyhedron
The 2 edge-disjoint 3-paths polyhedron Quentin Botton, Bernard Fortz, Luis Gouveia To cite this version: Quentin Botton, Bernard Fortz, Luis Gouveia. The 2 edge-disjoint 3-paths polyhedron. Annals of Telecommunications
More informationEven Pairs and Prism Corners in Square-Free Berge Graphs
Even Pairs and Prism Corners in Square-Free Berge Graphs Maria Chudnovsky Princeton University, Princeton, NJ 08544 Frédéric Maffray CNRS, Laboratoire G-SCOP, University of Grenoble-Alpes, France Paul
More informationFRACTIONAL PACKING OF T-JOINS. 1. Introduction
FRACTIONAL PACKING OF T-JOINS FRANCISCO BARAHONA Abstract Given a graph with nonnegative capacities on its edges, it is well known that the capacity of a minimum T -cut is equal to the value of a maximum
More informationPartial cubes: structures, characterizations, and constructions
Partial cubes: structures, characterizations, and constructions Sergei Ovchinnikov San Francisco State University, Mathematics Department, 1600 Holloway Ave., San Francisco, CA 94132 Abstract Partial cubes
More informationThe Strong Largeur d Arborescence
The Strong Largeur d Arborescence Rik Steenkamp (5887321) November 12, 2013 Master Thesis Supervisor: prof.dr. Monique Laurent Local Supervisor: prof.dr. Alexander Schrijver KdV Institute for Mathematics
More informationOn cordial labeling of hypertrees
On cordial labeling of hypertrees Michał Tuczyński, Przemysław Wenus, and Krzysztof Węsek Warsaw University of Technology, Poland arxiv:1711.06294v3 [math.co] 17 Dec 2018 December 19, 2018 Abstract Let
More informationOn the Dynamic Chromatic Number of Graphs
On the Dynamic Chromatic Number of Graphs Maryam Ghanbari Joint Work with S. Akbari and S. Jahanbekam Sharif University of Technology m_phonix@math.sharif.ir 1. Introduction Let G be a graph. A vertex
More information1 Matroid intersection
CS 369P: Polyhedral techniques in combinatorial optimization Instructor: Jan Vondrák Lecture date: October 21st, 2010 Scribe: Bernd Bandemer 1 Matroid intersection Given two matroids M 1 = (E, I 1 ) and
More informationFinding Cohesive Subgroups in Social Networks
Finding Cohesive Subgroups in Social Networks Illya V. Hicks Computational and Applied Mathematics Rice University RUSMP Fall Networking Conference September 19, 2009 Outline I. Basic Definitions II. III.
More informationAcyclic subgraphs with high chromatic number
Acyclic subgraphs with high chromatic number Safwat Nassar Raphael Yuster Abstract For an oriented graph G, let f(g) denote the maximum chromatic number of an acyclic subgraph of G. Let f(n) be the smallest
More informationSplit Rank of Triangle and Quadrilateral Inequalities
Split Rank of Triangle and Quadrilateral Inequalities Santanu Dey 1 Quentin Louveaux 2 June 4, 2009 Abstract A simple relaxation of two rows of a simplex tableau is a mixed integer set consisting of two
More informationarxiv: v1 [cs.dm] 10 Nov 2008
Fibonacci Index and Stability Number of Graphs: a Polyhedral Study arxiv:0811.1449v1 [cs.dm] 10 Nov 2008 Véronique Bruyère November 10, 2008 Hadrien Mélot, Abstract. The Fibonacci index of a graph is the
More informationFacet-defining inequalities for the simple graph partitioning polytope
Discrete Optimization 4 2007) 221 231 www.elsevier.com/locate/disopt Facet-defining inequalities for the simple graph partitioning polytope Michael M. Sørensen Aarhus School of Business, Department of
More informationA Note on S-Packing Colorings of Lattices
A Note on S-Packing Colorings of Lattices Wayne Goddard and Honghai Xu Department of Mathematical Sciences Clemson University, Clemson SC 964 {goddard,honghax}@clemson.edu Abstract Let a, a,..., a k be
More informationApproximation algorithms and hardness results for the clique packing problem. October, 2007
Approximation algorithms and hardness results for the clique packing problem F. Chataigner 1 G. Manić 2 Y.Wakabayashi 1 R. Yuster 3 1 Instituto de Matemática e Estatística Universidade de São Paulo, SP,
More informationGraph Packing - Conjectures and Results
Graph Packing p.1/23 Graph Packing - Conjectures and Results Hemanshu Kaul kaul@math.iit.edu www.math.iit.edu/ kaul. Illinois Institute of Technology Graph Packing p.2/23 Introduction Let G 1 = (V 1,E
More informationGraph Coloring Inequalities from All-different Systems
Constraints manuscript No (will be inserted by the editor) Graph Coloring Inequalities from All-different Systems David Bergman J N Hooker Received: date / Accepted: date Abstract We explore the idea of
More informationPreliminaries. Graphs. E : set of edges (arcs) (Undirected) Graph : (i, j) = (j, i) (edges) V = {1, 2, 3, 4, 5}, E = {(1, 3), (3, 2), (2, 4)}
Preliminaries Graphs G = (V, E), V : set of vertices E : set of edges (arcs) (Undirected) Graph : (i, j) = (j, i) (edges) 1 2 3 5 4 V = {1, 2, 3, 4, 5}, E = {(1, 3), (3, 2), (2, 4)} 1 Directed Graph (Digraph)
More information2-bondage in graphs. Marcin Krzywkowski*
International Journal of Computer Mathematics Vol. 00, No. 00, January 2012, 1 8 2-bondage in graphs Marcin Krzywkowski* e-mail: marcin.krzywkowski@gmail.com Department of Algorithms and System Modelling
More informationIndependent Transversal Dominating Sets in Graphs: Complexity and Structural Properties
Filomat 30:2 (2016), 293 303 DOI 10.2298/FIL1602293A Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Independent Transversal Dominating
More informationStructures and Duality in Combinatorial Programming
Structures and Duality in Combinatorial Programming HDR Denis Cornaz Mourad Baiou Université Blaise Pascal examinateur Gérard Cornuéjols Carnegie Mellon University rapporteur Jérôme Lang Université Paris-Dauphine
More informationRON AHARONI, NOGA ALON, AND ELI BERGER
EIGENVALUES OF K 1,k -FREE GRAPHS AND THE CONNECTIVITY OF THEIR INDEPENDENCE COMPLEXES RON AHARONI, NOGA ALON, AND ELI BERGER Abstract. Let G be a graph on n vertices, with maximal degree d, and not containing
More informationEE595A Submodular functions, their optimization and applications Spring 2011
EE595A Submodular functions, their optimization and applications Spring 2011 Prof. Jeff Bilmes University of Washington, Seattle Department of Electrical Engineering Winter Quarter, 2011 http://ee.washington.edu/class/235/2011wtr/index.html
More informationPreliminaries and Complexity Theory
Preliminaries and Complexity Theory Oleksandr Romanko CAS 746 - Advanced Topics in Combinatorial Optimization McMaster University, January 16, 2006 Introduction Book structure: 2 Part I Linear Algebra
More informationTHE NUMBER OF INDEPENDENT DOMINATING SETS OF LABELED TREES. Changwoo Lee. 1. Introduction
Commun. Korean Math. Soc. 18 (2003), No. 1, pp. 181 192 THE NUMBER OF INDEPENDENT DOMINATING SETS OF LABELED TREES Changwoo Lee Abstract. We count the numbers of independent dominating sets of rooted labeled
More informationGenerating vertices of polyhedra and related monotone generation problems
DIMACS Technical Report 2007-03 March 2007 Generating vertices of polyhedra and related monotone generation problems by Endre Boros RUTCOR, Rutgers University 640 Bartholomew Road Piscataway, NJ 08854-8003
More informationThe Computational Complexity of Graph Contractions I: Polynomially Solvable and NP-Complete Cases*
The Computational Complexity of Graph Contractions I: Polynomially Solvable and NP-Complete Cases* Asaf Levin Department of Statistics, The Hebrew University, Jerusalem 91905, Israel Daniel Paulusma Department
More informationA Min-Max Relation on Packing Feedback Vertex Sets
A Min-Max Relation on Packing Feedback Vertex Sets Xujin Chen a Guoli Ding b Xiaodong Hu a Wenan Zang c a Institute of Applied Mathematics, Chinese Academy of Sciences, Beijing 100080, China b Mathematics
More informationThe last fraction of a fractional conjecture
Author manuscript, published in "SIAM Journal on Discrete Mathematics 24, 2 (200) 699--707" DOI : 0.37/090779097 The last fraction of a fractional conjecture František Kardoš Daniel Král Jean-Sébastien
More informationInteger Program Reformulation for Robust. Branch-and-Cut-and-Price Algorithms
Integer Program Reformulation for Robust Branch-and-Cut-and-Price Algorithms Marcus Poggi de Aragão 1, Eduardo Uchoa 2 1 Departamento de Informática, PUC-Rio, poggi@inf.puc-rio.br 2 Dep. de Engenharia
More informationDiscrete Geometry. Problem 1. Austin Mohr. April 26, 2012
Discrete Geometry Austin Mohr April 26, 2012 Problem 1 Theorem 1 (Linear Programming Duality). Suppose x, y, b, c R n and A R n n, Ax b, x 0, A T y c, and y 0. If x maximizes c T x and y minimizes b T
More informationThe Arithmetic of Graph Polynomials. Maryam Farahmand. A dissertation submitted in partial satisfaction of the. requirements for the degree of
The Arithmetic of Graph Polynomials by Maryam Farahmand A dissertation submitted in partial satisfaction of the requirements for the degree of Doctor of Philosophy in Mathematics in the Graduate Division
More information