@preamblex{ "\newcommand{\noopsort}[1]{} "
	# "\newcommand{\printfirst}[2]{#1} "
	# "\newcommand{\singleletter}[1]{#1} "
	# "\newcommand{\switchargs}[2]{#2#1} " }


@ARTICLE{b,
   author = "F. Barahona",
   title = {The max--cut problem in graphs not contractible to {$K_{5}$}},
   journal = {Operations Research Letters},
   year = 1982,
   volume = 2,
   number = 3,
   pages = "107--111",
}


@ARTICLE{bg,
   author = {F. Barahona and M. Gr\"otschel},
   title = {On the cycle polytope of a binary matroid},
   journal = {Journal of Combinatorial Theory B},
   year = 1986,
   volume = 40,
   pages = "40--62",
}

@ARTICLE{bm,
   author = "F. Barahona and A. R. Mahjoup",
   title = {On the cut polytope},
   journal = {Mathematical Programming},
   year = 1986,
   volume = 36,
   number = 5,
   pages = "157--173",
}


@ARTICLE{bgjr,
   author = {F. Barahona and M. Gr\"otschel and M. Junger and G. Reinelt},
   title = {An application of combinatorial optimization to statistical 
physics and circuit layout design},
   journal = {Operations Research},
   year = 1988,
   volume = 36,
   number = 3,
   pages = "493--513",
}

@BOOK{ber,
   author="C. Berge",
   title="Hypergraphs",
   publisher="North-Holland",
   year=1989,
}

@ARTICLE{bh1,
   author = "E. Boros and P. L. Hammer",
   title = {On clustering problems with connected optima in {Euclidean} spaces},
   journal = {Discrete Mathematics},
   year = 1989,
   volume = 75,
   pages = "81--88",
}

@TECHREPORT{bh2,
   author = "E. Boros and P. L. Hammer",
   title = "Cut-polytopes, {Boolean} {Quadratic} polytope and nonnegative
 quadratic {pseudo-Boolean}  functions",
   institution = "RUTCOR",
   number = "RRR 24-90",
   address = "New Jersey 08903",
   year = 1990,
   month = may,
}

@TECHREPORT{bh3,
   author = "E. Boros and P. L. Hammer",
   title = "The max-cut problem and quadratic 0--1 optimization: 
Polyhedral aspects, relaxations and bounds",
   institution = "RUTCOR",
   number = "RRR 25-91",
   address = "New Jersey 08903",
   year = 1991,
   month = may,
}

@TECHREPORT{bch,
   author = "E. Boros and Y. Crama and P. L. Hammer",
   title = "Upper bounds for quadratic 0--1 maximization problems",
   institution = "RUTCOR",
   number = "RRR 14-89",
   address = "New Jersey 08903",
   year = 1989,
   month = may,
}


@TECHREPORT{cr,
   author = "S. Chopra and M. R. Rao",
   title = "Facets of the k-partition polytope",
   year = 1989,
   month = jun,
   note = "manuscript, submitted",
}

@ARTICLE{crs1,
   author = "M. Conforti and  M. R. Rao and A. Sassano",
   title = {The equipartition polytope: part 1},
   journal = {Mathematical Programming},
   year = 1990,
   volume = 49,
   pages = "49--70",
}

@ARTICLE{crs2,
   author = "M. Conforti and M. R. Rao and A. Sassano",
   title = {The equipartition polytope: part 2},
   journal = {Mathematical Programming},
   year = 1990,
   volume = 49,
   pages = "71--91",
}



@ARTICLE{cnp,
   author = "G. Cornuejols and D. Naddef and W. R. Pulleyblank",
   title = {The travelling salesman problem in graphs with 3-edge cutsets},
   journal = {Journal of ACM},
   year = 1985,
   volume = 32,
   pages = "382--410",
}


@ARTICLE{ds,
   author = "C.   De Simone",
   title = {The cut polytope and the boolean quadratic polytope},
   journal = {Discrete Mathematics},
   year = 1989,
   volume = 79,
   pages = "71--75",
}




@TECHREPORT{sdl,
   author = "C. De Simone and  M. Deza and M. Laurent",
   title = "Collapsing and lifting for the cut cone",
   institution = "Instituto Di Anallisi Dei Sistemi Ed Informatica",
   number = "265",
   address = "IASI-CNR Consqlio Nazionale belle Ricerche, Roma",
   year = 1989,
}

@ARTICLE{d,
   author = "M. Deza",
   title = {On the {Hamming} geometry of unitary cubes},
   journal = {Doklady Academii Nauk SSR},
   year = 1960,
   volume = 134,
   pages = "1037--1040",
   note = "English translation in: {\it Soviet Physics Doklady}, 5, (1961), 940--943",
}


@TECHREPORT{dgl,
   author = {M. Deza and  M. Gr\"otschel and M. Laurent},
   title = "Clique--web facets for multicut polytopes",
   institution = "Institut fur Mathematik",
   number = "186",
   address = "Universtat Augsburg, Univestatsstr. 8 D-8900, Augsburg",
   year = 1989,
   month = sep,
}

@ARTICLE{dl1,
   author = "M. Deza and M. Laurent",
   title = {Facets for the cut cone I},
   journal = {Mathematical Programming},
   year = 1992,
   volume = 56,
   pages = "121--160",
}


@ARTICLE{dl2,
   author = "M. Deza and M. Laurent",
   title = {Facets for the cut cone II},
   journal = {Mathematical Programming},
   year = 1992,
   volume = 56,
   pages = "161--188",
}


@TECHREPORT{dl3,
   author = {M. Deza and M. Laurent},
   title = "The cut cone III: on the role of triange facets",
   institution = "Forschungsinstitut fur Diskrete Mathematik
Institut fur okonometrie und Operations Research",
   number = "90655 - OR",
   address = "Nassestrasse 2, D-5300, Bonn",
   year = 1990,
   month = jul,
}


@TECHREPORT{dl4,
   author = {M. Deza and M. Laurent},
   title = "The cut cone: simplicial faces and variety of realizations",
   institution = "Forschungsinstitut fur Diskrete Mathematik
Institut fur okonometrie und Operations Research",
   number = "90671 - OR",
   address = "Nassestrasse 2, D-5300, Bonn",
   year = 1991,
   month = jan,
}


@TECHREPORT{dl5,
   author = {M. Deza and M. Laurent},
   title = "Extension operations for cuts",
   institution = "Forschungsinstitut fur Diskrete Mathematik
Institut fur okonometrie und Operations Research",
   number = "91736 - OR",
   address = "Nassestrasse 2, D-5300, Bonn",
   year = 1991,
   month = nov,
}


@ARTICLE{g,
   author = "A. M. H. Gerards",
   title = {Testing the odd bicycle wheel inequalities for the bipartite 
subgraph polytope},
   journal = {Mathematics of Operations Research},
   year = 1985,
   volume = 10,
   pages = "359--360",
}


@ARTICLE{gbm,
   author = {M. Gr\"otschel and F. Barahona and A. R. Mahjoup },
   title = {Facets of bipartite subgraph polytope},
   journal = {Mathematics of Operations Research},
   year = 1985,
   volume = 10,
   pages = "340--358",
}

@TECHREPORT{gn,
   author = {M. Gr\"otschel and G. R. Nemhauser},
   title = "A polynomial algorithm for the max-cut problem on graphs without 
long odd cycles",
   institution = "Institut fur Ukonometrrie und Operations Research",
   address = "Universtat, Bonn",
   year = 1982,
}


@ARTICLE{gp,
   author = {M. Gr\"otschel and W. R. Pulleyblank},
   title = {Weakly bipartite graphs and the max-cut problem},
   journal = {Operations Research Letters},
   year = 1981,
   volume = 1,
   number = 1,
   pages = "23--27",
}


@ARTICLE{gw1,
   author = {M. Gr\"otcshel and Y. Wakabayashi},
   title = {A cutting plane algorithm for a clustering problem},
   journal = {Mathematical Programming},
   year = 1989,
   volume =45,
   pages = "59--96",
}

@ARTICLE{gw2,
   author = {M. Gr\"otcshel and Y. Wakabayashi},
   title = {Facets of the clique partitioning polytope},
   journal = {Mathematical Programming},
   year = 1990,
   volume =47,
   pages = "367--387",
}


@INCOLLECTION{gw3,
   author = {M. Gr\"otschel and Y. Wakabayashi},
   title = "Composition of facets of the clique partitioning polytope",
   editor = "R.\ Bodendiek and R.\ Hem",
   booktitle = "Topics in Combinatorics and Graph Theory",
   publisher = "Physica--Verlag ",
   address = "Heidelberg",
   year = "1990",
}

@ARTICLE{h,
   author = "F. Hadlock",
   title = {Finding a maximum cut of a planar graph in polynomial time},
   journal = {SIAM Journal on Computing},
   year = 1974 ,
   volume = 4,
   pages = " 221--225",
}


@ARTICLE{lgs,
   author = {L. Lov\'asz and M. Gr\"otschel and A. Schrijver},
   title = {The ellipsoid method and its consequences in combinatorial optimization},
   journal = {Combinatorica},
   year = 1981,
   volume = 1,
   pages = "169--197",
}

@BOOK{min,
   author={M. Minoux and M. Goldran},
   title="Graphs and Algorithms",
   publisher="John Wiley \& Sons",
   year=1984,
}

@BOOK{nw,
   author={G. L.  Nemhauser and L. A. Wolsey},
   title="Integer and Combinatorial Optimization",
   publisher="John Wiley \& Sons",
   year=1988,
}

@ARTICLE{p,
   author = "M. Padberg",
   title = {The boolean quadratic polytope: some characteristics, facets and relatives},
   journal = {Mathematical Programming},
   year = 1989,
   volume = 45,
   pages = "139--172",
}


@INBOOK{pul,
   author={W. Pulleyblank},
   title="Polyhedral Combinatorics",
   series="Handbooks of Operations Research and Management Science",
   volume="I",
   chapter="Optimization",
   publisher="North-Holland",
   year=1989,
}

@BOOK{sch,
   author="A. Schrijver",
   title="Theory of linear and interger programming",
   publisher="John Wiley \& Sons",
   year=1986,
}

@ARTICLE{w,
   author = "K. Wagner",
   title = {Beweis einer abschwatchung der hardwiger-vernutung},
   journal = {Math. Ann.},
   year = 1964,
   volume = 153,
   pages = "139--141",
}

@INPROCEEDINGS{y,
   author = "M. Yannakakis",
   title = "Node - and edge - deletion {NP-complete} problems",
   booktitle = "Proc.\ of the $10^{th}$ Annual Symp.\ on Theory of Computing",
   organization = "ACM",
   year = 1978,
   pages = "253--264",
}

@UNPUBLISHED{zie,
   author= " G.  M. Ziegler",
   title="Lectures on Polytopes",
   month=aug,
   year=1993,
   note={Konrad-Zuse-Zentrum f{\"u}r Informationstechnik Berlin (ZIB)},
}