%
%  Time-stamp: <26/03/94 18:11:39 Mike Dowling MooCow>
%
% Non-Linear Programming bibliography
%
% If the time-stamp above does not concur with the file's date, then some
% unauthorised person has probably edited the file.
%
@Book{nlp:Avriel:76,
  author =       "Mordecai Avriel",
  title =        "Nonlinear Programming: Analysis and methods",
  publisher =    "Prentice-Hall Inc.",
  year =         "1976",
  address =      "Englewood Cliffs",
}

@Article{nlp:BeattieBoisenJohnson:89,
  author =       "C. A. Beattie and M. B. {Boisen, Jr.} and L. W.
                 Johnson",
  title =        "Inertia-Preserving Secant Updates",
  journal =      "J. Optim. Theory Appl.",
  year =         "1989",
  volume =       "62",
  number =       "1",
  pages =        "1--15",
  month =        jul,
  note =         "Errata: same journal, Jan. 1991, vol. 68 No. 1 Page
                 203",
}

@Article{nlp:BroydenDennisMore:73,
  author =       "C. G. Broyden and J. E. {Dennis, Jr.} and Forge J.
                 Mor\'e",
  title =        "On the Local and Superlinear Convergence of
                 Quasi-{N}ewton Methods",
  journal =      "J. Inst. Maths. Applics.",
  year =         "1973",
  volume =       "12",
  pages =        "223--245",
}

@Article{nlp:Burke:92,
  author =       "James V. Burke",
  title =        "A Robust Trust Region Method for Constrained Nonlinear
                 Programming",
  journal =      "SIAM J. Optim.",
  year =         "1992",
  volume =       "2",
  number =       "2",
  pages =        "325--347",
  month =        may,
  annote =       "trust regions, constrained optimization, exact penalty
                 functions",
}

@Article{nlp:ByrdNocedal:89,
  author =       "Richard H. Byrd and Jorge Nocedal",
  title =        "A Tool for the Analysis of Wuasi-{N}ewton Methods with
                 Applications to Unconstrained Minimization",
  journal =      "SIAM J. Numer. Anal.",
  year =         "1989",
  volume =       "26",
  number =       "3",
  pages =        "727--739",
  month =        jun,
  mscprimary =   "65, 49",
}

@Article{nlp:ByrdTapiaZhang:92,
  author =       "R. H. Byrd and R. A. Tapia and Yin Zhang",
  title =        "An {SQP} Augmented {L}agrange {BFGS} Algorithm for
                 Constrained Optimization",
  journal =      "SIAM J. Optim.",
  year =         "1992",
  volume =       "2",
  number =       "2",
  pages =        "210--241",
  month =        may,
  annote =       "BFGS secant method, augmented Lagrangean, SQP methods,
                 superlinear convergence",
}

@Book{nlp:Cameron:85,
  author =       "Neil Cameron",
  title =        "Introduction to Linear and Convex Programming",
  publisher =    "Cambridge University Press",
  year =         "1985",
  volume =       "1",
  series =       "Australian Mathematical Society Lecture Notes Series",
  address =      "Cambridge",
  ISBN =         "0-521-30951-4",
}

@Article{nlp:ChandrasekaranPang:87,
  author =       "R. Chandrasekaran and J.-S. Pang",
  title =        "Two Counterexamples on the Polynomial Solvability of
                 the Linear Complementarity Problem",
  journal =      "Math. Programming",
  year =         "1987",
  volume =       "39",
  pages =        "21--25",
}

@Article{nlp:Davidon:91,
  author =       "William C. Davidon",
  title =        "Variable Metric methods for Minimization",
  journal =      "SIAM J. Optim.",
  year =         "1991",
  volume =       "1",
  number =       "1",
  pages =        "1--17",
  month =        feb,
  annote =       "65K10, 49D37, 65K05, 90C30",
}

@InCollection{nlp:Dennis:71,
  author =       "J. E. {Dennis, Jr.}",
  title =        "Toward a Unified Convergence Theory for {N}ewton-Like
                 Methods",
  booktitle =    "Nonlinear Functional Analysis and Applications",
  publisher =    "Academic Press",
  year =         "1971",
  editor =       "Louis B. Rall",
  pages =        "425--472",
  address =      "London",
  note =         "Volume 26 of the Mathematics Research Center of the
                 University of Wisconsin",
}

@Article{nlp:DennisMore:77,
  author =       "J. E. {Dennis, Jr.} and Jorge J. Mor\'e",
  title =        "Quasi-{N}ewton Methods, Motivation and Theory",
  journal =      "SIAM Rev.",
  year =         "1977",
  volume =       "19",
  number =       "1",
  pages =        "46--89",
  month =        jan,
}

@Book{nlp:DennisSchnabel:83,
  author =       "J. E. {Dennis, Jr.} and Robert B. Schnabel",
  title =        "Numerical Methods for Unconstrained Optimization and
                 Nonlinear Equations",
  publisher =    "Prentice-Hall Inc.",
  year =         "1983",
  note =         "Prentice-Hall Series in Computational Mathematics",
  ISBN =         "0-13-627216-9",
}

@Book{nlp:Fletcher:87,
  author =       "R. Fletcher",
  title =        "Practical Methods of Optimization",
  publisher =    "John Wiley \& Sons",
  year =         "1987",
  address =      "Chichester",
  edition =      "second",
}

@Article{nlp:Fletcher:91,
  author =       "R. Fletcher",
  title =        "A New Variational Result for Quasi-{N}ewton Formulae",
  journal =      "SIAM J. Optim.",
  year =         "1991",
  volume =       "1",
  number =       "1",
  pages =        "18--21",
  month =        feb,
  annote =       "65K, 90C",
}

@Book{nlp:GillMurray:74,
  author =       "Philip E. Gill and Walter Murray",
  title =        "Numerical Methods for Constrained Optimization",
  publisher =    "Academic Press",
  year =         "1974",
  address =      "London",
}

@Article{nlp:GillMurraySaundersWright:91,
  author =       "P. E. Gill and W. Murray and M. A. Saunders and M. H.
                 Wright",
  title =        "Inertia-Controlling Methods for General Quadratic
                 Programming",
  journal =      "SIAM Rev.",
  year =         "1991",
  volume =       "33",
  number =       "1",
  pages =        "1--36",
  month =        mar,
  annote =       "90C20 65K05",
}

@Book{nlp:GillMurrayWright:81,
  author =       "Philip E. Gill and Walter Murray and Margaret H.
                 Wright",
  title =        "Practical Optimization",
  publisher =    "Academic Press, Inc.",
  year =         "1981",
  address =      "London",
  ISBN =         "0-12-283952-8",
}

@Article{nlp:GranotSkorin-Kapov:90,
  author =       "Frieda Granot and Jadranka Skorin-Karpov",
  title =        "Towards a Strongly Polynomial Algorithm for Strictly
                 Convex Quadratic Programs: an Extension of {T}ardos'
                 Algorithm",
  journal =      "Math. Programming",
  year =         "1990",
  volume =       "46",
  pages =        "225--236",
}

@TechReport{nlp:GuenzelHirabayashiJongenShindoh:93,
  author =       "H. G{\"u}nzel and R. Hirabayashi and H.-Th. Jongen and
                 S. Shindoh",
  title =        "On the Topologyical Complexity of {DC}-sets",
  institution =  "Lehrstuhl f{\"u}r Mathematik,
                 Rheinisch-Westf{\"a}lische Hochschule, Aachen",
  year =         "1993",
  series =       "Preprint",
  number =       "39",
  address =      "Aachen",
  month =        jul,
}

@Article{nlp:Hanson:91,
  author =       "Morgan A. Hanson",
  title =        "A Simple Proof of the van der {W}earden Permanent
                 Problem",
  journal =      "J. Global Optim.",
  year =         "1991",
  pages =        "287--293",
}

@Book{nlp:Hestenes:75,
  author =       "Magnus R. Hestenes",
  title =        "Optimization Theory, the Finite Dimensional Case",
  publisher =    "John Wiley \& Sons",
  year =         "1975",
  address =      "New York",
  ISBN =         "0-387-90455-7",
  pscprimary =   "49D07, 49D99, 65K10",
}

@Book{nlp:Hestenes:80,
  author =       "Magnus Hestenes",
  title =        "Conjugate Direction Methods in Optimization",
  publisher =    "Springer Verlag",
  year =         "1980",
  volume =       "12",
  series =       "Applications of Mathematics",
  address =      "New York",
}

@Unpublished{nlp:HirabayashiJongenShida:92,
  author =       "Ryuichi Hirabayashi and Hubertus-Th. Jongen and
                 Masayuki Shida",
  title =        "Euler's Formula via Potential Functions",
  note =         "Preprint",
  year =         "1992",
  month =        jul,
}

@Book{nlp:Horst:79,
  author =       "Reiner Horst",
  title =        "{N}ichtlineare {O}ptimierung",
  publisher =    "Carl Hanser Verlag",
  year =         "1979",
  language =     "German",
  address =      "Munich",
}

@Article{nlp:HwangKelley:92,
  author =       "D. M. Hwang and C. T. Kelley",
  title =        "Convergence of {B}royden's Method in {B}anach Spaces",
  journal =      "SIAM J. Optim.",
  year =         "1992",
  volume =       "2",
  number =       "3",
  pages =        "505--532",
  month =        aug,
  annote =       "65J15, 47H17, 49D15",
}

@Book{nlp:JongenJonkerTwilt:83,
  author =       "H.-Th. Jongen and P. Jonker and F. Twilt",
  title =        "Nonlinear Optimization in ${\R}^n$ {I}. {M}orse
                 Theory, {C}hebyshev Approximation",
  publisher =    "Verlag Peter Lang",
  year =         "1983",
  volume =       "29",
  series =       "{\DE Methoden und {V}erfahren der mathematischen
                 {P}hysik}",
  address =      "Frankfurt am Main",
}

@Book{nlp:JongenJonkerTwilt:86,
  author =       "H.-Th. Jongen and P. Jonker and F. Twilt",
  title =        "Nonlinear Optimization in ${\R}^n$ {II}.
                 {T}ransversality, Flows, Parametric Aspects",
  publisher =    "Verlag Peter Lang",
  year =         "1986",
  volume =       "32",
  series =       "{\DE Methoden und {V}erfahren der mathematischen
                 {P}hysik}",
  address =      "Frankfurt am Main",
}

@Book{nlp:KantorovichAkilov:64,
  author =       "L. V. Kantorovich and G. P. Akilov",
  title =        "Functional Analysis in Normed Spases",
  publisher =    "Pergamon Press",
  year =         "1964",
  volume =       "46",
  series =       "International Series of Monographs in Pure and Applied
                 Mathematics",
  address =      "Oxford",
  note =         "Translated from the Russian by D. E. Brown and Dr. A.
                 P. Robertson",
}

@Article{nlp:KelleySachs:91,
  author =       "C. T. Kelley and E. W. Sachs",
  title =        "A New Proof of the Superlinear Convergence for
                 {B}royden's Method in {H}ilbert Space",
  journal =      "SIAM J. Optim.",
  year =         "1991",
  volume =       "1",
  number =       "1",
  pages =        "146--150",
  month =        feb,
  annote =       "65J15, 47H17, 49D15",
}

@Article{nlp:KhalfanByrdSchnabel:93,
  author =       "H. Fayez Khalfan and R. H. Byrd and R. B. Schnabel",
  title =        "A Theoretical and Experimental Study of the Symmetric
                 Rank-One Update",
  journal =      "SIAM J. Optim.",
  year =         "1993",
  volume =       "3",
  number =       "1",
  pages =        "1--24",
  month =        feb,
}

@Book{nlp:Kosmol:89,
  author =       "Peter Kosmol",
  title =        "\DE Methoden zur numerischen {B}ehandlung
                 nichtlinearer {G}leichungen und
                 {O}ptimierungsaufgaben",
  publisher =    "B. G. teubner Verlag",
  year =         "1983",
  OPTnote =      "\DE Teubner Studienb{\"u}cher",
  ISBN =         "3-519-02085-8",
}

@InBook{nlp:Kuhn:91a,
  author =       "Harald W. Kuhn",
  title =        "Nonlinear Programming: a Historical Note",
  chapter =      "9",
  crossref =     "lp:LenstraKanSchrijver:91",
  publisher =    "Elsevier Science Publishers B. V.",
  year =         "1991",
  editor =       "Jan Karel Lenstra and Alexander H. G. Rinnoy Kan and
                 Alexander Schrijver",
  pages =        "82--96",
  address =      "Amsterdam",
  ISBN =         "0-444-88818-7",
}

@Book{nlp:Luenberger:84,
  author =       "David G. Luenberger",
  title =        "Linear and Nonlinear Programming",
  publisher =    "Addison-Wesley Publishing Co.",
  year =         "1984",
  month =        may,
  address =      "Reading",
  edition =      "second",
  note =         "Reprinted with corrections in May, 1989",
  ISBN =         "0-201-15794-2",
}

@Article{nlp:Majthay:71,
  author =       "A. Majthay",
  title =        "Optimality Conditions for Quadratic programming",
  journal =      "Math. Programming",
  year =         "1971",
  volume =       "1",
  pages =        "359--365",
}

@Book{nlp:McCormick:83,
  author =       "Garth P. McCormick",
  title =        "Nonlinear Programming",
  publisher =    "John Wiley \& Sons",
  year =         "1983",
  address =      "New York",
}

@Book{nlp:Murty:88,
  author =       "Katta G. Murty",
  title =        "Linear Complementarity, Linear and Nonlinear
                 Programming",
  publisher =    "Heldermann Verlag",
  year =         "1988",
  volume =       "3",
  series =       "Sigma Series in Applied Mathematics",
  address =      "Berlin",
}

@Article{nlp:MurtyKabadi:87,
  author =       "K. G. Murty and S. N. Kabadi",
  title =        "Some {NP}-Complete Problems in Quadratic and Nonlinear
                 Programming",
  journal =      "Math. Programming",
  year =         "1987",
  volume =       "39",
  pages =        "117--129",
}

@Book{nlp:NemhauserKanTodd:89,
  author =       "G. L. Nemhauser and A. H. G. Rinnooy Kahn and M. J.
                 Todd",
  title =        "Optimization",
  publisher =    "North Holland",
  year =         "1989",
  series =       "Handbooks in OR and MS",
  volume =       "1",
  address =      "Amsterdam",
}

@Book{nlp:OrtegaRheinboldt:70,
  author =       "J. M. Ortega and W. C. Rheinboldt",
  title =        "Iterative Solution of Nonlinear Equations in Several
                 Variables",
  publisher =    "Acedemic Press",
  year =         "1970",
  address =      "New York",
  note =         "Computer Science and Applied Mathematics",
}

@Book{nlp:Polak:71,
  author =       "E. Polak",
  title =        "Computational Methods in Optimization",
  publisher =    "Academic Press",
  year =         "1971",
  volume =       "72",
  series =       "Mathematics in Science and Engineering",
  address =      "New York",
}

@InBook{nlp:Powell:91,
  author =       "M. J. D. Powell",
  title =        "A View od Nonlinear Optimization",
  chapter =      "13",
  crossref =     "lp:LenstraKanSchrijver:91",
  publisher =    "Elsevier Science Publishers B. V.",
  year =         "1991",
  editor =       "Jan Karel Lenstra and Alexander H. G. Rinnoy Kan and
                 Alexander Schrijver",
  pages =        "119--125",
  address =      "Amsterdam",
  ISBN =         "0-444-88818-7",
}

@Article{nlp:Rohn:90,
  author =       "Jiri Rohn",
  title =        "A Short proof of the Finiteness of {M}urty's Princilal
                 Pivoting Algorithm",
  journal =      "Math. Programming",
  year =         "1990",
  volume =       "46",
  pages =        "255--256",
}

@InBook{nlp:Scarf:91,
  author =       "Herbert E. Scarf",
  title =        "The Origins of Fixed Point Methods",
  chapter =      "14",
  crossref =     "lp:LenstraKanSchrijver:91",
  publisher =    "Elsevier Science Publishers B. V.",
  year =         "1991",
  editor =       "Jan Karel Lenstra and Alexander H. G. Rinnoy Kan and
                 Alexander Schrijver",
  pages =        "126--134",
  address =      "Amsterdam",
  ISBN =         "0-444-88818-7",
}

@InBook{nlp:Shor:91,
  author =       "Naum Shor",
  title =        "The Development of Numerical Methods for Nonsmooth
                 Optimization in the {USSR}",
  chapter =      "15",
  crossref =     "lp:LenstraKanSchrijver:91",
  publisher =    "Elsevier Science Publishers B. V.",
  year =         "1991",
  editor =       "Jan Karel Lenstra and Alexander H. G. Rinnoy Kan and
                 Alexander Schrijver",
  pages =        "135--139",
  address =      "Amsterdam",
  ISBN =         "0-444-88818-7",
}

@Article{nlp:Sinden:63,
  author =       "Frank W. Sinden",
  title =        "Duality in Convex Programming and in Projective
                 Space",
  journal =      "SIAM J. Appl. Math.",
  year =         "1963",
  volume =       "11",
  number =       "3",
  pages =        "535--552",
}

@Book{nlp:Spellucci:93,
  author =       "Peter Spellucci",
  title =        "{N}umerische {V}erfahren der nichtlinearen
                 {O}ptimierung",
  publisher =    "Birkh{\"a}user Verlag",
  year =         "1993",
  address =      "Berlin",
  language =     "German",
  note =         "Internationale Schriftenreihe zur numerischen
                 Mathematik",
}

@Book{nlp:StoerWitzgall:70,
  author =       "Josef Stoer and Christoph Witzgall",
  title =        "Convexity and Optimization in Finite Dimensions",
  publisher =    "Springer-Verlag",
  year =         "1970",
  volume =       "163",
  series =       "{\DE Die Grundlehren der mathematischen Wissenschaften
                 in Einzeldarstellung}",
  address =      "Berlin",
}

@Article{nlp:Warga:92,
  author =       "J. Warga",
  title =        "A Necessary and Sufficient Condition for a Constrained
                 Minimum",
  journal =      "SIAM J. Optim.",
  year =         "1992",
  volume =       "2",
  number =       "4",
  pages =        "665--667",
  month =        nov,
}

@Book{nlp:Zoutendijk:76,
  author =       "G. Zoutendijk",
  title =        "Mathematical Programming Methods",
  publisher =    "North Holland",
  year =         "1976",
  address =      "Amsterdam",
}

%
%  Time-stamp: <15/04/94 14:53:52 Mike Dowling MooCow>
%
% Integer Programming bibliography
%
% If the time-stamp above does not concur with the file's date, then some
% unauthorised person has probably edited the file.
%
@InBook{ip:Gomory:91,
  author =       "Ralph E. Gomory",
  title =        "Early Integer Programming",
  chapter =      "5",
  crossref =     "lp:LenstraKanSchrijver:91",
  publisher =    "Elsevier Science Publishers B. V.",
  year =         "1991",
  editor =       "Jan Karel Lenstra and Alexander H. G. Rinnoy Kan and
                 Alexander Schrijver",
  pages =        "55--61",
  address =      "Amsterdam",
  ISBN =         "0-444-88818-7",
}

@Article{ip:HafnerMcCurley:91,
  author =       "James L. Hafner and Kevin S. McCurley",
  title =        "Asymptotically Fast Triangularizations of Matrices
                 over Rings",
  journal =      "SIAM J. Comput.",
  year =         "1991",
  volume =       "20",
  number =       "6",
  pages =        "1068--1083",
  month =        dec,
  ISSN =         "0097-5397",
  mscprimary =   "68Q40",
  mscsecondary = "11Y16, 15A23",
  keywords =     "Hermite normal form, factorization of matrices",
}

@Book{ip:Hu:69,
  author =       "T. C. Hu",
  title =        "Integer Programming",
  publisher =    "Addison-Wesley Publishing Co.",
  year =         "1969",
  address =      "Reading",
  lcccn =        "75-85384",
}

@Book{ip:GarfinkelNemhauser:72,
  author =       "Robert S. Garfinkel and George L. Nemhauser",
  title =        "Integer Programming",
  publisher =    "John Wiley \& Sons",
  year =         "1972",
  address =      "New York",
  note =         "Series in Decision and Control",
  ISBN =         "0-471-29195-1",
}

@Book{ip:SalkinMathur:89,
  author =       "Harvey M. Salkin and Kamlesh Mathur",
  title =        "Foundations of Integer Programming",
  publisher =    "North Holland",
  year =         "1989",
  address =      "New York",
  ISBN =         "0-444-01231-1",
}

@Book{ip:Schrijver:86,
  author =       "A. Schrijver",
  title =        "Theory of Linear and Integer Programming",
  publisher =    "John Wiley \& Sons",
  year =         "1986",
  address =      "Chichester",
  ISBN =         "0-471-90854-1",
}

%
%  Time-stamp: <24/03/94 21:59:13 Mike Dowling Cowcocky>
%
% Linear Programming bibliography (NOT including interior point methods)
%
% If the time-stamp above does not concur with the file's date, then some
% unauthorised person has probably edited the file.
%
@InBook{lp:Arrow:91,
  author =       "Kenneth Arrow",
  title =        "The Origins of the Impossibility Theorem",
  chapter =      "1",
  crossref =     "lp:LenstraKanSchrijver:91",
  publisher =    "Elsevier Science Publishers B. V.",
  year =         "1991",
  editor =       "Jan Karel Lenstra and Alexander H. G. Rinnoy Kan and
                 Alexander Schrijver",
  pages =        "1--4",
  address =      "Amsterdam",
  ISBN =         "0-444-88818-7",
}

@Article{lp:BartelsGolub:69,
  author =       "R. H. Bartels and G. H. Golub",
  title =        "The Simplex Method of Linear Programming Using the
                 \({LU}\) Decomposition",
  journal =      "Comm. ACM",
  year =         "1969",
  volume =       "12",
  number =       "5",
  pages =        "266--268",
  month =        may,
}

@TechReport{lp:Bixby:92,
  author =       "Robert E. Bixby",
  title =        "{\DE Das Implementatieren des Simplex-Verfahrens: Die
                 Startbasis}",
  institution =  "Konrad-Zuse-Zentrum f{\"u}r Informationstechnik
                 Berlin",
  series =       "Preprint SC 92-11",
  year =         "1992",
  address =      "Heilbronnerstr. 10, D-1000 Berlin 31",
  month =        apr,
  language =     "German",
}

@Article{lp:BixbyCunningham:80,
  author =       "Robert E. Bixby and William H. Cunningham",
  title =        "Converting Linear Programs to Network Problems",
  journal =      "Math. Oper. Res.",
  year =         "1980",
  volume =       "5",
  number =       "3",
  pages =        "321--357",
  month =        aug,
}

@Article{lp:Bland:77,
  author =       "R. G. Bland",
  title =        "New, Finite Pivoting Rules for the Simplex Method",
  journal =      "Math. Oper. Res.",
  volume =       "2",
  year =         "1977",
  pages =        "103--107",
}

@Article{lp:Blum:88,
  author =       "Lenore Blum",
  title =        "A New Simple Homotopy Algorithm for Linear
                 Programming~{I}",
  journal =      "J. Complexity.",
  year =         "1988",
  volume =       "4",
  pages =        "124--136",
}

@Book{lp:Borgwardt:87,
  author =       "Karl Heinz Borgwardt",
  title =        "The Simplex Method. {A} Probabilistic Analysis",
  publisher =    "Springer-Verlag",
  series =       "Algorithms and Combinatorics; Study and Research
                 Texts",
  volume =       "1",
  address =      "Berlin",
  year =         "1987",
  ISBN =         "0-8176-3561-0",
}

@Book{lp:Chvatal:83,
  author =       "Va\v{s}ek Chv\'atal",
  title =        "Linear Programming",
  publisher =    "W. H. Freeman and Company",
  year =         "1983",
  address =      "New York",
  ISBN =         "0-7167-1587-2",
}

@Book{lp:Dantzig:63,
  author =       "George B. Dantzig",
  title =        "Linear Programming and Extensions",
  publisher =    "Princeton University Press",
  address =      "Princeton",
  year =         "1963",
}

@InBook{lp:Dantzig:91,
  author =       "George Dantzig",
  title =        "Linear Programming",
  chapter =      "3",
  crossref =     "lp:LenstraKanSchrijver:91",
  publisher =    "Elsevier Science Publishers B. V.",
  year =         "1991",
  editor =       "Jan Karel Lenstra and Alexander H. G. Rinnoy Kan and
                 Alexander Schrijver",
  pages =        "19--31",
  address =      "Amsterdam",
  ISBN =         "0-444-88818-7",
}

@Book{lp:GillMurrayWright:91,
  author =       "Philip E. Gill and Walter Murray and Margaret H.
                 Wright",
  title =        "Numerical Linear Algebra and Optimization, Vol.~1",
  publisher =    "Addison-Wesley Publishing Co.",
  year =         "1991",
  address =      "Redwood City",
  note =         "Published in the Advanced Book Program",
  ISBN =         "0-201-12649-4",
}

@TechReport{lp:Hoffman:53,
  author =       "A. J. Hoffman",
  title =        "Cycling in the Simplex Algorithm",
  institution =  "National Bureau of Standards",
  series =       "Report No. 2974",
  year =         "1953",
}

@InBook{lp:Hoffman:91,
  author =       "Alan J. Hoffman",
  title =        "Linear Programming at the National Bureau of
                 Standards",
  chapter =      "6",
  crossref =     "lp:LenstraKanSchrijver:91",
  publisher =    "Elsevier Science Publishers B. V.",
  year =         "1991",
  editor =       "Jan Karel Lenstra and Alexander H. G. Rinnoy Kan and
                 Alexander Schrijver",
  pages =        "62--64",
  address =      "Amsterdam",
  ISBN =         "0-444-88818-7",
}

@Book{lp:LenstraKanSchrijver:91,
  author =       "Jan Karel Lenstra and Alexander H. G. Rinnoy Kan and
                 Alexander Schrijver, (eds)",
  title =        "History of Mathematical Programming, a Collection of
                 Personal Reminiscences",
  publisher =    "Elsevier Science Publishers B. V.",
  year =         "1991",
  address =      "Amsterdam",
  ISBN =         "0-444-88818-7",
}

@Article{lp:Megiddo:86-2,
  author =       "N. Megiddo",
  title =        "A Note on Degeneracy in Linear Programming",
  journal =      "Math. Programming",
  volume =       "35",
  pages =        "365--367",
  year =         "1986",
}

@Book{lp:Murty:83,
  author =       "Katta G. Murty",
  title =        "Linear Programming",
  publisher =    "John Wiley \& Sons",
  address =      "New York",
  year =         "1983",
}

@Article{lp:Reid:82,
  author =       "J. K. Reid",
  title =        "A Sparsity-Exploiting Variant of the {B}artles-{G}olub
                 Decomposition for Linear Programming Bases",
  journal =      "Math. Programming",
  volume =       "24",
  pages =        "55--69",
  year =         "1982",
}

@Article{lp:Smale:83,
  author =       "S. Smale",
  title =        "On the Average Number of Steps of the Simplex Method
                 of Linear Programming",
  journal =      "Math. Programming",
  volume =       "27",
  pages =        "241--262",
  year =         "1983",
}

@Book{lp:SteinitzRadamacher:34,
  author =       "E. Steinitz and H. Radamacher",
  title =        "Vorlesungen {\"u}ber die {T}heorie der {P}olyeder",
  publisher =    "Springer-Verlag",
  year =         "1934",
  address =      "Berlin",
  language =     "German",
}

@TechReport{lp:TerlakyZhang:91,
  author =       "T. Terlaky and S. Zhang",
  title =        "A Survey on Pivot Rules for Linear Programming",
  institution =  "Delft University of Technology",
  series =       "Reports of the Faculty of Technical Mathematics and
                 Informatics No. 91--99, ISSN 0922-5641",
  year =         "1991",
}

@Book{lp:Thie:88,
  author =       "Paul R. Thie",
  title =        "An Introduction to Linear Programming and Game
                 Theory",
  publisher =    "John Wiley \& Sons",
  year =         "1988",
  edition =      "second",
  ISBN =         "0-471-62488-8",
}

%
% Time-stamp: <13/02/94 21:12:00 Mike Dowling Cowcocky>
%
% Numerical Linear Algebra bibliography
%
% If the time-stamp above does not concur with the file's date, then some
% unauthorised person has probably edited the file.
%
@Book{nla:AndersonEtAl:92,
  author =       "E. Anderson and Z. Bai and C. Bischof and J. Demmel
                 and J. Dongarra and J. Du Croz and A. Greenbaum and S.
                 Hammarling and A. McKenney and S. Ostrouchov and D.
                 Sorensen",
  title =        "{LAPACK} Users' Guide",
  publisher =    "Siam",
  year =         "1992",
  address =      "Philadephia",
  ISBN =         "0-89871-294-7",
}

@Article{nla:AxelssonEijkhoutPolmanVasselevski:89,
  author =       "O. Axelsson and V. Eijkhout and B. Polman and P.
                 Vasselevski",
  title =        "Incomplete Block-Matrix Factorization Iterative
                 Methods for Convection-Diffusion Problems",
  journal =      "BIT",
  year =         "1989",
  number =       "29",
  pages =        "867--889",
}

@Article{nla:AxelssonVassilevski:89,
  author =       "O. Axelsson and P. S. Vasselevski",
  title =        "A Survey of Multilevel Preconditioned Iterative
                 Methods",
  journal =      "BIT",
  year =         "1989",
  volume =       "29",
  pages =        "769--793",
}

@Book{nla:BarrettEtAl:93,
  author =       "Richard Barrett and Michael Berry and Tony Chan and
                 James Demmel and June Donato and Jack Dongarra and
                 Voctor Eijkhout and Roldan Pozo and Charles Romine and
                 Hank van der Vorst",
  title =        "Templates for the Solution of Linear Systems: Building
                 Blocks for Iterative Methods",
  publisher =    "SIAM",
  year =         "1993",
  address =      "Philadelphia",
  note =         "Obtainable from research.att.com:/netlib/linalg using
                 ftp",
}

@Article{nla:Beauwens:89,
  author =       "Robert Beauwens",
  title =        "Approximate Factorizations with {\(S/P\)} Consistently
                 Ordered \({M}\)-Factors",
  journal =      "BIT",
  year =         "1989",
  volume =       "29",
  pages =        "658--681",
}

@Article{nla:Bosch:87,
  author =       "A. J. Bosch",
  title =        "Note on the Factorization of a Square Matrix into
                 Hermitian or Symmetric Matrices",
  journal =      "SIAM Rev.",
  year =         "1987",
  volume =       "29",
  number =       "3",
  pages =        "463--468",
  month =        sep,
}

@Article{nla:BrugnanoTrigiante:92,
  author =       "L. Brugnan0 and D. Trigiante",
  title =        "Tridiagonal Matrices: Invertability and Conditioning",
  journal =      LINAA2,
  year =         "1992",
  volume =       "166",
  pages =        "131--150",
  month =        mar,
}

@Article{nla:CharlierVanbeginVanDooren:88,
  author =       "J. P. Charlier and M. Vanbegin and P. Van Dooren",
  title =        "On Efficient Implementations of Kogbetliantz's
                 Algorithm for Computing the Singular Value
                 Decomposition",
  journal =      "Numer. Math.",
  volume =       "52",
  pages =        "279--300",
  year =         "1988",
}

@Book{nla:Ciarlet:89,
  author =       "Philippe G. Ciarlet",
  title =        "Introduction to Numerical Linear Algebra and
                 Optimisation",
  publisher =    "Cambridge University Press",
  address =      "Cambridge",
  note =         "Originally published in French under the title, {\em
                 Introduction \`a l'analyse num\'erique matricielle et
                 \`a l'optimisation,} in 1982",
  year =         "1989",
  ISBN =         "0-521-32788-1",
}

@Book{nla:DuffErismanReid:86,
  author =       "I. S. Duff and A. M. Erisman and J. K. Reid",
  title =        "Direct Methods for Sparse Matrices",
  publisher =    "Clarendon Press",
  year =         "1986",
  address =      "Oxford",
  ISBN =         "0-19-853408-6",
}

@Article{nla:Elman:89,
  author =       "Howard C. Elman",
  title =        "Relaxed and Stabilized Incomplete Factorizations for
                 Non-Self-Adoint Linear Systems",
  journal =      "BIT",
  year =         "1989",
  volume =       "29",
  pages =        "890--915",
}

@Article{nla:Ewing:89,
  author =       "Richard E. Ewing",
  title =        "Preconditioned Conjugate Gradient Methods for
                 Large-Scale Fluid Flow Applications",
  journal =      "BIT",
  year =         "1989",
  volume =       "29",
  number =       "850--866",
}

@Article{nla:GolubVanLoan:79,
  author =       "Gene H. Golub and Charles F. Van Loan",
  title =        "Unsymmetric Positive Definite Linear Systems",
  journal =      LINAA2,
  year =         "1979",
  volume =       "28",
  pages =        "85--89",
}

@Book{nla:GolubVanLoan:83,
  author =       "Gene H. Golub and Charles F. van Loan",
  title =        "Matrix Computations",
  publisher =    "North Oxford Academic Press",
  year =         "1983",
  ISBN =         "0-946536-05-8",
}

@Book{nla:GolubVanLoan:89,
  author =       "Gene H. Golub and Charles F. van Loan",
  title =        "Matrix Computations",
  edition =      "second",
  publisher =    "The Johns Hopkins University Press",
  address =      "Baltimore",
  year =         "1989",
  ISBN =         "0-8018-3739-1",
}

@Article{nla:Hager:89,
  author =       "W. W. Hager",
  title =        "Updating the Inverse of a Matrix",
  journal =      "SIAM Rev.",
  volume =       "31",
  number =       "2",
  pages =        "221--239",
  month =        jun,
  year =         "1989",
}

@InBook{nla:Highman,
  author =       "Nicholas J. Highman",
  title =        "Analysis of the {C}holesky Decomposition of a
                 Semi-Definite Matrix",
  booktitle =    "Reliable Numerical Computation",
  publisher =    "Oxford University Press",
  year =         "1990",
  editor =       "M. G. Cox and S. J. Hammarling",
  pages =        "161--185",
}

@Book{nla:HornJohnson:85,
  author =       "Roger A. Horn and Charles A. Johnson",
  title =        "Matrix Analysis",
  publisher =    "Cambridge University press",
  address =      "Cambridge",
  year =         "1985",
  ISBN =         "0-521-30586-1",
}

@Book{nla:HornJohnson:91,
  author =       "Roger A. Horn and Charles A. Johnson",
  title =        "Topics in Matrix Analysis",
  publisher =    "Cambridge University press",
  address =      "Cambridge",
  year =         "1991",
  ISBN =         "0-521-30587-X",
}

@Article{nla:Liu:92,
  author =       "W. H. Liu",
  title =        "The Multifrontal Method for Sparse Matrix solution:
                 Theory and Practice",
  journal =      "SIAM Rev.",
  pages =        "82--109",
  volume =       "34",
  month =        mar,
  year =         "1992",
}

@Article{nla:PaoliniBrozolo:89,
  author =       "Gaia Valeria Paolini and Guiseppe Radicati di
                 Brozolo",
  title =        "Data Structures to Vectorize \({CG}\) Algorithms for
                 General Sparsity Patterns",
  journal =      "BIT",
  year =         "1989",
  volume =       "29",
  pages =        "703--718",
}

@Article{nla:ParlettPoole:73,
  author =       "B. N. Parlett and W. G. {Poole, Jr.}",
  title =        "\({QR}\), \({LU}\) and Power Iterations",
  journal =      "SIAM J. Numer. Anal.",
  year =         "1973",
  volume =       "2",
  pages =        "389--412",
}

@Book{nla:Pissanetzky:84,
  author =       "Sergio Pissanetzky",
  title =        "Sparse Matrix Theory",
  publisher =    "Academic Press Inc.",
  year =         "1984",
  address =      "London",
  ISBN =         "0-12-557580-7",
}

@Article{nla:PooleNeal:92,
  author =       "George Poole and Larry Neal",
  title =        "Gaussian Elimination: When is Scaling Beneficial?",
  journal =      LINAA2,
  year =         "1992",
  volume =       "162-164",
  pages =        "309--324",
  month =        feb,
}

@Article{nla:Watkins:82,
  author =       "David S. Watkins",
  title =        "Understanding the \({QR}\)-Algorithm",
  journal =      "SIAM Rev.",
  year =         "1982",
  volume =       "24",
  pages =        "427--440",
}

@Book{nla:Wilkinson:65,
  author =       "J. H. Wilkinson",
  title =        "The Algebraic Eigenvalue Problem",
  publisher =    "Clarendon Press",
  year =         "1965",
  address =      "Oxford",
  note =         "Monographs on Numerical Analysis",
}

@InProceedings{nla:Wilkinson:66,
  author =       "J. H. Wilkinson",
  title =        "A Priori Error Analysis of Algebraic Processes",
  pages =        "629--640",
  booktitle =    "Proceedings of the International Congress of
                 Mathematicians, Moscow",
  year =         "1966",
}

%
% Time-stamp: <26/03/94 18:11:24 Mike Dowling MooCow>
%
% Numerical Analysis bibliography
%
% If the time-stamp above does not concur with the file's date, then some
% unauthorised person has probably edited the file.
%
@Article{na:AggrawalBurgmeier:79,
  author =       "Vijay B. Aggrawal and James W. Burgmeier",
  title =        "A Round-Off Error Model with Applications to
                 Arithmetic Expressions",
  journal =      "SIAM J. Comput.",
  year =         "1979",
  volume =       "8",
  number =       "1",
  pages =        "60--72",
}

@Unpublished{na:Barlow:91,
  author =       "Jesse L. Barlow",
  title =        "Error Analysis of Update Methods for the Symmetric
                 Eigenvalue Problem",
  note =         "CS-91-23, Dept. of Computer Science, The Pensylvania
                 State University",
  year =         "1991",
  month =        aug,
  keywords =     "divide and conquer, spectral function, Toeplitz
                 matrices, eigenvalue update",
}

@Unpublished{na:BarlowToraldo:92,
  author =       "Jesse L. Barlow and Gerardo Toraldo",
  title =        "The Effect of Diagonal Scaling on Projected Gradient
                 Methods for Bound Constrained Quadratic Programming
                 Problems",
  note =         "CS-92-06, Dept. of Computer Science, The Pensylvania
                 State University",
  year =         "1992",
  month =        apr,
  keywords =     "active set, diagonal scaling",
}

@TechReport{na:Bischof:91,
  author =       "Christian H. Bischof",
  title =        "{LAPACK}: Linear Algebra Software for Supercomputers",
  institution =  "Mathematics and Computer Science Division, Argonne
                 National Science Laboratory",
  year =         "1991",
  series =       "MCS-P236-0491",
  address =      "Argonne",
  month =        jul,
}

@Book{na:Brass:77,
  author =       "Helmut Bra{\ss}",
  title =        "Quadraturformeln",
  publisher =    "Vandenhoeck \& Ruprecht in G{\"o}ttingen und
                 Z{\"u}rich",
  year =         "1977",
  number =       "3",
  series =       "Studia Mathematica",
  address =      "G{\"o}ttingen",
  language =     "German",
  ISBN =         "3-525-40142-6",
}

@Book{na:BurdenFaires:88,
  author =       "Richard L. Burden and {J. Douglas} Faires",
  title =        "Numerical Analysis",
  publisher =    "PWS-Kent Publishing Co.",
  year =         "1988",
  address =      "Boston",
  edition =      "fourth",
  ISBN =         "0-53491-585-X",
}

@Book{na:Butcher:87,
  author =       "J. C. Butcher",
  title =        "The Numerical Analysis of Ordinary Differential
                 Equations. Runge Kutta and General Methods",
  publisher =    "John Wiley \& Sons",
  year =         "1987",
  address =      "Chichester",
  note =         "A Wiley Interscience Publication",
  ISBN =         "0-471-91046-5",
}

@Book{na:Collatz:66,
  author =       "Lothar Collatz",
  title =        "The Numerical Treatment of Differential Equations",
  publisher =    "Springer-Verlag",
  year =         "1966",
  number =       "60",
  series =       "\DE Grundlehren der Mathematischen Wissenschaften",
  address =      "Berlin",
  ISBN =         "3-540-03519-2",
}

@Book{na:Engeln-MuellgesReuter:8,
  author =       "Prof. Dr. Gisela Engeln-M{\"u}llges and O. Prof. em.
                 Dr. Fritz Reuter",
  title =        "{\DE {F}ormelsammlung zue {N}umerischen {M}athematik
                 mit {S}tandard-{FORTRAN}-77}",
  publisher =    "B. I. Wissenschaftsverlag",
  year =         "1988",
  address =      "Mannheim",
  language =     "German",
  note =         "\DE 6. v{\"o}llig {\"u}berarbeitete und erweitete
                 Auf{}lage",
  ISBN =         "3-411-03185-9",
}

@Article{na:EvansOkeke:87,
  author =       "D. J. Evans and C. C. Okeke",
  title =        "A Comparison of Preconditioning Strategies",
  journal =      "Internat. J. Comput. Math.",
  year =         "1987",
  volume =       "22",
  pages =        "75--97",
  keywords =     "conditioning number, explicit preconditioning",
  annote =       "CR Category 5.14",
}

@Book{na:FeilmeierWacker:81,
  author =       "Manfred Feilmeier and Hansj{\"o}rg Wacker",
  title =        "{\DE {N}umerische {M}athematik}",
  publisher =    "Bayerischer Schulbuch-Verlag",
  year =         "1981",
  address =      "M{\"u}nchen",
  note =         "\DE Ein Lehr- und Arbeitsbuch",
  ISBN =         "3-7627-3093-8",
}

@Book{na:Froeberg:85,
  author =       "Carl-Erik Fr{\"o}berg",
  title =        "Numerical Mathematics Theory and Computer
                 Applications",
  publisher =    "The Benjamin-Cummings Publishing Company, Inc.",
  year =         "1985",
  address =      "Menlo Park",
  ISBN =         "0-8053-2530-1",
}

@Article{na:GibbsPoole,
  author =       "Nowman E. Gibbs and William G. {Poole Jr.}",
  title =        "Tridiagonalization by Permutations",
  journal =      "Comm. ACM",
  year =         "1974",
  volume =       "17",
  number =       "1",
  pages =        "20--24",
  month =        jan,
  annote =       "CR Categories: 5.14, 5.12",
}

@Article{na:Goldberg:91,
  author =       "David Goldberg",
  title =        "What every Computer Scientist Should Know about
                 Floating-Point Arithmetic",
  journal =      "ACM Comput. Surveys",
  year =         "1991",
  volume =       "23",
  number =       "1",
  pages =        "5--48",
  month =        mar,
}

@Book{na:GolubOrtega:92,
  author =       "Gene H. Golub and James M. Ortega",
  title =        "Scientific Computing and Differential Equations, An
                 Introduction to Numerical Methods",
  publisher =    "Academic Press, Inc.",
  year =         "1992",
  address =      "Boston",
  ISBN =         "0-12-289255-0",
}

@Book{na:GregoryKarney:69,
  author =       "Robert T. Gregory and David L. Karney",
  title =        "A Collection of Matrices for Testing Computational
                 Algorithms",
  publisher =    "Wiley-Interscience",
  year =         "1969",
  address =      "New York",
  lcccn =        "70-95578",
}

@Book{na:HMNauticalOffice:56,
  author =       "H. M. Nautical Almanac Office",
  title =        "Interpolation and Allied Tables",
  publisher =    "Her Majesty's Stationery Office",
  year =         "1956",
  address =      "London",
  note =         "Reprinted in 1961",
}

@Book{na:Haemerlin:78,
  author =       "G{\"u}nther H{\"a}merlin",
  title =        "{\DE {N}umerische {M}athematik}",
  publisher =    "\DE B. I. Wissenschaftssverlag",
  year =         "1978",
  number =       "498",
  series =       "\DE B. I.-Hochschultaschenb{\"u}cher",
  address =      "Mannheim",
  note =         "\DE 2., {\"U}berarbeitete Auf{}lage",
  ISBN =         "3-411-05498-0",
}

@Book{na:HennessyPatterson:90,
  author =       "John L. Hennessy and David A. Patterson",
  title =        "Computer Archetecture {A} Quantitative Approach",
  publisher =    "Morgan Kaufmann Publishers Inc.",
  year =         "1990",
  address =      "Santo Mateo, California",
  note =         "3rd Printing",
  ISBN =         "1-55860-069-8",
}

@Book{na:Holt:77,
  author =       "Maurice Holt",
  title =        "Numerical Methods in Fluid Dynamics",
  publisher =    "Springer-Verlag",
  year =         "1971",
  note =         "Springer Series in Computational Physics",
  ISBN =         "3-540-07907-6",
}

@Book{na:LancasterSalkauskas:86,
  author =       "Peter Lancaster and K\c estutis \v Salkauskas",
  title =        "Curve and Surface Fitting",
  publisher =    "Academic Press, Inc.",
  year =         "1986",
  address =      "London",
  ISBN =         "0-12-436061-0",
}

@Book{na:MeisMarcowitz:81,
  author =       "Theodor Meis and Ulrich Marcowitz",
  title =        "Numerical Solution of Partial Differential Equations",
  publisher =    "Springer-Verlag",
  year =         "1981",
  number =       "32",
  series =       "Applied Mathematical Sciences",
  address =      "New York",
  note =         "Translated from the original German by Peter R.
                 Wadsack",
  ISBN =         "0-387-90550-2",
  mscprimary =   "65MXX, 65NXX, 65P05",
}

@Article{na:OrlinRothblum:85,
  author =       "J. B. Orlin and U. G. Rothblum",
  title =        "Computing Optimal Scalings by Parametric Network
                 Algorithms",
  journal =      "Math. Programming",
  year =         "1985",
  volume =       "32",
  pages =        "1--10",
  keywords =     "scaling, network algorithms",
}

@Book{na:Ortega:90,
  author =       "James M. Ortega",
  title =        "Numerical Analysis {A} Second Course",
  publisher =    "Society for Industrial and Applied Mathematics",
  year =         "1990",
  number =       "3",
  series =       "Classics in Applied Mathematics",
  address =      "Philadelphia",
  ISBN =         "0-89871-250-5",
}

@Book{na:Powell:81,
  author =       "M. J. D. Powell",
  title =        "Approximation Theory and Methods",
  publisher =    "Cambridge University Press",
  year =         "1981",
  address =      "Cambridge",
  ISBN =         "0-521-22472-1",
}

@Book{na:PressTeukolskyVetterlingFlannery:86,
  author =       "William H. Press and Saul A. Teukolsky and William T.
                 Vetterling and Brian P. Flannery",
  title =        "Numerical Recipes in {FORTRAN} {T}he Art of Scientific
                 Computing",
  publisher =    "Cambridge University Press",
  year =         "1986",
  address =      "Cambridge",
  ISBN =         "0 521 30811 9",
}

@Book{na:PressTeukolskyVetterlingFlannery:88,
  author =       "William H. Press and Saul A. Teukolsky and William T.
                 Vetterling and Brian P. Flannery",
  title =        "Numerical Recipes in {C} {T}he Art of Scientific
                 Computing",
  publisher =    "Cambridge University Press",
  year =         "1988",
  edition =      "second",
  address =      "Cambridge",
  ISBN =         "0 521 43064 X",
}

@Book{na:PressTeukolskyVetterlingFlannery:92,
  author =       "William H. Press and Saul A. Teukolsky and William T.
                 Vetterling and Brian P. Flannery",
  title =        "Numerical Recipes in {FORTRAN} {T}he Art of Scientific
                 Computing",
  publisher =    "Cambridge University Press",
  year =         "1992",
  address =      "Cambridge",
  ISBN =         "0 521 35465-X",
}

@Book{na:Schwartz:88,
  author =       "Hans Rudolf Schwartz",
  title =        "{\DE Numerische {M}athematik}",
  publisher =    "B. G. Teubner",
  year =         "1988",
  address =      "Stuttgart",
  note =         "\DE Teubner Ingenieur-Mathematik",
  ISBN =         "3-519-12960-4",
}

@Book{na:Schwartz:91,
  author =       "H. R. Schwartz",
  title =        "{\DE Methode der finiten {E}lemente}",
  publisher =    "B. G. Teubner",
  year =         "1991",
  number =       "47",
  series =       "\DE Leitf{\"a}den der angewandten Mathematik und
                 Mechanik LAMM",
  address =      "\DE Stuttgart",
  language =     "German",
  ISBN =         "3-519-22349-X",
}

@Book{na:Stoer:79,
  author =       "Josef Stoer",
  title =        "{\DE Einf{\"u}hrung in die {N}umerische
                 {M}athematik~{I}}",
  publisher =    "Springer-Verlag",
  year =         "1979",
  language =     "German",
  volume =       "15",
  series =       "\DE Heidelberger Taschenb{\"u}cher",
  address =      "Berlin",
  note =         "\DE 3. verbesserte Auf{}lage",
  ISBN =         "3-540-09346-X",
  mscprimary =   "65-01, 65-02, 65B05, 65B15, 65D05, 65D30, 65F05,
                 65F20, 65F25, 65F35, 65G05, 65H05, 65H10",
}

@Book{na:StoerBulirsch:78,
  author =       "Josef Stoer and R. Bulirsch",
  title =        "{\DE Einf{\"u}hrung in die {N}umerische
                 {M}athematik~{II}}",
  publisher =    "Springer-Verlag",
  year =         "1978",
  volume =       "15",
  series =       "\DE Heidelberger Taschenb{\"u}cher",
  address =      "Berlin",
  language =     "German",
  ISBN =         "3-540-08840-7",
  mscprimary =   "65-01, 65-02, 65B05, 65B15, 65D05, 65D30, 65F05,
                 65F20, 65F25, 65F35, 65G05, 65H05, 65H10",
}

@Book{na:StoerBulirsch:80,
  author =       "J. Stoer and R. Bulirsch",
  title =        "Introduction to Numerical Analysis",
  publisher =    "Springer-Verlag",
  year =         "1980",
  address =      "New York",
  note =         "Originally published in German in the two
                 volumes~\cite{na:Stoer:79}
                 and~\cite{na:StoerBulirsch:78}",
  ISBN =         "0-387-90420-4",
  mscprimary =   "65-01",
}

@Book{na:Wegener:89,
  author =       "Ingo Wegener",
  title =        "{\DE Effiziente Algorithmen f{\"u}r grundliegende
                 {F}unktionen}",
  publisher =    "B. G. Teubner",
  year =         "1989",
  address =      "Stuttgart",
  language =     "German",
  ISBN =         "3-519-02276-1",
}

@Book{na:Werner:75,
  author =       "Helmut Werner",
  title =        "{\DE Praktische {M}athematik~{I}}",
  publisher =    "Springer-Verlag",
  year =         "1975",
  address =      "Berlin",
  edition =      "second",
  language =     "German",
  note =         "\DE Hochschultext",
  ISBN =         "3-540-06974-7",
  mscprimary =   "65-01, 56B05, 65FXX, 65G01, 65HXX, 65J05, 64S05",
}

@Book{na:WernerSchaback:79,
  author =       "Helmut Werner and R. Schaback",
  title =        "{\DE Praktische {M}athematik-{II}}",
  publisher =    "Springer-Verlag",
  year =         "1979",
  address =      "Berlin",
  edition =      "second",
  language =     "German",
  note =         "\DE Hochschultext",
  ISBN =         "3-540-09193-9",
  mscprimary =   "65-02, 56DXX, 65L05, 65N05, 46N06, 41-01",
}

@Book{na:Wilkes:66,
  author =       "M. V. Wilkes",
  title =        "Mumerical Analysis",
  publisher =    "Cambridge University Press",
  year =         "1966",
  address =      "Cambridge",
  ISBN =         "0-521-06806-1",
}

@Book{na:Zurm{\"u}hl:53,
  author =       "R. Zurm{\"u}hl",
  title =        "{\DE Praktische {M}athematik f{\"u}r {I}ngenieure und
                 {P}hysiker}",
  publisher =    "Springer-Verlag",
  year =         "1953",
  address =      "Berlin",
}

@Book{na:deBoor:78,
  author =       "Carle de Boor",
  title =        "A Practical Guide to Splines",
  publisher =    "Springer-Verlag",
  year =         "1978",
  number =       "27",
  series =       "Applied Mathematical Sciences",
  address =      "New York",
  ISBN =         "0-387-90356-9",
  mscprimary =   "65Dxx, 41A15",
}

@Book{pc:Modi:88,
  author =       "Jagdish J. Modi",
  title =        "Parallel Algorithms and Matrix Computations",
  publisher =    "Clarendon Press",
  year =         "1988",
  address =      "Oxford",
  note =         "Oxford Applied Mathematics and Computing Science
                 Series",
  ISBN =         "0-19-859670-7",
}

@Book{pm:Prenter:89,
  author =       "P. M. Prenter",
  title =        "Splines and Variational Methods",
  publisher =    "John Wiley \& Sons",
  year =         "1989",
  address =      "New York",
  note =         "Wiley Classics Edition",
  ISBN =         "0-471-50402-5",
}

%
% Time-stamp: <17/03/94 14:48:22 Mike Dowling MooCow>
%
% bibliography of miscellaneous extras
%
% If the time-stamp above does not concur with the file's date, then some
% unauthorised person has probably edited the file.
%
@Book{Achilles:78,
  author =       "Dietmar Achilles",
  title =        "{\DE Die {F}ourier-{T}ransformation in der
                 {S}ignalverarbeitung}",
  publisher =    "Springer-Verlad",
  year =         "1978",
  address =      "Berlin",
  language =     "German",
  ISBN =         "3-540-08362-6",
}

@InBook{Balinski:91,
  author =       "Michael L. balinski",
  title =        "Mathematical Programming: Journal, Society,
                 Recollections",
  chapter =      "2",
  crossref =     "lp:LenstraKanSchrijver:91",
  publisher =    "Elsevier Science Publishers B. V.",
  year =         "1991",
  editor =       "Jan Karel Lenstra and Alexander H. G. Rinnoy Kan and
                 Alexander Schrijver",
  pages =        "5--18",
  address =      "Amsterdam",
  ISBN =         "0-444-88818-7",
}

@Book{BurgHafWille:85,
  author =       "Klemens Burg and Herbert Haf and Friedrich Wille",
  title =        "{\DE H{\"o}here {M}athematik f{\"u}r {I}ngenieure,
                 {B}and~{I} {A}nalysis}",
  publisher =    "B. G. Teubner",
  year =         "1985",
  address =      "Stuttgart",
  language =     "German",
  ISBN =         "3-519-02955-3",
}

@Book{BurgHafWille:85a,
  author =       "Klemens Burg and Herbert Haf and Friedrich Wille",
  title =        "{\DE H{\"o}here {M}athematik f{\"u}r {I}ngenieure,
                 {B}and~{III} {G}ew{\"o}hnliche
                 {D}ifferentialgleichungen, {D}istributionen,
                 {I}ntergraltransformationen}",
  publisher =    "B. G. Teubner",
  year =         "1985",
  address =      "Stuttgart",
  language =     "German",
  ISBN =         "3-519-02957-X",
}

@Book{CourantRobbins:41,
  author =       "Richard Courant and Herbert Robbins",
  title =        "What Is Mathematics?",
  publisher =    "Oxford University Press",
  year =         "1941",
  address =      "London",
}

@InBook{Edmonds:91,
  author =       "Jack Edmonds",
  title =        "A Glimpse of Heaven",
  chapter =      "4",
  crossref =     "lp:LenstraKanSchrijver:91",
  publisher =    "Elsevier Science Publishers B. V.",
  year =         "1991",
  editor =       "Jan Karel Lenstra and Alexander H. G. Rinnoy Kan and
                 Alexander Schrijver",
  pages =        "32--54",
  address =      "Amsterdam",
  ISBN =         "0-444-88818-7",
}

@InBook{Iri:91,
  author =       "Masao Iri",
  title =        "Growth of Mathematical Programming in Japan",
  chapter =      "7",
  crossref =     "lp:LenstraKanSchrijver:91",
  publisher =    "Elsevier Science Publishers B. V.",
  year =         "1991",
  editor =       "Jan Karel Lenstra and Alexander H. G. Rinnoy Kan and
                 Alexander Schrijver",
  pages =        "65--76",
  address =      "Amsterdam",
  ISBN =         "0-444-88818-7",
}

@Article{JacksonBoggsNashPowell:91,
  author =       "R. H. F. Jackson and P. T. Boggs and S. G. Nash and S.
                 Powell",
  title =        "Guidelines for Reporting Results of Computational
                 Experiments. Report of the ad hoc Committee",
  journal =      "Math. Programming",
  year =         "1991",
  volume =       "49",
  pages =        "413--425",
}

@Book{Kreyszih:88,
  author =       "Erwin Kreyszig",
  title =        "Advanced Engineering Mathematics",
  publisher =    "John Wiley \& Sons",
  year =         "1988",
  address =      "New York",
  edition =      "sixth",
  ISBN =         "0-471-85824-2",
}

@InBook{Kuhn:91,
  author =       "Harold W. Kuhn",
  title =        "On the Origin of the {H}ungarian Method",
  chapter =      "8",
  crossref =     "lp:LenstraKanSchrijver:91",
  publisher =    "Elsevier Science Publishers B. V.",
  year =         "1991",
  editor =       "Jan Karel Lenstra and Alexander H. G. Rinnoy Kan and
                 Alexander Schrijver",
  pages =        "77--81",
  address =      "Amsterdam",
  ISBN =         "0-444-88818-7",
}

@InBook{Lawler:91,
  author =       "Eugene L. Lawler",
  title =        "Old Stories",
  chapter =      "10",
  crossref =     "lp:LenstraKanSchrijver:91",
  publisher =    "Elsevier Science Publishers B. V.",
  year =         "1991",
  editor =       "Jan Karel Lenstra and Alexander H. G. Rinnoy Kan and
                 Alexander Schrijver",
  pages =        "97--106",
  address =      "Amsterdam",
  ISBN =         "0-444-88818-7",
}

@Book{MAFFL:76,
  author =       "Fisheries Ministry of Agriculture and Food",
  title =        "Beekeeping",
  publisher =    "Her Majesty's Stationary Office",
  year =         "1976",
  address =      "London",
  note =         "First published in 1929, Bulletin No. 9",
  ISBN =         "0-11-241209-2",
}

@InBook{Mangasarian:91,
  author =       "Mathematical Programming Musings",
  title =        "Growth of Mathematical Programming in Japan",
  chapter =      "11",
  crossref =     "lp:LenstraKanSchrijver:91",
  publisher =    "Elsevier Science Publishers B. V.",
  year =         "1991",
  editor =       "Jan Karel Lenstra and Alexander H. G. Rinnoy Kan and
                 Alexander Schrijver",
  pages =        "107--113",
  address =      "Amsterdam",
  ISBN =         "0-444-88818-7",
}

@Book{Metcalf:85,
  author =       "M. Metcalf",
  title =        "{FORTRAN} Optimization",
  publisher =    "Academic Press",
  year =         "1985",
  address =      "Orlando, Florida",
  edition =      "Revised Edition",
  ISBN =         "0-12-492482-4",
}

@Book{Minorski:88,
  author =       "W. P. Minorski",
  title =        "{\DE Aufgabensammlung der h{\"o}heren {M}athematik}",
  publisher =    "Friedr. Vieweg \& Sohn",
  year =         "1988",
  address =      "Braunschweig",
  language =     "German",
  note =         "\DE Viewegs Fachb{\"u}cher der Technik",
  ISBN =         "3-528-84060-9",
}

@InBook{Nemhauser:91,
  author =       "George L. Nemhauser",
  title =        "Mathematical Programming at {C}ornell and {CORE}: The
                 Super Seventies",
  chapter =      "12",
  crossref =     "lp:LenstraKanSchrijver:91",
  publisher =    "Elsevier Science Publishers B. V.",
  year =         "1991",
  editor =       "Jan Karel Lenstra and Alexander H. G. Rinnoy Kan and
                 Alexander Schrijver",
  pages =        "114--118",
  address =      "Amsterdam",
  ISBN =         "0-444-88818-7",
}

@TechReport{uz:BettsBrown:94,
  author =       "L. M. Betts and J. R. Brown",
  title =        "Proportional equity flow problem for terminal arcs",
  institution =  "Graduate school of Management, Kent state university",
  year =         "1994",
  month =        jul,
  address =      "Kent, OH 44242",
}

@Book{uz:BlythJanowitz:72,
  author =       "T. S. Blyth and M. F. Janowitz",
  title =        "Residuation Theory",
  year =         "1972",
  publisher =    "Pergamon Press",
  address =      "Oxford",
}

@TechReport{uz:BurkardDlaskaKlinz:91,
  author =       "R. E. Burkard and K. Dlaska and B. Klinz",
  title =        "The quickest flow problem",
  institution =  "Institut f{\"u}r Mathematik, Technische
                 Universit{\"a}t Graz",
  year =         "1991",
  address =      "Graz",
  number =       "188",
}

@Article{uz:ChaddaHardgraveHudsonSegalSuurballe:71,
  author =       "R. L. Chadda and W. W. Hardgrave and D. J. Hudson and
                 M. Segal and J. W. Suurballe",
  title =        "Allocation of totalsample size when only the stratum
                 means are of interest",
  journal =      "Technometrics",
  year =         "1971",
  volume =       "13",
  pages =        "817--831",
}

@Article{uz:Cui:88,
  author =       "W. T. Cui",
  title =        "A network simplex method for the maximum balanced flow
                 problem",
  journal =      "J. Oper. Res. Soc. Japan",
  year =         "1988",
  volume =       "31",
  pages =        "551--564",
}

@Article{uz:Czuchra:86,
  author =       "W. Czuchra",
  title =        "A graphical method to solve a maximin allocation
                 problem",
  journal =      "European J. Oper. Res.",
  year =         "1986",
  volume =       "26",
  pages =        "259--261",
}

@Article{uz:Eiselt:86,
  author =       "H. A. Eiselt",
  title =        "Continuous maximin knapsack problems with {GLB}
                 constraints",
  journal =      "Math. Programming",
  year =         "1986",
  volume =       "36",
  pages =        "114--121",
}

@Article{uz:FujishigeIwanoMisonoTezuka:94,
  author =       "S. Fujishige and K. Iwano and S. Misono and S.
                 Tezuka",
  title =        "A new scaling algorithm for the maximum mean cut
                 problem",
  journal =      "Algorithmica",
  year =         "1994",
  volume =       "11",
  pages =        "243--255",
}

@Article{uz:GalloGrigoriadesTarjan:89,
  author =       "G. Gallo and M. D. Grigoriades and R. E. Tarjan",
  title =        "A fast parametric maximum flow algorithm and
                 applications",
  journal =      "SIAM J. Comput.",
  year =         "1989",
  volume =       "18",
  pages =        "30--55",
}

@Article{uz:Groenevelt:91,
  author =       "H. Groenevelt",
  title =        "Two algorithms for maximizing a separable concave
                 function over a polymatroid feasible region",
  journal =      "European J. Oper. Res.",
  year =         "1991",
  volume =       "54",
  pages =        "227--236",
}

@Article{uz:Groppen:77,
  author =       "V. O. Groppen",
  title =        "Extremal problems on graphs with a minimax goal
                 function",
  journal =      "Translated from Avtomat. i. Telemekh.",
  year =         "1977",
  volume =       "6",
  pages =        "97--102",
}

@Article{uz:GuptaLuss:75,
  author =       "S. K. Gupta and H. Luss",
  title =        "Allocation of effort resources among competing
                 activities",
  journal =      "Oper. Res.",
  year =         "1975",
  volume =       "23",
  pages =        "360--366",
}

@Article{uz:IchimoriKatoh:91,
  author =       "N. Katoh {T. Ichimori}",
  title =        "A two-commodity sharing problem on networks",
  journal =      "Networks",
  year =         "1991",
  volume =       "21",
  pages =        "547--563",
}

@Article{uz:LemarechalMifflin:82,
  author =       "C. Lemar\'echal and R. Mifflin",
  title =        "Global and superlinear convergence of an algorithm for
                 one-dimensional minimization of convex functions",
  journal =      "Math. Programming",
  year =         "1982",
  volume =       "24",
  pages =        "241--256",
}

@TechReport{uz:LemarechalNemirovskiiNesterov:91,
  author =       "C. Lemar\'echal and A. Nemirovskii and Y. Nesterov",
  title =        "New variants of bundle methods",
  institution =  "Institut National de Recherche en Informatique et en
                 Automatique",
  year =         "1991",
  address =      "Les Chesnay Cedex",
  number =       "1508",
}

@Article{uz:Luss:92,
  author =       "H. Luss",
  title =        "Minimax resource allocation problems: optimization and
                 parametric analysis",
  journal =      "European J. Oper. Res.",
  year =         "1992",
  volume =       "60",
  pages =        "76--86",
}

@Article{uz:LussSmith:86,
  author =       "H. Luss and D. R. Smith",
  title =        "Resource allocation among competing activities: {A}
                 lexicographic minimax approach",
  journal =      "Oper. Res. Lett.",
  year =         "1986",
  volume =       "5",
  pages =        "227--231",
}

@Article{uz:Mjelde:83,
  author =       "K. M. Mjelde",
  title =        "Max-min resource allocation",
  journal =      "BIT",
  year =         "1983",
  volume =       "23",
  pages =        "529--537",
}

@Article{uz:Nakayama:86,
  author =       "A. Nakayama",
  title =        "A polynomial algorithm for the maximum balanced flow
                 problem with constant balancing rate function",
  journal =      "J. Oper. Res. Soc. Japan",
  year =         "1986",
  volume =       "29",
  pages =        "400--410",
}

@Article{uz:Nakayama:90,
  author =       "A. Nakayama",
  title =        "A polynomial-time binary search algorithm for the
                 maximum balanced flow problem",
  journal =      "J. Oper. Res. Soc. Japan",
  year =         "1990",
  volume =       "33",
  pages =        "1--11",
}

@MastersThesis{uz:Weihe:92,
  author =       "K. Weihe",
  title =        "An algorithmic approach to generalized time-cost
                 tradeoff problems",
  year =         "1992",
  address =      "Berlin",
  school =       "Technische Universit{\"a}t Berlin",
}

@Article{uz:Zeitlin:81,
  author =       "Z. Zeitlin",
  title =        "Integer allocation problems of min-max type with
                 quasiconvex separable functions",
  journal =      "Oper. Res.",
  year =         "1981",
  volume =       "29",
  pages =        "201--211",
}

%
%  Time-stamp: <1995/05/19 15:25:05 Michael Bussieck moa.math.nat.tu-bs.de>
%
%  Misc bibliography of M. Bussieck
%
% If the time-stamp above does not concur with the file's date, then some
% unauthorised person has probably edited the file.
%
@Book{bus:AhujaMagnantiOrlin:93,
  author =       "Ravindra K. Ahuja and Thomas L. Magnanti and James B.
                 Orlin",
  title =        "Network Flows",
  publisher =    "Prentice Hall, Inc.",
  year =         "1993",
  address =      "Englewood Cliffs, New Jersey",
  annote =       "ISBN 0-13-617549-X",
}

@InProceedings{bus:AielloAwerbuchMaggsRao:93,
  author =       "William Aiello and Baruch Awerbuch and Bruce Maggs and
                 Satish Rao",
  title =        "Approximate load balancing on dynamic and asyncronous
                 networks",
  volume =       "25",
  booktitle =    "Proceedings of the Annual ACM Symposium on Theory of
                 Computing",
  year =         "1993",
}

@Article{bus:Andreae:86,
  author =       "Thomas Andreae",
  title =        "On an Extremal Problem Concerning the Interval Number
                 of a Graph",
  journal =      "Discrete Appl. Math.",
  year =         "1986",
  volume =       "14",
  pages =        "1--9",
}

@Article{bus:Andreae:92,
  author =       "Thomas Andreae",
  title =        "Some Results on Visibility Graphs",
  journal =      "Discrete Appl. Math.",
  year =         "1992",
  volume =       "40",
  pages =        "5--17",
}

@Article{bus:AndreaeAigner:89,
  author =       "T. Andreae and M. Aigner",
  title =        "The Total Interval Number of a Graph",
  journal =      "J. Combin. Theory Ser. B",
  year =         "1989",
  volume =       "46",
  number =       "1",
  pages =        "7--21",
}

@InProceedings{bus:AspnesAzarFiatPlotkinWaarts:93,
  author =       "James Aspnes and Yossi Azar and Amos Fiat and Serge
                 Plotkin and Orli Waarts",
  title =        "On-line load balancing with applications to machine
                 scheduling and virtual circuit routing",
  volume =       "25",
  booktitle =    "Proceedings of the Annual ACM Symposium on Theory of
                 Computing",
  year =         "1993",
}

@TechReport{bus:AvrielPennShpirer:94,
  author =       "Modecai Avriel and Michal Penn and Naomi Shpirer",
  title =        "Container ship stowage problem: complexity and
                 applications to coloring of circle graphs",
  institution =  "Faculty of Industrial Engineering and Management",
  year =         "1994",
  series =       "Preprint",
}

@Article{bus:BabayevMardanov:94,
  author =       "Djangir A. Babayev and Sahib S. Mardanov",
  title =        "Reducing the Number of Variables in Integer and Linear
                 Programming Problems",
  journal =      "Comput. Optim. and Applics.",
  year =         "1994",
  volume =       "3",
  pages =        "99--109",
}

@Article{bus:Babel:94,
  author =       "Luitpold Babel",
  title =        "A fast algorithm for the maximum weigth clique
                 problem",
  journal =      "Computing",
  year =         "1994",
  volume =       "52",
  number =       "1",
  pages =        "31--38",
}

@Article{bus:BabelTinhofer:90,
  author =       "Luitpold Babel and Gottfried Tinhofer",
  title =        "A Branch and Bound Algorithm for the Maximum Clique
                 Problem",
  journal =      "Z. Oper. Res. Ser. A-B",
  year =         "1990",
  volume =       "34",
  pages =        "207--217",
}

@Article{bus:BalasCeriaCornuejols:94,
  author =       "Egon Balas and Sebasitian Ceria and Gerard
                 Cornuejols",
  title =        "A lift-and-project cutting plane algorithm for mixed
                 0-1 programs",
  journal =      "Math. Programming",
  year =         "1993",
  volume =       "58",
  number =       "3",
  pages =        "295--324",
}

@TechReport{bus:BalasCeriaCornuejols:94,
  author =       "Egon Balas and Sebasitian Ceria and Gerard
                 Cornuejols",
  title =        "Mixed 0-1 programming by lift-and-project in a
                 branch-and-cut framework",
  institution =  "Carnegie Mellon University",
  year =         "1994",
  series =       "Management Science Research Report",
  number =       "603",
  address =      "Pittsburgh, Pennsylvania 15213",
}

@TechReport{bus:BalasCeriaCornuejolsPataki:94,
  author =       "Egon Balas and Sebasitian Ceria and Gerard Cornuejols
                 and Gabor Pataki",
  title =        "Polyhedral Methods for the maximum clique problem",
  institution =  "Carnegie Mellon University",
  year =         "1994",
  series =       "Management Science Research Report",
  number =       "602",
  address =      "Pittsburgh, Pennsylvania 15213",
}

@Article{bus:BalasPulleyblank:83,
  author =       "Egon Balas and William Pulleyblank",
  title =        "The perfectly matchable subgraph polytope of a
                 bipartite graph",
  journal =      "Networks",
  year =         "1983",
  volume =       "13",
  pages =        "495--516",
}

@Article{bus:Beasley:90,
  author =       "J. E. Beasley",
  title =        "{OR}-Library: distributing test problems by electronic
                 mail",
  journal =      "J. Opl. Res. Soc.",
  year =         "1990",
  volume =       "41",
  number =       "11",
  pages =        "1069--1072",
}

@Article{bus:BienstockMarcotte:90,
  author =       "Dan Bienstock and Odile Marcotte",
  title =        "On a network design problem that is intractable on
                 trees",
  journal =      "Math. Oper. Res.",
  year =         "1990",
  volume =       "15",
  number =       "3",
  pages =        "530--544",
}

@Article{bus:BixbyGregoryLustigMarstenShanno:92,
  author =       "R. E. Bixby and J. W. Gregory and I. J. Lustig and R.
                 E. Marsten and D. F. Shanno",
  title =        "Very Large--Scale Linear Programming: {A} Case Study
                 in Combining Interior Point and Simplex Methods",
  journal =      "Oper. Res.",
  year =         "1992",
  volume =       "40",
  number =       "5",
  pages =        "885--897",
}

@Book{bus:BrualdiRyser:91,
  author =       "Richard A. Brualdi and Herbert J. Ryser",
  title =        "Combinatorial Matrix Theory",
  publisher =    "Cambridge University Press",
  year =         "1991",
  address =      "Cambridge",
}

@TechReport{bus:Bussieck:94,
  author =       "Michael Bussieck",
  title =        "The Minumal Cut Cover of a Graph",
  institution =  MOTUBS,
  year =         "1994",
  series =       "1",
  annote =       "submitted to OR Letters",
}

@Misc{bus:CPLEX:94,
  author =       "{CPLEX Optimization, Inc.}",
  title =        "Using the {CPLEX} Callable Library",
  howpublished = "Manual",
  year =         "1994",
}

@InCollection{bus:ChrobakLarmore:92,
  author =       "Marek Chrobak and Lawrence L. Larmore",
  title =        "The Server Problem and On-Line Games",
  publisher =    "DIMACS Series",
  year =         "1992",
  editor =       "L. McGeoch and D. Sleator",
  volume =       "7",
}

@Book{bus:Comer:88,
  author =       "Douglas Comer",
  title =        "Internetworking With Tcp/ip",
  publisher =    "Prentice Hall",
  address =      "London",
  year =         "1988",
  ISBN =         "0-13-470188-7",
  descriptor =   "Ethernetprotokoll, Ftp, Internetz, Local-area-network,
                 Packet-switching, Telnet",
  annote =       "Dargestellt wird das Rechner-kommunikationspaket
                 Tcp/ip. Ausgehend von Der, dem Netzwerk
                 Zugrundeliegenden Technologie,werden die Konzepte der
                 Verschiedenen Protokollschichten des Paketes Darpa
                 Internet Erlaeutert.da die Gesamte Bandbreiteder
                 Protokollschichten von der Hardware bis zu den
                 Anwenderorientierten Diensten, Wie Z.b. Elektronische
                 Post, Alles Dargestellt Wird, Eignet sich das Buch Sehr
                 Gut, Um Rechnernetze im Allgemeinen zu Verstehenund die
                 Problematiken Identifizieren zu Koennen.",
}

@Book{bus:Comer:91,
  author =       "Douglas Comer",
  title =        "Internetworking With Tcp/ip Vol. 1: Principles,
                 Protocols and Architecture",
  publisher =    "Prentice Hall",
  edition =      "2",
  address =      "London",
  year =         "1991",
  ISBN =         "0-13-474321-0",
  descriptor =   "Cmoi, Ftp, Gateway, Internetz, Lan, Nfs,
                 Rechnerverbund, Smtp, Snmp, Tcp/ip, Telnet",
  annote =       "die Zweite Auflage Dieses Buches Gibt eine Sehr Gute
                 Einfuehrung in die Wichtigsten Protokolle der Tcp/ip
                 Umgebungen Undderen Zusammenwirken. der Umfang der
                 Zweiten Auflage ist Um Neuere Protokolle (z.b. Snmp)
                 Erweitert Worden.",
}

@Article{bus:Cook:83,
  author =       "Stephen A. Cook",
  title =        "An Overview of Computational Complexity",
  journal =      "Comm. ACM",
  year =         "1983",
  volume =       "26",
  number =       "6",
  pages =        "400--408",
}

@Article{bus:CookGerardsSchrijverTardos:86,
  author =       "W. Cook and A. M. H Gerards and A. Schrijver and E.
                 Tardos",
  title =        "Sensitivity results in integer programming",
  journal =      "Math. Programming",
  year =         "1986",
  volume =       "34",
  pages =        "251--264",
}

@Article{bus:CookGerardsSchrijverTardos:86,
  author =       "W. Cook and A. M. H. Gerards and A. Schrijver and E.
                 Tardos",
  title =        "Sensitivity theorems in integer linear programming",
  journal =      "Math. Programming",
  year =         "1986",
  volume =       "34",
  number =       "1",
  pages =        "251--264",
}

@Article{bus:CorneilLerchsBurlingham:81,
  author =       "D. G. Corneil and H. Lerchs and L. Stewart
                 Burlingham",
  title =        "Complement reducible graphs",
  journal =      "Discrete Appl. Math.",
  year =         "1981",
  volume =       "3",
  pages =        "163--174",
}

@Article{bus:CorneilPerlStewart:85,
  author =       "D. G. Corneil and Y. Perl and L. K. Stewart",
  title =        "A linear recognition algorithm for cographs",
  key =          "cograph, permutation graph, perfect graph, linear
                 algorithm, examination, scheduling",
  journal =      "SIAM J. Comput.",
  year =         "1985",
  volume =       "14",
  number =       "4",
  pages =        "926--934",
}

@Article{bus:Covington:89,
  author =       "Jacinta Covington",
  title =        "A Universal Structure for {N}--free Graphs",
  journal =      "Proc. London Math. Soc. (3)",
  year =         "1989",
  volume =       "58",
  pages =        "1--16",
}

@Article{bus:Cunningham:85,
  author =       "William H. Cunningham",
  title =        "Optimal attack and reinforcement of a network",
  journal =      "J. Assoc. Comput. Mach.",
  year =         "1985",
  volume =       "32",
  number =       "3",
  pages =        "549--561",
}

@Article{bus:DerigsMeier:89,
  author =       "U. Dergis and W. Meier",
  title =        "Implementing {G}oldberg's Max--Flow--Algorithm -- {A}
                 Computational Investigation",
  journal =      "Z. Oper. Res. Ser. A-B",
  year =         "1989",
  volume =       "6",
  pages =        "383--403",
}

@Article{bus:DijkhuizenFaigle:93,
  author =       "G. Dijkhuizen and U. Faigle",
  title =        "A cutting-plane approach to the edge-weighted maximal
                 clique problem",
  journal =      "European J. Oper. Res.",
  year =         "1993",
  volume =       "69",
  pages =        "121--130",
}

@Article{bus:Dinic:70,
  author =       "E. A. Dinic",
  title =        "Algorithm for Solution of a Problem of Maximum Flow in
                 a Network with Power Estimation",
  journal =      "Soviet Math. Dokl.",
  year =         "1970",
  volume =       "194",
  pages =        "1277--1280",
}

@Article{bus:Dinkelbach:67,
  author =       "W. Dinkelbach",
  title =        "On nonlinear fractional programming",
  journal =      "Management Sci.",
  year =         "1967",
  volume =       "13",
  pages =        "492--498",
}

@Article{bus:DixonRauchTarjan:92,
  author =       "Brandon Dixon and Minika Rauch and Robert E. Tarjan",
  title =        "Verification and Sensitivity Analysis of Minimum
                 Spanning Trees in Linear Time",
  journal =      "SIAM J. Comput.",
  year =         "1992",
  volume =       "21",
  number =       "6",
  pages =        "1184--1192",
  month =        dec,
}

@TechReport{bus:ErvolinaMcGormick:90,
  author =       "T. R. Ervolina and S. T. McGormick",
  title =        "A Strongly Polynomial Cancel and Tighten Algorithm for
                 Minimum Cost Network Flow",
  institution =  "Faculty of Commerce and Business Administration,
                 University of British Columbia",
  series =       "UBC Working Paper",
  year =         "1990",
  number =       "90-MSC-010",
  month =        may,
}

@TechReport{bus:ErvolinaMcGormick:90-2,
  author =       "T. R. Ervolina and S. T. McGormick",
  title =        "A Strongly Polynomial Maximum Mean Cut Cancelling
                 Algorithm",
  institution =  "Faculty of Commerce and Business Administration,
                 University of British Columbia",
  series =       "UBC Working Paper",
  year =         "1990",
  number =       "90-MSC-009",
  month =        may,
}

@Book{bus:EvansMinieka:93,
  author =       "James R. Evans and Edward Minieka",
  title =        "Optimization Algorithms for Networks and Graphs",
  publisher =    "Marcel Dekker Inc.",
  year =         "1993",
  address =      "New York",
  edition =      "second",
  note =         "Price: \$59.95 with DOS Software. Review in Interfaces
                 23(3), 1993 by Renato De Leone",
}

@TechReport{bus:FaigleGademannKern:93,
  author =       "U. Faigle and N. Gademann and W. Kern",
  title =        "A Random Polynomial Time Algorithm for Wll--Rounding
                 Convex Bodies",
  institution =  "University of Twente",
  year =         "1993",
}

@Book{bus:FangPuthenpura:93,
  author =       "Shu-Cherng Fang and Sarat Puthenpura",
  title =        "Linear Optimization and Extensions: Theory and
                 Algorithms",
  publisher =    "Prentice Hall",
  year =         "1993",
  address =      "Englewood Cliffs, New Jersey",
}

@Book{bus:FangPuthenpuraSheu:93,
  author =       "S. C. Fang and S. C. Puthenpura and R. L. Sheu",
  title =        "Solutions Manual to Linear Optimization and
                 Extensions",
  publisher =    "Prentice Hall",
  year =         "1993",
  address =      "Englewood Cliffs, New Jersey",
}

@Article{bus:Filonenko:80,
  author =       "N. V. Filonenko",
  title =        "Approximate solution of parametric integer programming
                 problems",
  journal =      "Cybernetics",
  year =         "1980",
  volume =       "15",
  pages =        "703--707",
}

@Article{bus:FischettiHamacherJornstenMaffioli:94,
  author =       "Matteo Fischetti and Horst W. Hamacher and Kurt
                 J\ornsten and Francesco Maffioli",
  title =        "Weighted $k$-cardinality trees: {C}omplexity and
                 polyhedral Structure",
  journal =      "Networks",
  year =         "1994",
  volume =       "24",
  number =       "1",
  pages =        "11--21",
}

@Article{bus:FrankTardos:88,
  author =       "Andr\'{a}s Frank and \'{E}va Tardos",
  title =        "Generalized Polymatroids and Submodular Flows",
  journal =      "Math. Programming",
  year =         "1988",
  volume =       "42",
  pages =        "489--563",
}

@Misc{bus:FritschVornberger:95,
  author =       "Andeas Fritsch and Oliver Vornberger",
  title =        "Cutting Stock by Iterated Matching",
  year =         "1995",
  note =         "Messestand Uni Osnabr{\"u}ck",
}

@Book{bus:FourerGayKernighan:93,
  author =       "R. Fourer and D. M. Gay and B. W. Kernighan",
  title =        "{AMPL} -- {A} Modeling Language for Mathematical
                 Programming",
  publisher =    "The Scientific Press",
  year =         "1993",
  address =      "South San Francisco",
}

@TechReport{bus:Gabow:93,
  author =       "Harold N. Gabow",
  title =        "A Framekwork for Cost-scaling Algorithms for
                 Submodular Flow Problems",
  institution =  "Department of Computer Science, University of
                 Colorado",
  year =         "1993",
}

@Book{bus:GareyJohnson:79,
  author =       "Michael R. Garey and David S. Johnson",
  title =        "Computers and Intractibility, {A} Guide to the Theory
                 of {\sc np}-Completeness",
  publisher =    "W. H. Freeman and Company",
  year =         "1979",
  address =      "New York",
}

@Article{bus:GeoffrionNauss:77,
  author =       "A. M. Geoffrion and R. M. Nauss",
  title =        "Parametric and postoptimality analysis in integer
                 linear progrmming",
  journal =      "Management Sci.",
  year =         "1977",
  volume =       "18",
  number =       "453--466",
}

@Proceedings{bus:GesselRota:87,
  title =        "Classic papers in combinatorics",
  year =         "1987",
  editor =       "Ira Gessel and Gian-Carlo Rota",
  publisher =    "Birkhaeuser",
}

@Article{bus:GilbertPollak:68,
  author =       "E. N. Golbert and H. G. Pollak",
  title =        "{S}teiner Minimal Trees",
  journal =      "SIAM J. Appl. Math.",
  year =         "1968",
  volume =       "16",
  number =       "1",
  pages =        "1--29",
}

@Article{bus:GoldbergTarjan:88,
  author =       "Andrew V. Goldberg and Robert E. Tarjan",
  title =        "A New Approach to the Maximum--Flow Problem",
  journal =      "J. Assoc. Comput. Mach.",
  year =         "1988",
  volume =       "35",
  number =       "4",
  pages =        "921--940",
}

@Article{bus:GoldfarbGrigoriadis:88,
  author =       "D. Goldfarb and D. R. Grigoriadis",
  title =        "A computational comparison of the {D}inic and the
                 network simplex methods for maximal flow",
  journal =      "Annals of Operations Research",
  year =         "1988",
  volume =       "13",
  pages =        "83--123",
}

@TechReport{bus:GoldschmidtHochbaum:88,
  author =       "Olivier Goldschmidt and Dorit S. Hochbaum",
  title =        "Polynomial Algorithm for the k--Cut Problem",
  institution =  "IEOR Department and School of Business
                 Administration",
  year =         "1988",
  address =      "University of California",
}

@InCollection{bus:GroetschelLovasz:94,
  author =       "Martin Gr{\"o}tschel and Laszlo Lovasz",
  title =        "Combinatorial Optimization",
  booktitle =    "Handbook on Combinatorics",
  publisher =    "North Holland",
  year =         "1994",
  editor =       "R. Graham and M. Gr{\"o}tschel and L. Lovasz",
  number =       "SC 93-13",
  chapter =      "28",
  note =         "Preprint from ZIB",
}

@TechReport{bus:GroetschelPulleyblank:81,
  author =       "M. Groetschel and W. R. Pulleyblank",
  title =        "Weakly Bipartitet Graphs and the Max-Cut problem",
  institution =  "Insititut f{\"u}r {\"O}konomertrie und Operations
                 Research",
  year =         "19981",
  number =       "81194",
  address =      "Rheinische Friedrich-Wilhels-Universit{\"a}t, Bonn",
  annote =       "Einf{\"u}hrung der weakly bipartiten Graphen {\"u}ber
                 Polyedrische Charakterisierung. F{\"u}r diese
                 Graphenklasse ist das Max-Cut Problem polynomial zu
                 l{\"o}sen. Beschreibung eines Algorithmus, der den
                 k{\"u}rzesten Weg gerader (ungerader) L{\"a}nge
                 findet.",
}

@Article{bus:GrunowGuenther:95,
  author =       "M. Grunow and H. O. G{\"u}nther",
  title =        "{AMPL}",
  journal =      "OR Spektrum",
  year =         "1995",
  volume =       "17",
  number =       "1",
  pages =        "1--3",
}

@Misc{bus:Hadjiat:94,
  author =       "Malika Hadjiat",
  title =        "A strongly polynomial algorithm for minimum-cost
                 tension",
  howpublished = "slides",
  year =         "1994",
}

@Article{bus:Hadlock:75,
  author =       "F. Hadlock",
  title =        "Finding a Maximum Cut of a Planar Graph in Polynomial
                 Time",
  journal =      "SIAM J. Comput.",
  year =         "1975",
  volume =       "4",
  number =       "3",
  pages =        "221--225",
}

@Article{bus:Hartvigsen:90,
  author =       "David Hartvigsen",
  title =        "Path-isomorphic networks",
  journal =      "J. Graph Theory",
  year =         "1990",
  volume =       "14",
  number =       "6",
  pages =        "709--722",
}

@Article{bus:HartvigsenWagner:88,
  author =       "David B. Hartvigsen and Donald K. Wagner",
  title =        "Recognizing max-flow min-cut path matrices",
  journal =      "Oper. Res. Lett.",
  year =         "1988",
  volume =       "7",
  number =       "1",
  pages =        "37--42",
}

@InProceedings{bus:Hering:94,
  author =       "Franz Hering",
  title =        "{\"U}ber die {V}erwendung von
                 {P}enrose-{P}flasterungen in der {A}rchitektur",
  key =          "Pflasterungen",
  pages =        "51--56",
  booktitle =    "Proceedings of the IKM",
  year =         "1994",
  organization = "University Weimar",
}

@Article{bus:HolmKlein:84,
  author =       "S. Holm and D. Klein",
  title =        "Three methods for Postoptimal analysis in integer
                 linear programming",
  journal =      "Math. Programming Stud.",
  year =         "1984",
  volume =       "21",
  pages =        "97--109",
}

@Book{bus:HorowitzSahni:78,
  author =       "E. Horowitz and S. Sahni",
  title =        "Algorithms: Design and Analysis",
  publisher =    "Computer Press",
  year =         "1978",
  address =      "Potomac, MD",
}

@Article{bus:Jenkins:90,
  author =       "Larry Jenkins",
  title =        "Parametric methods in integer linear programming",
  journal =      "Annals of Operations Research",
  year =         "1990",
  volume =       "27",
  pages =        "77--96",
}

@Article{bus:JohnsonMehrotraNemhauser:93,
  author =       "Ellis L. Johnson and Anuj Mehrotra and George L.
                 Nemhauser",
  title =        "Min-cut clustering",
  journal =      "Math. Programming",
  year =         "1993",
  volume =       "62",
  number =       "1",
  pages =        "133--151",
  note =         "Special Issue: Studies in Linear and Integer
                 Programming",
}

@Book{bus:Jungnickel:90,
  author =       "D. Jungnickel",
  title =        "Graphen, {N}etzwerke und {A}lgorithmen",
  publisher =    "BI Wissenschaftsverlag",
  year =         "1990",
  language =     "German",
  note =         "2. {\"u}berarbeitete und erweitete Auflage",
}

@InProceedings{bus:Karp:72,
  author =       "Richard M. Karp",
  title =        "Reducibility Among Combinatorial Problems",
  editor =       "R. E. Miller and J. W. Thatcher",
  pages =        "85--103",
  booktitle =    "Complexity of Computer Computations",
  year =         "1972",
  publisher =    "Plenum Press",
  address =      "New York",
}

@Article{bus:Karp:78,
  author =       "Richard M. Karp",
  title =        "A Characterisation of the Minimum Cycle Mean in a
                 Digraph",
  journal =      "Discrete Math.",
  year =         "1978",
  volume =       "23",
  pages =        "309--311",
}

@Article{bus:KleinschmidtMitterreiterPiper:94,
  author =       "Peter Kleinschmidt and Isle Mitterreiter and Jim
                 Piper",
  title =        "Improved Chromosome Classifcation Using Monotonic
                 Functions of Mahalanobis Distance and the
                 Transportation Method",
  journal =      "Z. Oper. Res. Ser. A-B",
  year =         "1994",
  volume =       "40",
  number =       "3",
  pages =        "305--323",
}

@Unpublished{bus:Kucera:76,
  author =       "L. Kucera",
  title =        "The Complexity of Clique Finding Algorithms",
  year =         "1976",
  note =         "unpublished",
}

@InProceedings{bus:KuriBaeckHeitkoetter:94,
  author =       "Sami Khuri and Thomas B{\"a}ck and J{\"o}rg
                 Heitk{\"o}tter",
  title =        "An Evolutionary Approach to Combinatorial Optimization
                 Problems",
  booktitle =    "Proceedings of the 1994 Computer Science Conference
                 (CSC'94)",
  year =         "1994",
  pages =        "(to appear)",
  publisher =    "ACM Press",
  organization = "March 1994, Phoenix AZ",
  abstract =     "The paper reports on the application of genetic
                 algorithms, probabilistic search algorithms based on
                 the model of organic evolution, to NP-complete
                 combinatorial optimization problems. In particular, the
                 subset sum, maximum cut, and minimum tardy task
                 problems are considered. Except for the fitness
                 function, no problem-specific changes of the genetic
                 algorithm are required in order to achieve results of
                 high quality even for the problem instances of size 100
                 used in the paper. For constrained problems, such as
                 the subset sum and the minimum tardy task, the
                 constraints are taken into account by incorporating a
                 graded penalty term into the fitness function. Even for
                 large instances of these highly multimodal optimization
                 problems, an iterated application of the genetic
                 algorithm is observed to find the global optimum within
                 a number of runs. As the genetic algorithm samples only
                 a tiny fraction of thesearch space, these results are
                 quite encouraging.",
}

@Book{bus:Lawler:76a,
  author =       "Eugene L. Lawler",
  title =        "Combinatorial Optimization: {N}etworks and matroids",
  publisher =    "Holt, Rinehart and Winston",
  year =         "1991",
  address =      "New York",
}

@InCollection{bus:Lawler:76b,
  author =       "E. L. Lawler",
  title =        "Graphical Algorithms and Their Complexity",
  booktitle =    "Foundations of Computer Science II",
  publisher =    "Mathematical Centre Tracts 81",
  year =         "1976",
  editor =       "K. R. Apt and J. W. {de Bakker}",
  volume =       "1",
  pages =        "3--32",
  note =         "Unter anderem findet sich hier: Generating all maximal
                 independent sets $O(nm3^{n/3})$, finding a maximum
                 independent set (exponential time) $O(2^{n/3})$,
                 compting the chromatic number of a graph (exponential
                 time, mit Dynamic Programming Techniken und Independent
                 sets) $O(mn(1+\sqrt[3]{3})^n)$. Es wird der
                 Zusammenhang zwischen vertex cover, independent set und
                 clique erwa{\"a}hnt.",
}

@Article{bus:Lawler:78,
  author =       "E. L. Lawler",
  title =        "Sequencing jobs to minimize total weighted completion
                 time subject to precedence constraints",
  journal =      "Ann. Disc. Math.",
  year =         "1978",
  volume =       "2",
  pages =        "75--90",
}

@Book{bus:LawlerLenstraKanShmoys:85,
  author =       "E. L. Lawler and J. K. Lenstra A. H. G. Rinooy Kan and
                 D. B. Shmoys",
  title =        "The Traveling Salesman Problem",
  publisher =    "John Wiley \& Sons",
  year =         "1985",
  address =      "New York",
  annote =       "ISBN 0-471-90413-9",
}

@InCollection{bus:LengauerTheune:91a,
  author =       "T. Lengauer and D. Theune",
  title =        "Unstructured Path Problems and the Making of
                 Semirings",
  publisher =    "Springer",
  year =         "1991",
  editor =       "F. Dehne and J.-R. Sack and N. Santoro",
  volume =       "519",
  series =       "Lecture Notes in Computer Science",
  pages =        "189--200",
  note =         "Priliminary Version",
}

@InCollection{bus:LengauerTheune:91b,
  author =       "T. Lengauer and D. Theune",
  title =        "Unstructured Path Problems and the Making of
                 Semirings",
  booktitle =    "Algorithms and Data Structures",
  publisher =    "Springer",
  year =         "1991",
  editor =       "D. Frank et. al.",
  volume =       "519",
  series =       "Lecture Notes in Computer Science",
  pages =        "189--200",
  note =         "Priliminary Version",
}

@TechReport{bus:Leo:93,
  author =       "John Leo",
  title =        "Time-varying $k$ shortest paths algorithm",
  institution =  "Matsushita Communication Industrial, Ltd",
  year =         "1993",
  series =       "Preprint",
}

@Article{bus:LoukakisMuhlemann:84,
  author =       "E. Loukakis and A. P. Muhlemann",
  title =        "Parametrisation algorithms for the integer linear
                 programs in binary variables",
  journal =      "European J. Oper. Res.",
  year =         "1984",
  volume =       "17",
  pages =        "104--115",
}

@Article{bus:Loulou:92,
  author =       "Richard Loulou",
  title =        "Minimal Cut Cover of a Graph with an Application to
                 the Testing of Electronic Boards",
  journal =      "Oper. Res. Lett.",
  volume =       "12",
  year =         "1992",
  pages =        "301--305",
}

@Book{bus:MacWilliamsSloane:77,
  author =       "F. J. MacWilliams and N. J. A. Sloane",
  title =        "The Theory of Error-Correcting Codes",
  publisher =    "North-Holland",
  year =         "1977",
  key =          "error-correcting codes, information theory",
  volume =       "16",
  series =       "North-Holland Mathematical Library",
}

@Article{bus:MalhotraKumarMahaswari:78,
  author =       "V. M. Malhotra and M. P. Kumar and S. N. Mahaswari",
  title =        "An \({O}(|{V}|^3)\) Algorithm for finding Maximum
                 Flows in Networks",
  journal =      "Inform. Process. Lett.",
  year =         "1978",
  volume =       "7",
  pages =        "277--278",
}

@Article{bus:MatsumotoNishizekiSaito:86,
  author =       "K. Matsumoto and T. Nishizeki and N. Saito",
  title =        "Planar multicommodity flows, maximum matchings and
                 negative cycles",
  journal =      "SIAM J. Comput.",
  year =         "1986",
  volume =       "15",
  number =       "2",
  pages =        "495--510",
}

@TechReport{bus:McCormick:93,
  author =       "S. Thomas McCormick",
  title =        "Approximate binary search algorithms for mean cuts and
                 cycles",
  institution =  "Faculty of Commerce and Business Administration",
  year =         "1993",
  series =       "UBC Working Paper",
  key =          "network flow, max mean cut, min mean cycle,
                 approximate binary search",
  number =       "92-MSC-021",
}

@TechReport{bus:McCormickErvolina:90,
  author =       "S. T. McCormick and T. R. Ervolina",
  title =        "Computing Maximal Mean Cuts",
  institution =  "Faculty of Commerce and Business Administration,
                 University of British Columbia",
  series =       "UBC Working Paper 90-MSC-011",
  year =         "1990",
  number =       "90-MSC-011",
  month =        may,
}

@Article{bus:Minoux:76,
  author =       "M. Minoux",
  title =        "Structures Alg\'{e}brique {G}\'{e}n\'{e}ralis\'{e}es
                 des Probl\'{e}mes de Cheminement dans les Graphs",
  journal =      "RAIRO Rech. Op{'e}r.",
  year =         "1976",
  volume =       "10",
  number =       "6",
  pages =        "33--62",
}

@Book{bus:Murty:92,
  author =       "Katta G. Murty",
  title =        "Network Programming",
  publisher =    "Prentice Hall, Inc.",
  year =         "1992",
  address =      "Englewood Cliffs, New Jersey",
  annote =       "ISBN 0-13-615493-X",
}

@TechReport{bus:Nachtigall:93,
  author =       "Karl Nachtigall",
  title =        "Exact solution mathods for periodic programs",
  institution =  "Universit{\"a}t Hildesheim",
  year =         "1993",
  series =       "Hildesheimer Informatikberichte",
  key =          "branch and bound, periodic networks, linear
                 programming",
  number =       "14",
}

@Article{bus:NagamochiOnoIbaraki:94,
  author =       "Hiroshi Nagamochi and Tadashi Ono and Toshihide
                 Ibaraki",
  title =        "Implementing an efficient minimum capacity cut
                 algorithm",
  journal =      "Math. Programming",
  year =         "1994",
  volume =       "67",
  pages =        "325--341",
}

@Book{bus:Nauss:79,
  author =       "R. M. Nauss",
  title =        "Parametric Integer Programming",
  publisher =    "University of Missouri Press",
  year =         "1979",
  address =      "Columbia",
}

@Article{bus:OhtakeNishida:85,
  author =       "Ohtake Yoshiaki and Naonori Nishida",
  title =        "A branch-and-bound algorithm for 0 - 1 parametric
                 mixed integer programming",
  journal =      "Oper. Res. Lett.",
  year =         "1985",
  volume =       "4",
  pages =        "41--45",
}

@Article{bus:Padberg:89,
  author =       "Manfred Padberg",
  title =        "The boolean quadratic polytope: {S}ome
                 characteristics, facets and relatives",
  journal =      "Math. Programming",
  year =         "1989",
  volume =       "45",
  number =       "1",
  pages =        "139--172",
  note =         "Special Issue: Polyhedra and Discrete Optimization",
}

@Article{bus:PapadimitriouVazirani:84,
  author =       "C. H. Papadimitriou and U. V. Vazirani",
  title =        "On two Geometric Problems related to the Traveling
                 Salesman Problem",
  journal =      "J. Algorithms",
  year =         "1984",
  volume =       "5",
  pages =        "231--246",
}

@Article{bus:PardalosXue:94,
  author =       "Panos M. Pardalos and Jue Xue",
  title =        "The maximum clique problem",
  journal =      "J. Global Optim.",
  year =         "1994",
  volume =       "4",
  number =       "3",
  pages =        "301--328",
}

@TechReport{bus:ParkLeePark:94,
  author =       "Kyungchul Park and Kyungsik Lee and Sungsoo Park",
  title =        "An extended formulation approach to the edge-weighted
                 maximal clique problem",
  institution =  "Department of Industrial Engineering, Korea Advanced
                 Institute of Science and Technology",
  year =         "1994",
  series =       "Techreport",
  address =      "373-1 Gusong-dong, Yusong-gu, Taejon 305-701, Korea",
  month =        dec,
}

@InProceedings{bus:PhillipsWestbrook:93,
  author =       "Steven Phillips and Jeffery Westbrook",
  title =        "Online load balancing and network flow",
  volume =       "25",
  booktitle =    "Proceedings of the Annual ACM Symposium on Theory of
                 Computing",
  year =         "1993",
}

@TechReport{bus:Radzik:93,
  author =       "Tomasz Radzig",
  title =        "Parametric flows, weighted mean of cuts, and
                 fractional combinatorial optimization",
  institution =  "School of Operations Research, Cornell University",
  year =         "1993",
  series =       "Preprint",
}

@Article{bus:RaviRosenkrantzTayi:94,
  author =       "S. S. Ravi and D. J. Rosenkrantz and G. K. Tayi",
  title =        "Heuristic and special case algorithms for dispersion
                 problem",
  journal =      "Oper. Res.",
  year =         "1994",
  volume =       "42",
  pages =        "299--310",
}

@Article{bus:RountreeGillett:82,
  author =       "Suzanne L. K. Rountree and Billy E. Gillett",
  title =        "Parametric integer linear programming: {A} synthesis
                 of branch and bound with cutting planes",
  journal =      "European J. Oper. Res.",
  year =         "1982",
  volume =       "10",
  pages =        "183--189",
}

@Article{bus:Sahni:74,
  author =       "Sartaj Sahni",
  title =        "Computationally related problems",
  journal =      "SIAM J. Comput.",
  year =         "1974",
  volume =       "31",
  number =       "4",
  pages =        "262--279",
}

@Article{bus:SarrafzadehLou:93,
  author =       "M. Sarrafzadeh and R. D. Lou",
  title =        "Maximum k-Covering of Weight Transitve Graphs with
                 Applications",
  journal =      "Z. Oper. Res. Ser. A-B",
  year =         "1993",
}

@TechReport{bus:Schiermeyer:94,
  author =       "Ingo Schiermeyer",
  title =        "Reverse-fit: {A} 2-optimal algorithm for packing
                 rectangles",
  institution =  "RWTH Aachen",
  year =         "1994",
  series =       "Prepints des Lehrstuhl C f{"}ur Mathematik",
  number =       "53",
}

@Article{bus:SchrageWolsey:85,
  author =       "L. Schrage and L. A. Wolsey",
  title =        "Sensitivity Analysis for branch and bound integer
                 programming",
  journal =      "Oper. Res.",
  year =         "1985",
  volume =       "33",
  pages =        "1008--1023",
}

@Article{bus:Shapiro:77,
  author =       "J. F. Shapiro",
  title =        "Sensitvity analysis in integer programming",
  journal =      "Ann. Disc. Math.",
  year =         "1977",
  volume =       "1",
  pages =        "467--477",
}

@Article{bus:Schmerl:80,
  author =       "J. H. Schmerl",
  title =        "Decidability and $\aleph_0$-categoricity of theories of
                  partially orderd sets",
  journal =      "J. Symbolic Logic",
  year =         1980,
  volume =       45,
  pages =        "585--611"
}

@Article{bus:SheraliLeeAdams:95,
  author =       "Hanif D. Sherali and Youngho Lee and Warren P. Adams",
  title =        "A simultaneous lifting strategy for identifying new
                 classes of facets for the Boolean quadric polytope",
  journal =      "Oper. Res. Lett.",
  year =         "1995",
  volume =       "17",
  number =       "1",
  pages =        "19--26",
}

@Article{bus:ShinCorder:92,
  author =       "Kwang Shin and Steve Corder",
  title =        "Implementing the {F}ord--{F}ulkerson Labeling
                 Algorithm with Fixed--Order Scanning",
  journal =      "Comput. Oper. Res.",
  year =         "1992",
  volume =       "19",
  number =       "8",
  pages =        "783--787",
}

@Article{bus:Spaeth:85,
  author =       "H. Sp{\"a}th",
  title =        "Heuristically determining cliques of given cardinality
                 and with minimal cost within weighted complete graphs",
  journal =      "Z. Oper. Res. Ser. A-B",
  year =         "1985",
  volume =       "29",
  number =       "3",
  pages =        "125--131",
}

@TechReport{bus:Stewart:78,
  author =       "Lorna Stewart",
  title =        "Cographs: {A} class of tree representable graphs",
  institution =  "University of Toronto",
  year =         "1978",
  series =       "Department of Computer Science",
  number =       "126/78",
  month =        oct,
}

@Article{bus:Sumner:74,
  author =       "D. P. Sumner",
  title =        "Dacey graphs",
  journal =      "J. Austral. Math. Soc. Ser. A",
  year =         "1974",
  volume =       "18",
  pages =        "492--502",
}

@Article{bus:Swaminathan:94,
  author =       "R. P. Swaminathan",
  title =        "A Bad Submatrix is Easy to Find",
  journal =      "Networks",
  year =         "1994",
  volume =       "24",
  pages =        "267--271",
}

@Article{bus:Tarjan:77,
  author =       "R. E. Tarjan",
  title =        "Finding Optimum Branchings",
  journal =      "Networks",
  year =         "1977",
  volume =       "7",
  pages =        "25--33",
}

@Article{bus:TarjanYannakakis:84,
  author =       "Robert E. Tarjan and Mihalis Yannakakis",
  title =        "Simple linear-time algorithms to test chordality of
                 graphs, test acyclicity of hypergraphs, and selectively
                 reduce acyclic hypergraphs",
  journal =      "SIAM J. Comput.",
  year =         "1984",
  volume =       "13",
  number =       "3",
  pages =        "566--579",
}

@Article{bus:TarjanYannakakis:85,
  author =       "Robert E. Tarjan and Mihalis Yannakakis",
  title =        "Addendum: simple linear-time algorithms to test
                 chordality of graphs, test acyclicity of hypergraphs,
                 and selectively reduce acyclic hypergraphs",
  journal =      "SIAM J. Comput.",
  year =         "1985",
  volume =       "14",
  number =       "1",
  pages =        "254--255",
}

@Article{bus:TraubWozniakowski:94,
  author =       "Joseph F. Traub and Henryk Wozniakowski",
  title =        "Wege aus der {U}nberechenbarkeit",
  journal =      "Spektrum der Wissenschaft",
  year =         "1994",
  volume =       "4",
  pages =        "64--69",
}

@Article{bus:Vavasis:90,
  author =       "Stephen A. Vavasis",
  title =        "Quadratic Programming is in {NP}",
  journal =      "Inform. Process. Lett.",
  year =         "1990",
  volume =       "36",
  pages =        "73--77",
}

@TechReport{bus:WagnerWeihe:92,
  author =       "Dorothea Wagner and Karsten Weihe",
  title =        "A Linear--Time Algorithm for Edge-Disjoint Paths in
                 Planar Graphs",
  institution =  "Technische Universit{\"a}t Berlin",
  year =         "1992",
  number =       "344/1992",
}

@Article{bus:Winter:85,
  author =       "Pawel Winter",
  title =        "An Algorithm for the {S}Teiner Problem in the
                 {E}uclidean Plane",
  journal =      "Networks",
  year =         "1985",
  volume =       "15",
  number =       "3",
  pages =        "323--345",
}

@Article{bus:Winter:87,
  author =       "Pawel Winter",
  title =        "{S}teiner Problem in Networks: {A} Survey",
  journal =      "Networks",
  year =         "1987",
  volume =       "17",
  number =       "2",
  pages =        "129--167",
}

@InProceedings{bus:Yannakakis:78,
  author =       "M. Yannakakis",
  title =        "Node- and edge-deletion {NP} complete problems",
  volume =       "10",
  booktitle =    "Proceedings of the Annual ACM Symposium on Theory of
                 Computing",
  year =         "1978",
}

@TechReport{bus:Zimmermann:92,
  author =       "Uwe T. Zimmermann",
  title =        "On the Complexity of the Dual Method for Maximum
                 Balanced Flows",
  institution =  "Technische Universit{\"a}t Braunschweig",
  year =         "1992",
}

@TechReport{bus:Zimmermann:95,
  author =       "Uwe T. Zimmermann",
  title =        "Sharing and Balancing",
  institution =  "Technische Universit{\"a}t Braunschweig",
  year =         "1995",
  note =         "in preparation",
}

%
%
% This is the database "mo" (Books of the Department Math. Opt.)
%
@Book{mo:DennisSchnabel:83,
  author =       "Jr. J. E. Dennis and Robert B. Schnabel",
  title =        "Numerical Methods for Unconstrained Optimization and
                 Nonlinear Equations",
  publisher =    "Prentice-Hall Inc.",
  year =         "1983",
  note =         "Prentice-Hall Series in Computational Mathematics",
  ISBN =         "0-13-627216-9",
}

@Book{mo:MoretShapiro:91,
  author =       "B. M. E. Moret and H. D. Shapiro",
  title =        "Algorithms from {P} to {NP}",
  publisher =    "Benjamin Cummings",
  year =         "1991",
  pages =        "576",
  address =      "Redwood City",
}

@Book{mo:Abadie:67,
  author =       "J. Abadie",
  title =        "Nonlinear Programming",
  publisher =    "North-Holland",
  year =         "1967",
  address =      "Amsterdam",
  pages =        "309",
}

@Book{mo:Aczel:87,
  author =       "J. Aczel",
  title =        "A short course on functional equations: Based upon
                 recent applications to the social and behavioral
                 sciences",
  publisher =    "Reidel",
  year =         "1987",
  address =      "Dordrecht",
  pages =        "169",
}

@Book{mo:Aigner:79,
  author =       "M. Aigner",
  title =        "Combinatorial Theory",
  publisher =    "Springer",
  year =         "1979",
  address =      "Berlin",
  series =       "Grundlehren der mathematischen Wissenschaften",
  volume =       "234",
  pages =        "483",
}

@Book{mo:Aigner:88,
  author =       "M. Aigner",
  title =        "Combinatorial Search",
  publisher =    "Teubner",
  year =         "1988",
  address =      "Stuttgart",
  pages =        "368",
}

@Book{mo:Akgul:84,
  author =       "M. Akgul",
  title =        "Topics in Relaxation and Ellipsoidal Methods",
  publisher =    "Pitman Publishing",
  year =         "1984",
  address =      "Boston/London/Melbourne",
  pages =        "322",
}

@Book{mo:Akl:85,
  author =       "S. G. Akl",
  title =        "Parallel Sorting Algorithms",
  publisher =    "Academic Press",
  year =         "1985",
  pages =        "229",
}

@Book{mo:Ames:77,
  author =       "W. F. Ames",
  title =        "Numerical Methods for Partial Differential Equations",
  publisher =    "Academic Press",
  year =         "1977",
  address =      "New York",
  pages =        "365",
}

@Book{mo:Anderson:76,
  author =       "O. D. Anderson",
  title =        "Time Series Analysis and Forecasting",
  publisher =    "Butterworth \& Co",
  year =         "1976",
  address =      "London/Boston",
  pages =        "182",
}

@Book{mo:AnderonNash:87,
  author =       "E. Anderson and P. Nash",
  title =        "Linear Programming in Infinite-Dimensional Spaces:
                 Theory and Applications",
  publisher =    "John Wiley & sons",
  year =         "1987",
  address =      "Chichester",
  pages =        "172",
}

@Book{mo:Anderson:92,
  author =       "E. Anderson (Mitarb.)",
  title =        "{LAPAPCK}. Users' Guide",
  publisher =    "Soc. for Industrial and Appl. Mathematics",
  year =         "1992",
  address =      "Philadelphia",
  pages =        "235",
}

@Book{mo:ArrowIntriligator:81,
  author =       "K. J. Arrow and M. D. Intriligator",
  title =        "Handbook of Mathematical Economics: Volume {I}",
  publisher =    "North-Holland",
  year =         "1981",
  address =      "Amsterdam",
  series =       "Handbooks in Economics",
  volume =       "1",
  pages =        "2--378",
}

@Book{mo:ArrowIntriligator:82,
  author =       "K. J. Arrow and M. D. Intriligator",
  title =        "Handbook of Mathematical Economics: Volume {II}",
  publisher =    "North-Holland",
  year =         "1982",
  address =      "Amsterdam",
  series =       "Handbooks in Economics",
  volume =       "1",
  pages =        "382--1070",
}

@Book{mo:ArrowIntriligator:86,
  author =       "K. J. Arrow and M. D. Intriligator",
  title =        "Handbook of Mathematical Economics: Volume {III}",
  publisher =    "North-Holland",
  year =         "1986",
  address =      "Amsterdam",
  series =       "Handbooks in Economics",
  volume =       "1",
  pages =        "1073--1519",
}

@Book{mo:AtkinsonHarley:83,
  author =       "L. Atkinson and P. J. Harley",
  title =        "An Introduction to Numerical Methods with Pascal",
  publisher =    "Addison-Wesley",
  year =         "1983",
  address =      "Wokingham",
  pages =        "300",
}

@Book{mo:Aubin:82,
  author =       "J. P. Aubin",
  title =        "Explicit Methods of Optimization",
  publisher =    "Bordas",
  year =         "1982",
  address =      "Paris",
  pages =        "287",
}

@Book{mo:Avriel:76,
  author =       "M. Avriel",
  title =        "Nonlinear Programming: Analysis and Methods",
  publisher =    "Prentice Hall",
  year =         "1976",
  address =      "Englewood Cliffs, New Yersey",
  series =       "Series in Automatic Computation",
  pages =        "512",
}

@Book{mo:Bachem:82,
  title =        "Bonn Workshop on Combinatorial Optimization",
  publisher =    "North-Holland",
  year =         "1982",
  address =      "Amsterdam",
  editor =       "A. Bachem and M. Groetschel and B. Korte",
  series =       "Ann. Disc. Math.",
  volume =       "16",
  pages =        "312",
}

@Book{mo:Bachem:83,
  title =        "Mathematical Programming : The State of the Art",
  publisher =    "Springer",
  year =         "1983",
  address =      "Berlin",
  editor =       "A. Bachem and M. Groetschel and B. Korte",
  pages =        "655",
}

@Book{mo:Bachem:92,
  author =       "A. Bachem and W. Kern",
  title =        "Linear Programming Duality",
  publisher =    "Springer",
  year =         "1992",
  address =      "Berlin",
  pages =        "216",
}

@Book{mo:BanahanBradyDoran:91,
  author =       "M. Banahan and D. Brady and M. Doran",
  title =        "The {C} Book",
  publisher =    "Addison Wesley",
  year =         "1991",
  address =      "Wokingham, Engl.",
  pages =        "310",
}

@Book{mo:Barnett:75,
  author =       "S. Barnett",
  title =        "Introduction to Mathematical Control Theory",
  publisher =    "Oxford University Press",
  year =         "1975",
  address =      "Oxford",
  pages =        "264",
}

@Book{mo:Barotti:82,
  author =       "A. Barlotti",
  title =        "Matroid Theory and its Applications",
  publisher =    "Liguori",
  year =         "1982",
  address =      "Neapel",
  pages =        "424",
}

@Book{mo:Barnette:83,
  author =       "D. Barnette",
  title =        "Map Coloring, Polyhedra, and the Four-Color-Problem",
  publisher =    "The Mathematical Association of America",
  year =         "1983",
  address =      "USA",
  pages =        "168",
}

@Book{mo:Barnsley:88,
  author =       "M. Barnsley",
  title =        "Fractals Everywhere",
  publisher =    "Academic Press",
  year =         "1988",
  address =      "San Diego, CA",
  pages =        "394",
}

@Book{mo:Bastian:76,
  author =       "M. Bastian",
  title =        "Lineare Komplementaerprobleme im Operations Research
                 und in der Wirtschaftstheorie",
  publisher =    "Hain",
  year =         "1976",
  address =      "Meisenheim",
  series =       "Mathematical System in Economics",
  volume =       "25",
  pages =        "191",
}

@Book{mo:Bastian:80,
  author =       "M. Bastian",
  title =        "Lineare Optimierung grosser Systeme",
  publisher =    "Hain",
  year =         "1980",
  address =      "Meisenheim",
  series =       "Mathematical Systems in economics",
  volume =       "55",
  pages =        "121",
}

@Book{mo:BazaraaShetty:76,
  author =       "M. S. Bazaraa and C. M. Shetty",
  title =        "Foundations of Optimization",
  publisher =    "Springer",
  year =         "1976",
  address =      "Berlin",
  series =       "Lecture Notes in Economics and Mathematical Systems",
  volume =       "122",
  pages =        "193",
}

@Book{mo:BazaraaShetty:79,
  author =       "M. S. Bazaraa and C. M. Shetty",
  title =        "Nonlinear Programming: Theory and Algorithms",
  publisher =    "John Wiley & sons",
  year =         "1979",
  address =      "New York",
  pages =        "560",
}

@Book{mo:Beale:88,
  author =       "E. M. L. Beale",
  title =        "Introduction to Optimization",
  publisher =    "John Wiley & sons",
  year =         "1988",
  address =      "New York",
  pages =        "121",
}

@Book{mo:BeightlerPhillips:76,
  author =       "Ph.D. Beightler and D. T. Phillips",
  title =        "Applied Geometric Programming",
  publisher =    "John Wiley & sons",
  year =         "1976",
  address =      "New York/London",
  pages =        "590",
}

@Book{mo:BeightlerPhilippsWilde:79,
  author =       "C. S. Beightler and D. T. Philipps and D. J. Wilde",
  title =        "Foundations of Optimizations",
  publisher =    "Prentice-Hall",
  year =         "1979",
  address =      "Englewood Cliffs",
  pages =        "485",
}

@Book{mo:BeinekeWilson:83,
  author =       "L. W. Beineke and R. J. Wilson",
  title =        "Selected Topics in Graph Theory 2",
  publisher =    "Academic Press",
  year =         "1983",
  address =      "London",
  pages =        "301",
}

@Book{mo:BellmannCookeLockett:70,
  author =       "R. Bellmann and K. L. Cooke and J. A. Lockett",
  title =        "Algorithms, Graphs and Computers",
  publisher =    "Academic Press",
  year =         "1970",
  address =      "London",
  series =       "Mathematics in Science and Engineering",
  volume =       "62",
  pages =        "246",
}

@Book{mo:BellmannEsogbueNabeshima:82,
  author =       "R. Bellmann and A. O. Esogbue and I. Nabeshima",
  title =        "Mathematical Aspects of Scheduling \& Applications",
  publisher =    "Pergamon Press",
  year =         "1982",
  address =      "Oxford",
  pages =        "329",
}

@Book{mo:Berman:73,
  author =       "A. Berman",
  title =        "Cones, Matrices and Mathematical Programming",
  publisher =    "Springer",
  year =         "1973",
  address =      "Berlin",
  series =       "Lecture Notes in Economics and Mathematical Systems",
  volume =       "79",
  pages =        "96",
}

@Book{mo:Berge:85,
  author =       "C. Berge",
  title =        "Graphs",
  publisher =    "North-Holland",
  year =         "1985",
  address =      "Amsterdam",
  pages =        "413",
}

@Book{mo:Berg:86,
  author =       "L. Berg",
  title =        "Lineare Gleichungssysteme mit Bandstruktur",
  publisher =    "Hanser",
  year =         "1986",
  address =      "Muenchen",
  pages =        "247",
}

@Book{mo:BertolazziLuccio:86,
  author =       "P. Bertolazzi and F. Luccio",
  title =        "{VLSI}: Algorithms and Architectures",
  publisher =    "North-Holland",
  year =         "1986",
  address =      "Amsterdam",
  edition =      "second",
  pages =        "387",
}

@Book{mo:Berge:89,
  author =       "C. Berge",
  title =        "Hypergraphs",
  publisher =    "North Holland",
  year =         "1989",
  address =      "Amsterdam",
  pages =        "255",
}

@Book{mo:BertsekasDimitri:91,
  author =       "Dimitri P. Bertsekas",
  title =        "Linear Network Optimization. Algorithms and Codes",
  publisher =    "MITZ Press",
  year =         "1991",
  address =      "Cambridge, Ma.",
  pages =        "359",
}

@Book{mo:BestRitter:85,
  author =       "M. J. Best and K. Ritter",
  title =        "Linear Programming:Active Set Analysis and Computer
                 Programs",
  publisher =    "Prentice-Hall",
  year =         "1985",
  pages =        "369",
}

@Book{mo:Bielfeldt:88,
  author =       "H. H. Bielfeldt",
  title =        "Russisch-Deutsches Woerterbuch",
  publisher =    "Akademie",
  year =         "1988",
  address =      "Berlin",
  pages =        "1119",
}

@Book{mo:Bjoerner:93,
  author =       "A. Bjoerner (Mitarb.)",
  title =        "Oriented Matroids",
  publisher =    "Cambridge University Press",
  year =         "1993",
  address =      "Cambridge",
  pages =        "516",
}

@Book{mo:BlazewiczCellary:86,
  author =       "J. Blazewicz and W. Cellary",
  title =        "Scheduling under Resource Constraints - Deterministic
                 Models",
  publisher =    "Baltzer",
  year =         "1986",
  address =      "Basel",
  series =       "Annals of Operations Research",
  volume =       "7",
  pages =        "359",
}

@Book{mo:Blum:75,
  title =        "Mathematische Optimierung : Grundlagen und Verfahren",
  publisher =    "Springer",
  year =         "1975",
  address =      "Berlin",
  editor =       "E. Blum and W. Oettli",
  series =       "Oekonometrie und Unternehmensforschung",
  volume =       "XX",
  pages =        "413",
}

@Book{mo:Blyth:90,
  author =       "T. S. Blyth",
  title =        "Module Theory. An approach to linear algebra",
  publisher =    "Clarendon Press",
  year =         "1990",
  address =      "Oxford",
  edition =      "second",
  pages =        "360",
}

@Book{mo:Bollobas:79,
  author =       "B. Bollobas",
  title =        "Graph Theory: An Introductory Course",
  publisher =    "Springer",
  year =         "1979",
  address =      "New York/Berlin",
  pages =        "180",
}

@Book{mo:Bollobas:84,
  title =        "Graph Theory and Combinatorics",
  publisher =    "Academic Press",
  year =         "1984",
  editor =       "B. Bollobas",
  pages =        "328",
}

@Book{mo:Bollobas:85,
  author =       "B. Bollobas",
  title =        "Random Graphs",
  publisher =    "Academic Press",
  year =         "1985",
  address =      "London",
  pages =        "447",
}

@Book{mo:Bollobas:86,
  author =       "B. Bollobas",
  title =        "Combinatorics",
  publisher =    "Cambridge Univ. Press",
  year =         "1986",
  address =      "Cambridge",
  pages =        "177",
}

@Book{mo:BondyMurty:79,
  author =       "J. A. Bondy and U. S. R. Murty",
  title =        "Graph Theory and Related Topics",
  publisher =    "Academic Press",
  year =         "1979",
  address =      "New York/London",
  pages =        "371",
}

@Book{mo:BorodinMunro:75,
  author =       "A. Borodin and I. Munro",
  title =        "The Computational Complexity of Algebraic and Num.
                 Problems",
  publisher =    "American Elsevier Publishing Company",
  year =         "1975",
  address =      "New York/Amsterdam",
  series =       "Theory of Computation Series",
  pages =        "174",
}

@Book{mo:Border:85,
  author =       "K. C. Border",
  title =        "Fixed Point Theorems with Applications to Economics
                 and Game Theory",
  publisher =    "Cambridge University Press",
  year =         "1985",
  address =      "London",
  pages =        "129",
}

@Book{mo:Borgwardt:87,
  author =       "K. H. Borgwardt",
  title =        "The Simplex Method. {A} Probabilistic Analysis",
  publisher =    "Springer",
  year =         "1987",
  address =      "Berlin",
  series =       "Algorithms and Combinatorics",
  volume =       "1",
  pages =        "268",
}

@Book{mo:Born:91,
  author =       "G. Born",
  title =        "{DOS} 5 Tuning",
  publisher =    "Markt \& Technik",
  year =         "1991",
  address =      "Haar",
  pages =        "387",
}

@Book{mo:BoseManvel:84,
  author =       "R. C. Bose and B. Manvel",
  title =        "Introduction to Combinatorial Theory",
  publisher =    "John Wiley & sons",
  year =         "1984",
  address =      "New York/Chichester",
  pages =        "237",
}

@Book{mo:Braun:86,
  author =       "M. Braun",
  title =        "Differential Equations and their Applications",
  publisher =    "Springer",
  year =         "1986",
  address =      "New York",
  pages =        "546",
}

@Book{mo:BrosowskiDeutsch:85,
  author =       "B. Brosowski and F. Deutsch",
  title =        "Parametric Optimization and Approximation",
  publisher =    "Birkhaeuser",
  year =         "1985",
  address =      "Stuttgart",
  pages =        "263",
}

@Book{mo:Brosius:92,
  author =       "Gerhard Brosius",
  title =        "{XCEL} 3.0 Professionell",
  publisher =    "Addison-Wesley",
  year =         "1992",
  address =      "Bonn",
  edition =      "erste",
  pages =        "855",
}

@Book{mo:Brucker:74,
  author =       "P. Brucker",
  title =        "Theory of Matrix Algorithms",
  publisher =    "Hain",
  year =         "1974",
  address =      "Meisenheim",
  series =       "Mathematical Systems in Economics",
  volume =       "13",
  pages =        "109",
}

@Book{mo:Brucker:75,
  author =       "P. Brucker",
  title =        "Ganzzahlige lin. Programmierung mit oekonom.
                 Anwendungen",
  publisher =    "Hain",
  year =         "1975",
  address =      "Meisenheim",
  series =       "Mathematical Systems in Economics",
  volume =       "16",
  pages =        "130",
}

@Book{mo:BrualdiRyser:91,
  author =       "R. A. Brualdi and H. J. Ryser",
  title =        "Combinatorial Matrix Theory",
  publisher =    "Cambridge University Press",
  year =         "1991",
  address =      "Cambridge",
  pages =        "367",
}

@Book{mo:BryantPerfect:80,
  author =       "V. Bryant and H. Perfect",
  title =        "Independence Theory in Combinatorics",
  publisher =    "Chapman and Hall",
  year =         "1980",
  address =      "London",
  pages =        "144",
}

@Book{mo:BrylawskiKelly:80,
  author =       "T. Brylawski and D. Kelly",
  title =        "Matroids and Combinatorial Geometries",
  publisher =    "University of Carolina",
  year =         "1980",
  address =      "Chapel Hill",
  pages =        "149",
}

@Book{mo:Buchberger:83,
  author =       "B. Buchberger",
  title =        "Computer Algebra Symbolic and Algebraic Computation",
  publisher =    "Springer",
  year =         "1983",
  address =      "Wien",
  edition =      "second",
  pages =        "283",
}

@Book{mo:BuckleyHarary:90,
  author =       "F. Buckley and F. Harary",
  title =        "Distance in Graphs",
  publisher =    "Addison-Wesley",
  year =         "1990",
  address =      "Redwood City",
  pages =        "334",
}

@Book{mo:Bundschuh:88,
  author =       "P. Bundschuh",
  title =        "Einfuehrung in die Zahlentheorie",
  publisher =    "Springer",
  year =         "1988",
  address =      "Berlin",
  pages =        "332",
}

@Book{mo:Burger:59,
  author =       "E. Burger",
  title =        "Einfuehrung in die Theorie der Spiele",
  publisher =    "De Gruyter",
  year =         "1959",
  address =      "Berlin",
  pages =        "169",
}

@Book{mo:Burkard:72,
  author =       "R. E. Burkard",
  title =        "Methoden der Ganzzahligen Optimierung",
  publisher =    "Springer",
  year =         "1972",
  address =      "Wien/New York",
  pages =        "292",
}

@Book{mo:Butz:82,
  author =       "Lothar Butz",
  title =        "Connectivity in Multi-factor Designs",
  publisher =    "Heldermann",
  year =         "1982",
  address =      "Berlin",
  pages =        "190",
}

@Book{mo:Calude:88,
  author =       "C. Calude",
  title =        "Theories of Computational Complexity",
  publisher =    "North-Holland",
  year =         "1988",
  address =      "Amsterdam",
  pages =        "498",
}

@Book{mo:Cameron:85,
  author =       "N. Cameron",
  title =        "Introduction to Linear and Convex Programming",
  publisher =    "Cambridge University Press",
  year =         "1985",
  address =      "Cambridge/London",
  series =       "AMS LS",
  volume =       "1",
  pages =        "149",
}

@Book{mo:Cambini:90,
  author =       "Alberto Cambini",
  title =        "Generalized Convexity and Fractional Programming with
                 Economic Applications",
  publisher =    "Springer",
  year =         "1990",
  address =      "Berlin",
  pages =        "361",
}

@Book{mo:CaoKimRoush:84,
  author =       "Z.-Q. Cao and K. H. Kim and F. W. Roush",
  title =        "Incline Algebra and Applications",
  publisher =    "John Wiley & sons",
  year =         "1984",
  address =      "New York/Chichester",
  pages =        "165",
}

@Book{mo:Caree:79,
  author =       "B. Caree",
  title =        "Graphs and Network",
  publisher =    "Clarendon Press",
  year =         "1979",
  address =      "Oxford",
  pages =        "277",
}

@Book{mo:CastellaniMazzoleni:81,
  author =       "G. Castellani and P. Mazzoleni",
  title =        "Mathematical Programming and its economic
                 application",
  publisher =    "Franco Angeli",
  year =         "1981",
  address =      "Milano",
  pages =        "826",
}

@Book{mo:Chambers:77,
  author =       "J. M. Chambers",
  title =        "Computational Methods for Data Analysis",
  publisher =    "John Wiley & sons",
  year =         "1977",
  address =      "New York/Chichester",
  pages =        "268",
}

@Book{mo:ChatterjeePrice:77,
  author =       "S. Chatterjee and B. Price",
  title =        "Regression Analysis by Example",
  publisher =    "John Wiley & sons",
  year =         "1977",
  address =      "New York/London",
  pages =        "228",
}

@Book{mo:ChartrandLeniak:86,
  author =       "G. Chartrand and L. Leniak",
  title =        "Graphs \& Digraphs",
  publisher =    "Wadsworth \& Brooks",
  year =         "1986",
  address =      "Monterey, CA",
  pages =        "359",
}

@Book{mo:Chapman:88,
  author =       "W. Chapman",
  title =        "Roget's International Thesaurus",
  publisher =    "Collins, Publ.",
  year =         "1988",
  address =      "London",
  pages =        "1317",
}

@Book{mo:Christofides:75,
  author =       "N. Christofides",
  title =        "Graph Theory: an Algorithmic Approach",
  publisher =    "Academic Press",
  year =         "1975",
  pages =        "400",
}

@Book{mo:Christofides:79,
  title =        "Combinatorial Optimization",
  publisher =    "John Wiley & sons",
  year =         "1979",
  address =      "Chichester",
  editor =       "N. Christofides et al.",
  pages =        "425",
}

@Book{mo:Chvatal:83,
  author =       "V. Chvatal",
  title =        "Linear Programming",
  publisher =    "W.H.Freeman and Company",
  year =         "1983",
  address =      "New York",
  pages =        "478",
}

@Book{mo:Clarke:83,
  author =       "Frank H. Clarke",
  title =        "Optimization and Nonsmooth Analysis",
  publisher =    "John Wiley & sons",
  year =         "1983",
  address =      "New York",
  pages =        "308",
}

@Book{mo:Cohon:78,
  author =       "J. L. Cohon",
  title =        "Multiobjective Programming and Planning",
  publisher =    "Academic Press",
  year =         "1978",
  address =      "New York",
  pages =        "333",
}

@Book{mo:CollatzWetterling:71,
  author =       "L. Collatz and W. Wetterling",
  title =        "Optimierungsaufgaben",
  publisher =    "Springer",
  year =         "1971",
  address =      "Berlin",
  series =       "Heidelberger Taschenbuecher",
  volume =       "15",
  pages =        "222",
}

@Book{mo:ColemanVanLoan:88,
  author =       "Thomas F. Coleman and Charles van Loan",
  title =        "Handbook for Matrix Computations",
  publisher =    "SIAM",
  year =         "1988",
  address =      "Philadelphia, PA",
  pages =        "264",
}

@Book{mo:Conrad:71,
  author =       "K. Conrad",
  title =        "Das quadratische Zuweisungsproblem und zwei seiner
                 Spezial- faelle",
  publisher =    "Mohr (Siebeck)",
  year =         "1971",
  address =      "Tuebingen",
  pages =        "291",
}

@Book{mo:ConnGouldToint:92,
  author =       "A. R. Conn and N. I. M. Gould and Ph.L. Toint",
  title =        "{LANCELOT}",
  publisher =    "Springer",
  year =         "1992",
  address =      "Berlin",
  pages =        "330",
}

@Book{mo:CormenLeisersonRivest:90,
  author =       "T. H. Cormen and C. E. Leiserson and R. L. Rivest",
  title =        "Introduction to Algorithms",
  publisher =    "MIT Press",
  year =         "1990",
  address =      "Cambridge, Ma.",
  pages =        "1028",
}

@Book{mo:CoschiSchueler:86,
  author =       "G. Coschi and J. B. Schueler",
  title =        "{WATFOR}-77. Language Reference",
  publisher =    "WATCOMP Publ. Ltd.",
  year =         "1986",
  address =      "Waterloo, Ontario",
  pages =        "310",
}

@Book{mo:CottleLemke:76,
  author =       "R. W. Cottle and C. E. Lemke",
  title =        "Nonlinear Programming",
  publisher =    "AMS",
  year =         "1976",
  address =      "Providence",
}

@Book{mo:CottleKelmansonKorte:84,
  title =        "Mathematical Programming",
  publisher =    "North-Holland",
  year =         "1984",
  address =      "Amsterdam",
  editor =       "R. W. Cottle and M. L. Kelmanson and B. Korte",
  pages =        "357",
}

@Book{mo:Cottle:85,
  title =        "Mathematical Programming Essays in Honor of George
                 {B}. Dantzig: Part {III}",
  publisher =    "North-Holland",
  year =         "1985",
  address =      "Amsterdam",
  editor =       "R. W. Cottle",
  series =       "Math. Programming Stud.",
  volume =       "25",
  pages =        "171",
}

@Book{mo:Cottle:85a,
  title =        "Mathematical Programming Essays in Honor of George
                 {B}. Dantzig: Part {I}",
  publisher =    "North-Holland",
  year =         "1985",
  address =      "Amsterdam",
  editor =       "R. W. Cottle",
  series =       "Math. Programming Stud.",
  volume =       "24",
  pages =        "252",
}

@Book{mo:Cowlishaw:85,
  author =       "M. F. Cowlishaw",
  title =        "The Rexx Language. {A} Practical Approach to
                 Programming",
  publisher =    "Prentice-Hall",
  year =         "1985",
  pages =        "176",
}

@Book{mo:Craven:88,
  author =       "B. D. Craven",
  title =        "Fractional Programming",
  publisher =    "Heldermann",
  year =         "1988",
  address =      "Berlin",
  pages =        "145",
}

@Book{mo:Dantzig:66,
  author =       "G. B. Dantzig",
  title =        "Lineare Programmierung und Erweiterungen",
  publisher =    "Springer",
  year =         "1966",
  address =      "Berlin",
  series =       "Econometrics and Operations Research",
  volume =       "II",
  pages =        "712",
}

@Book{mo:Day:89,
  author =       "R. A. Day",
  title =        "How to write \& publish a scientific paper",
  publisher =    "Cambridge University Press",
  year =         "1989",
  address =      "Cambridge",
  pages =        "211",
}

@Book{mo:Deif:86,
  author =       "A. Deif",
  title =        "Sensitivity Analysis in Linear Systems",
  publisher =    "Springer",
  year =         "1986",
  address =      "Berlin",
  pages =        "224",
}

@Book{mo:Derigs:88,
  author =       "U. Derigs",
  title =        "Programming in Networks and Graphs",
  publisher =    "Springer",
  year =         "1988",
  address =      "Berlin",
  pages =        "315",
}

@Book{mo:DeuflhardHohmann:91,
  author =       "P. Deuflhard and A. Hohmann",
  title =        "Numerische Mathematik",
  publisher =    "de Gruyter",
  year =         "1991",
  address =      "Berlin",
  pages =        "339",
}

@Book{mo:Devroye:86,
  author =       "L. Devroye",
  title =        "Lecture Notes on Bucket Algorithms",
  publisher =    "Birkhaeuser",
  year =         "1986",
  address =      "Boston",
  pages =        "146",
}

@Book{mo:Dickler:89,
  author =       "H. Dickler",
  title =        "Einfuehrung in die Arbeit mit d{BASE} {IV}",
  publisher =    "Markt \& Technik",
  year =         "1989",
  address =      "Haar",
  pages =        "522",
}

@Book{mo:Dixon:72,
  author =       "L. C. D. Dixon",
  title =        "Nonlinear Optimization",
  publisher =    "English University Press",
  year =         "1972",
  pages =        "214",
}

@Book{mo:DixonSpedicatoSzegoe:80,
  author =       "L. C. W. Dixon and E. Spedicato and G. P. Szegoe",
  title =        "Nonlinear Optimization. Theory and Algorithms",
  publisher =    "Birkhaeuser",
  year =         "1980",
  address =      "Boston",
  pages =        "486",
}

@Book{mo:Dolecki:89,
  author =       "S. Dolecki",
  title =        "Optimization",
  publisher =    "Springer",
  year =         "1989",
  address =      "Berlin",
  pages =        "22",
}

@Book{mo:Domschke:72,
  author =       "W. Domschke",
  title =        "Kuerzeste Wege in Graphen: Algorithmen;
                 Verfahrensvergleiche",
  publisher =    "Hain",
  year =         "1972",
  address =      "Meisenheim",
  series =       "Mathematical Systems in Economics",
  volume =       "2",
  pages =        "131",
}

@Book{mo:Domschke:85,
  author =       "W. Domschke",
  title =        "Logistik: Rundreisen und Touren",
  publisher =    "Oldenbourg",
  year =         "1985",
  address =      "Muenchen/Wien",
  pages =        "180",
}

@Book{mo:DomschkeDrexl:85,
  author =       "W. Domschke and A. Drexl",
  title =        "Logistik: Standorte",
  publisher =    "Oldenbourg",
  year =         "1985",
  address =      "Muenchen",
  pages =        "221",
}

@Book{mo:DomschkeDrexl:85a,
  author =       "W. Domschke and A. Drexl",
  title =        "Logistik: Transport",
  publisher =    "Oldenbourg",
  year =         "1985",
  address =      "Muenchen",
  pages =        "20",
}

@Book{mo:DomschkeDrexl:85b,
  author =       "W. Domschke and A. Drexl",
  title =        "Location and layout planning, an intern. bibliograph",
  publisher =    "Springer",
  year =         "1985",
  address =      "Berlin",
}

@Book{mo:DorningerMueller:84,
  author =       "D. Dorninger and W. Mueller",
  title =        "Allgemeine Algebra und Anwendungen",
  publisher =    "Teubner",
  year =         "1984",
  address =      "Stuttgart",
}

@Book{mo:DreyfusLaw:77,
  author =       "S. E. Dreyfus and A. M. Law",
  title =        "The Art and Theory of Dynamic Programming",
  publisher =    "Academic Press",
  year =         "1977",
  address =      "Orlando",
  series =       "Mathematics in Science and Engineering",
  volume =       "130",
  pages =        "284",
}

@Book{mo:DrexlDomschke:91,
  author =       "A. Drexl. and W. Domschke",
  title =        "Einfuehrung in Operations Research",
  publisher =    "Springer",
  year =         "1991",
  address =      "Berlin",
  pages =        "232",
}

@Book{mo:Dueck:77,
  author =       "W. Dueck",
  title =        "Diskrete Optimierung",
  publisher =    "Vieweg",
  year =         "1977",
  address =      "Braunschweig",
  series =       "Reihe Wissenschaft",
  pages =        "139",
}

@Book{mo:Dueck:79,
  author =       "W. Dueck",
  title =        "Optimierung unter mehreren Zielen",
  publisher =    "Akademie",
  year =         "1979",
  address =      "Berlin",
  series =       "Reihe Wissenschaft",
  pages =        "104",
}

@Book{mo:DuffErismanReid:86,
  author =       "I. S. Duff and A. M. Erisman and J. K. Reid",
  title =        "Direct Methods for Sparse Matrices",
  publisher =    "Clarendon Press",
  year =         "1986",
  address =      "Oxford",
  pages =        "341",
}

@Book{mo:DuranOdell:74,
  author =       "B. S. Duran and P. L. Odell",
  title =        "Cluster Analysis ( {A} Survey )",
  publisher =    "Springer",
  year =         "1974",
  address =      "Berlin/New York",
  series =       "Lecture Notes in Economics and Mathematical Systems",
  volume =       "100",
  pages =        "137",
}

@Book{mo:Eaves:84,
  author =       "B. C. Eaves",
  title =        "A Course in Triangulations for Solving Equations with
                 Deforma- tions",
  publisher =    "Springer",
  year =         "1984",
  address =      "Berlin/New York",
  series =       "Lecture Notes in Mathematical Systems",
  volume =       "234",
  pages =        "302",
}

@Book{mo:EiseltPederzoliSandblom:87,
  author =       "H. A. Eiselt and G. Pederzoli and C.-L. Sandblom",
  title =        "Continuous Optimization Models",
  publisher =    "de Gruyter",
  year =         "1987",
  address =      "Berlin",
  pages =        "739",
}

@Book{mo:ElsterReinhardtSchaeubleDonath:77,
  author =       "K.-H. Elster and R. Reinhardt and M. Schaeuble and G.
                 Donath",
  title =        "Einfuehrung in die Nichtlineare Optimierung",
  publisher =    "Teubner",
  year =         "1977",
  address =      "Leipzig",
  series =       "Mathematisch-Naturwissenschaftliche Bibliothek",
  volume =       "63",
  pages =        "299",
}

@Book{mo:ErdoesGraham:80,
  author =       "P. Erdoes and R. L. Graham",
  title =        "Old and new Problems and Results in Combinatorial
                 Number Theory",
  publisher =    "L'Enseignement Mathematique",
  year =         "1980",
  address =      "Genf",
  pages =        "128",
}

@Book{mo:EriksonHall:86,
  author =       "W. J. Erikson and O. P. Hall",
  title =        "Computer Models for Management Science",
  publisher =    "Addison-Wesley",
  year =         "1986",
  pages =        "303",
}

@Book{mo:Even:79,
  author =       "S. Even",
  title =        "Graph Algorithms",
  publisher =    "Computer Science Press",
  year =         "1979",
  pages =        "249",
}

@Book{mo:FiaccoMcCormick:68,
  author =       "A. V. Fiacco and G. P. McCormick",
  title =        "Nonlinear Programming : Sequential Unconstrained
                 Minimization Techniques",
  publisher =    "John Wiley & sons",
  year =         "1968",
  address =      "New York/London",
  pages =        "210",
}

@Book{mo:Fiacco:83,
  author =       "A. V. Fiacco",
  title =        "Introductions to Sensitivity and Stability Analysis in
                 Nonlinear Programming",
  publisher =    "Academic Press",
  year =         "1983",
  address =      "New York",
  pages =        "367",
}

@Book{mo:Fletcher:87,
  author =       "R. Fletcher",
  title =        "Practical Methods of Optimization",
  publisher =    "John Wiley & sons",
  year =         "1987",
  address =      "Chichester",
  pages =        "436",
}

@Book{mo:ForsytheMoler:71,
  author =       "G. E. Forsythe and C. B. Moler",
  title =        "Computer-Verfahren fuer lineare algebraische Systeme",
  publisher =    "Oldenbourg",
  year =         "1971",
  address =      "Muenchen/Wien",
  pages =        "162",
}

@Book{mo:Foulds:92,
  author =       "L. R. Foulds",
  title =        "Graph Theory Applications",
  publisher =    "Springer",
  year =         "1992",
  address =      "New York",
  pages =        "385",
}

@Book{mo:FrancisWhite:74,
  author =       "R. L. Francis and J. A. White",
  title =        "Facility Layout and Location",
  publisher =    "Prentice-Hall",
  year =         "1974",
  address =      "Englewood Cliffs",
  pages =        "468",
}

@Book{mo:Franklin:80,
  author =       "J. Franklin",
  title =        "Methods of Mathematical Economics",
  publisher =    "Springer",
  year =         "1980",
  address =      "New York",
  pages =        "297",
}

@Book{mo:FraterSchueller:89,
  author =       "H. Frater and M. Schueller",
  title =        "Das Gro\ss{}e Buch zu {EXCEL}",
  publisher =    "Data Becker",
  year =         "1989",
  address =      "Duesseldorf",
  pages =        "534",
}

@Book{mo:Fremuth:92,
  author =       "H. Fremuth",
  title =        "{OS}/2 2.0",
  publisher =    "te-wi-Verlag",
  year =         "1992",
  address =      "Muenchen",
  edition =      "zweite",
  pages =        "614",
}

@Book{mo:Fujishige:91,
  author =       "S. Fujishige",
  title =        "Submodular Functions and Optimization",
  publisher =    "North-Holland",
  year =         "1991",
  address =      "Amsterdam",
  pages =        "270",
}

@Book{mo:GarfinkelNemhauser:72,
  author =       "R. S. Garfinkel and G. L. Nemhauser",
  title =        "Integer Programming",
  publisher =    "John Wiley & sons",
  year =         "1972",
  address =      "New York/Chichester",
  pages =        "427",
}

@Book{mo:GareyJohnson:79,
  author =       "M. R. Garey and D. S. Johnson",
  title =        "Computers and Intractability ({A} Guide to Theory of
                 {NP}-Completeness)",
  publisher =    "Freeman",
  year =         "1979",
  address =      "New York",
  pages =        "340",
}

@Book{mo:Gastinel:72,
  author =       "N. Gastinel",
  title =        "Lineare numerische Analysis",
  publisher =    "Vieweg",
  year =         "1972",
  address =      "Braunschweig",
  series =       "Logik und Grundlagen der Mathematik",
  volume =       "9",
  pages =        "359",
}

@Book{mo:George:88,
  author =       "D. A. R. George",
  title =        "Mathematical Modelling for Economists",
  publisher =    "McMillan",
  year =         "1988",
  address =      "London",
  pages =        "170",
}

@Book{mo:Gibbons:85,
  author =       "A. Gibbons",
  title =        "Algorithmic Graph Theory",
  publisher =    "Cambridge University Press",
  year =         "1985",
  address =      "Cambridge/London",
  pages =        "259",
}

@Book{mo:Gill:74,
  author =       "P. E. Gill",
  title =        "Numerical Methods for constrained Optimization",
  publisher =    "Academic Press",
  year =         "1974",
  address =      "London/New York",
  pages =        "82",
}

@Book{mo:GillMurrayWright:91,
  author =       "P. E. Gill and W. Murray and M. H. Wright",
  title =        "Numerical Linear Algebra and Optimization",
  publisher =    "Addison-Wesley",
  year =         "1991",
  address =      "Redwood City",
  volume =       "1",
  pages =        "426",
}

@Book{mo:Girsanov:72,
  author =       "I. V. Girsanov",
  title =        "Lectures on Mathematical Theory of Extremum Problems",
  publisher =    "Springer",
  year =         "1972",
  address =      "Berlin/New York",
  series =       "Lecture Notes in Economics and Mathematical Systems",
  volume =       "67",
  pages =        "136",
}

@Book{mo:GirlichKowaljow:81,
  author =       "E. Girlich and M. M. Kowaljow",
  title =        "Nichtlineare diskrete Optimierung",
  publisher =    "Akademie",
  year =         "1981",
  address =      "Berlin",
  series =       "Mathematische Forschung Band",
  volume =       "6",
  pages =        "218",
}

@Book{mo:Glover:89,
  title =        "Linkages with Artificial Intelligence",
  publisher =    "Baltzer",
  year =         "1989",
  address =      "Basel",
  editor =       "F. Glover",
  pages =        "334",
}

@Book{mo:Goeckel:90,
  author =       "H. Goeckel",
  title =        "Word Perfect 5.",
  publisher =    "Huethig",
  year =         "1990",
  address =      "Heidelberg",
  pages =        "1124",
}

@Book{mo:Golstein:75,
  author =       "E. G. Golstein",
  title =        "Dualitaetstheorie in der nichtlinearen Optimierung und
                 ihre Anwendung",
  publisher =    "Akademie",
  year =         "1975",
  address =      "Berlin",
  pages =        "254",
}

@Book{mo:Golumbic:80,
  author =       "M. C. Golumbic",
  title =        "Algorithmic Graph Theory and Perfect Graphs",
  publisher =    "Academic Press",
  year =         "1980",
  address =      "New York",
  pages =        "284",
}

@Book{mo:Goldberg:89,
  author =       "David E. Goldberg",
  title =        "Genetic Algorithms in Search, Optimization 6 Machine
                 Learning",
  publisher =    "Addison-Wesley",
  year =         "1989",
  address =      "Massachusetts",
  series =       "Reading",
  pages =        "412",
}

@Book{mo:GolubVanLoan:89,
  author =       "G. H. Golub and C. F. van Loan",
  title =        "Matrix Computations",
  publisher =    "John Hopkins University Press",
  year =         "1989",
  address =      "Baltimore",
  pages =        "642",
}

@Book{mo:GolubVanLoan:89a,
  author =       "G. H. Golub and C. F. van Loan",
  title =        "Matrix Computations",
  publisher =    "Johns Hopkins Univ. Press",
  year =         "1989",
  address =      "London",
  edition =      "second",
  pages =        "642",
}

@Book{mo:GondranMinoux:84,
  author =       "M. Gondran and M. Minoux",
  title =        "Graphs and Algorithms",
  publisher =    "John Wiley & sons",
  year =         "1984",
  address =      "Chichester/New York",
  pages =        "650",
}

@Book{mo:Gonnet:84,
  author =       "G. H. Gonnet",
  title =        "Handbook of Algorithms and Data Structures",
  publisher =    "Addison-Wesley",
  year =         "1984",
  address =      "London",
  pages =        "286",
}

@Book{mo:GoodmanHedetniemi:77,
  author =       "S. W. Goodman and S. T. Hedetniemi",
  title =        "Introduction to the Design and Analysis of
                 Algorithms",
  publisher =    "McGraw-Hill",
  year =         "1977",
  address =      "New York",
  pages =        "371",
}

@Book{mo:GourlayWatson:73,
  author =       "A. R. Gourlay and G. A. Watson",
  title =        "Computational Methods for Matrix Eigenproblems",
  publisher =    "John Wiley & sons",
  year =         "1973",
  address =      "London/New York",
  pages =        "132",
}

@Book{mo:GrahamKnuthPatashnik:89,
  author =       "R. L. Graham and D. E. Knuth and O. Patashnik",
  title =        "Concrete Mathematics. {A} Foundation for Computer
                 Science",
  publisher =    "Addison Wesley",
  year =         "1989",
  address =      "New York",
  pages =        "625",
}

@Book{mo:Groetschel:77,
  author =       "M. Groetschel",
  title =        "Polyedrische Charakterisierungen kombinatorischer
                 Optimierungsprobleme",
  publisher =    "Meisenheim",
  year =         "1977",
  pages =        "305",
}

@Book{mo:GroetschelLovaszSchrijver:88,
  author =       "M. Groetschel and L. Lovasz and A. Schrijver",
  title =        "Geometric Algorithms and Combinatorial Optimization",
  publisher =    "Springer",
  year =         "1988",
  address =      "Berlin",
  pages =        "362",
}

@Book{mo:GruberWills:83,
  author =       "P. M. Gruber and J. M. Wills",
  title =        "Convexity and its Applications",
  publisher =    "Birkhaeuser",
  year =         "1983",
  address =      "Basel",
  pages =        "421",
}

@Book{mo:GuddatGuerraVasquezJongen:90,
  author =       "J. Guddat and F. Guerra Vasquez and H. Th. Jongen",
  title =        "Parametric Optimization: Singularities, Pathfollowing
                 and Jumps",
  publisher =    "Teubner",
  year =         "1990",
  address =      "Stuttgart",
}

@Book{mo:GusfieldIrving:89,
  author =       "D. Gusfield and R. W. Irving",
  title =        "The Stable Marriage Problems: Structure and
                 Algorithms",
  publisher =    "MIT Press",
  year =         "1989",
  address =      "Cambridge, MA",
  pages =        "240",
}

@Book{mo:Hackbusch:85,
  author =       "W. Hackbusch",
  title =        "Multi-Grid Methods and Applications",
  publisher =    "Springer",
  year =         "1985",
  address =      "Berlin/New York",
  pages =        "377",
}

@Book{mo:HarbisonSteele:84,
  author =       "S. P. Harbison and G. L. Steele jr.",
  title =        "{C}, {A} Reference Manual",
  publisher =    "Prentice-Hall",
  year =         "1984",
  address =      "New Jersey",
  pages =        "352",
}

@Book{mo:Hastings:73,
  author =       "N. A. J. Hastings",
  title =        "Dynamic Programming with Management Applications",
  publisher =    "Butterworth",
  year =         "1973",
  address =      "London",
  pages =        "173",
}

@Book{mo:Haessig:79,
  author =       "K. Haessig",
  title =        "Graphentheoretische Methoden des Operations Research",
  publisher =    "Teubner",
  year =         "1979",
  address =      "Stuttgart",
  series =       "LAMM",
  volume =       "42",
  pages =        "160",
}

@Book{mo:Hausmann:80,
  author =       "D. Hausmann",
  title =        "Adjacency on Polytopes in Combinatorial Optimization",
  publisher =    "Hain",
  year =         "1980",
  address =      "Meisenheim",
  series =       "mathematical systems in economics",
  volume =       "49",
  pages =        "237",
}

@Book{mo:Heestermann:83,
  author =       "A. R. G. Heesterman",
  title =        "Matrices and Simplex Algorithms",
  publisher =    "Reidel Publ. Comp.",
  year =         "1983",
  address =      "Dordrecht",
  pages =        "790",
}

@Book{mo:Heiser:90,
  author =       "P. W. Heiser",
  title =        "Retten defekter dBase-Dateien",
  publisher =    "te-wi Verlag",
  year =         "990",
  address =      "Muenchen",
  pages =        "360",
}

@Book{mo:Hennie:77,
  author =       "F. Hennie",
  title =        "Introduction to Computability",
  publisher =    "Addison-Wesley",
  year =         "1977",
  address =      "Reading",
}

@Book{mo:HestenesSokolnikoff:66,
  title =        "Calculus of Variations and Optimal Control Theory",
  publisher =    "John Wiley & sons",
  year =         "1966",
  address =      "New York/London",
  editor =       "M. R. Hestenes and I. S. Sokolnikoff",
  pages =        "404",
}

@Book{mo:Hestenes:75,
  author =       "M. R. Hestenes",
  title =        "Optimization theory : the finite dimensional case",
  publisher =    "John Wiley & sons",
  year =         "1975",
  address =      "New York",
  series =       "Pure and Applied Mathematic-A Wiley-Interscience
                 Publication",
  pages =        "447",
}

@Book{mo:Hestenes:80,
  author =       "M. R. Hestenes",
  title =        "Conjugate Direction Methods in Optimization",
  publisher =    "Springer",
  year =         "1980",
  address =      "Berlin",
  pages =        "325",
}

@Book{mo:HettichZencke:82,
  author =       "R. Hettich and P. Zencke",
  title =        "Numerische Methoden der Approximation und
                 semi-infiniten Optimierung",
  publisher =    "Teubner",
  year =         "1982",
  address =      "Stuttgart",
  pages =        "232",
}

@Book{mo:HeymanSobel:82,
  author =       "D. P. Heyman and M. J. Sobel",
  title =        "Stochastic Methods in Operations Research {I}",
  publisher =    "McGraw Hill",
  year =         "1982",
  address =      "Hamburg",
}

@Book{mo:HeymanSobel:84,
  author =       "D. P. Heyman and M. J. Sobel",
  title =        "Stochastic Methods in Operations Research {II}",
  publisher =    "McGraw Hill",
  year =         "1984",
  address =      "Hamburg",
}

@Book{mo:HillmannAlexandersonGrassl:87,
  author =       "A. P. Hillmann and G. L. Alexanderson and R. M.
                 Grassl",
  title =        "Discrete and Combinatorial Mathematics",
  publisher =    "Dellen Publ. Comp.",
  year =         "1987",
  address =      "San Francisco",
  pages =        "625",
}

@Book{mo:Hilbert:90,
  author =       "David Hilbert",
  title =        "Natur und Mathematisches Erkennen. Vorlesung",
  publisher =    "Math. Institut",
  year =         "1990",
  address =      "Goettingen",
  pages =        "117",
}

@Book{mo:HoSundarraj:89,
  author =       "J. Ho and R. P. Sundarraj",
  title =        "{DECOMP}: an Implementation of Dantzig{F}-Wolfe
                 Decomposition for Linear Programming",
  publisher =    "Springer",
  year =         "1989",
  address =      "New York",
  pages =        "206",
}

@Book{mo:HockneyJesshope:81,
  author =       "R. W. Hockney and C. R. Jesshope",
  title =        "Parallel Computers",
  publisher =    "Adam Hilger Ltd",
  year =         "1981",
  address =      "Bristol",
  pages =        "423",
}

@Book{mo:Hoffmann:88,
  author =       "K.-H. Hoffmann",
  title =        "Trends in Mathematical Optimization",
  publisher =    "Birkhaeuser",
  year =         "1988",
  address =      "Basel",
  pages =        "390",
}

@Book{mo:Horst:79,
  author =       "R. Horst",
  title =        "Nichtlineare Optimierung",
  publisher =    "Carl Hanser",
  year =         "1979",
  address =      "Muenchen/Wien",
  pages =        "314",
}

@Book{mo:HorstTuy:90,
  author =       "R. Horst and H. Tuy",
  title =        "Global Optimization",
  publisher =    "Springer",
  year =         "1990",
  address =      "Berlin",
  pages =        "696",
}

@Book{mo:HorstTuy:92,
  author =       "R. Horst and H. Tuy",
  title =        "Global Optimization",
  publisher =    "Springer",
  year =         "1992",
  address =      "Berlin",
  edition =      "second",
  pages =        "698",
}

@Book{mo:Hossfeld:83,
  author =       "F. Hossfeld",
  title =        "Parallele Algorithmen",
  publisher =    "Springer",
  year =         "1983",
  address =      "Berlin",
  series =       "Informatik-Fachberichte",
  volume =       "64",
  pages =        "232",
}

@Book{mo:Hu:69,
  author =       "T. C. Hu",
  title =        "Integer Programming and Network Flows",
  publisher =    "Addison-Wesley",
  year =         "1969",
  address =      "Reading",
  pages =        "452",
}

@Book{mo:HuRobinson:73,
  author =       "T. C. Hu and S. M. Robinson",
  title =        "Mathematical Programming",
  publisher =    "Academic Press",
  year =         "1973",
  address =      "New York",
  pages =        "295",
}

@Book{mo:Hu:82,
  author =       "T. C. Hu",
  title =        "Combinatorial Algorithms",
  publisher =    "Addison-Wesley",
  year =         "1982",
  address =      "Reading",
  pages =        "292",
}

@Book{mo:InternationalMathematicalUnion:86,
  author =       "International Mathematical Union",
  title =        "World Directory of Mathematics 1986",
  publisher =    "American Mathematical Society",
  year =         "1986",
  address =      "Providence",
  edition =      "eighth",
  pages =        "950",
}

@Book{mo:Iri:69,
  author =       "M. Iri",
  title =        "Network Flow, Transportation and Scheduling: Theory
                 and Algorithms",
  publisher =    "Academic Press",
  year =         "1969",
  address =      "New York/London",
  series =       "Mathematics in science and engineering",
  volume =       "57",
  pages =        "316",
}

@Book{mo:Jahn:86,
  author =       "J. Jahn",
  title =        "Mathematical Vector Optimization in Partially Ordered
                 Linear Spaces",
  publisher =    "Lang",
  year =         "1986",
  address =      "Frankfurt",
  pages =        "310",
}

@Book{mo:JahnKrabs:87,
  author =       "J. Jahn and W. Krabs",
  title =        "Recent Advances and Historical Development of Vector
                 Optimization",
  publisher =    "Springer",
  year =         "1987",
  address =      "Berlin",
  series =       "Lecture Notes in Economics and Mathematical Systems",
  volume =       "294",
  pages =        "405",
}

@Book{mo:JensenBarnes:87,
  author =       "P. A. Jensen and J. W. Barnes",
  title =        "Network Flow Programming",
  publisher =    "Krieger Publ. Comp.",
  year =         "1987",
  address =      "Malabar, Florida",
  pages =        "408",
}

@Book{mo:Jeroslow:89,
  author =       "R. G. Jeroslow",
  title =        "Logic-Based Decision Support",
  publisher =    "North-Holland",
  year =         "1989",
  address =      "Amsterdam",
  pages =        "222",
}

@Book{mo:Jeter:86,
  author =       "M. W. Jeter",
  title =        "Mathematical Programming. An Introduction to
                 Optimization",
  publisher =    "Dekker",
  year =         "1986",
  address =      "New York",
  pages =        "342",
}

@Book{mo:Johnson:80,
  author =       "E. L. Johnson",
  title =        "Integer Programming: Facets, Subadditivity, and
                 Duality for Group and Semi-group Problems",
  publisher =    "Arrowsmith Ltd.",
  year =         "1980",
  address =      "Bristol",
  pages =        "68",
}

@Book{mo:JohnsonNishizeki:87,
  author =       "D. S. Johnson and T. Nishizeki",
  title =        "Discrete Algorithms and Complexity",
  publisher =    "Academic Press",
  year =         "1987",
  address =      "Boston",
  pages =        "483",
}

@Book{mo:JongenJonkerTwilt:83,
  author =       "H. Th. Jongen and P. Jonker and F. Twilt",
  title =        "Nonlinear Optimization in Rn. ({I}., Morse Theory,
                 Chebyshev Approximation",
  publisher =    "Lang",
  year =         "1983",
  address =      "Frankfurt",
  pages =        "262",
}

@Book{mo:JongenJonkerTwilt:86,
  author =       "H. Th. Jongen and P. Jonker and F. Twilt",
  title =        "Nonlinear Optimization in Rn. ({II}., Transversality,
                 Flows, Parametric Aspects",
  publisher =    "Lang",
  year =         "1986",
  address =      "Frankfurt",
  pages =        "265--560",
}

@Book{mo:Juenger:85,
  author =       "M. Juenger",
  title =        "Polyhedral Combinatorics and the Acyclic Subdigraph
                 Problem",
  publisher =    "Heldermann",
  year =         "1985",
  address =      "Berlin",
  series =       "Research and Exposition in Mathematics",
  volume =       "7",
  pages =        "128",
}

@Book{mo:Jungnickel:87,
  author =       "D. Jungnickel",
  title =        "Graphen, Netzwerke und Algorithmen",
  publisher =    "Bibliographisches Institut",
  year =         "1987",
  address =      "Mannheim",
  pages =        "405",
}

@Book{mo:Jungnickel:90,
  author =       "D. Jungnickel",
  title =        "Graphen, Netzwerke und Algorithmen",
  publisher =    "BI Wissenschaftsverlag",
  year =         "1990",
  address =      "Mannheim",
  pages =        "434",
}

@Book{mo:Kall:76,
  author =       "P. Kall",
  title =        "Mathematische Methoden des Operations Research",
  publisher =    "B. G. Teubner",
  year =         "1976",
  address =      "Stuttgart",
  series =       "Leitfaeden der angewandten Mathematik und Mechanik",
  volume =       "27",
  pages =        "176",
}

@Book{mo:Karp:74,
  author =       "R. M. Karp",
  title =        "Complexity of Computation",
  publisher =    "AMS",
  year =         "1974",
  address =      "Providence, Rhode Island",
  series =       "SIAM-AMS Proceedings",
  volume =       "7",
  pages =        "166",
}

@Book{mo:Karmardian:77,
  author =       "S. Karamardian",
  title =        "Fixed Points",
  publisher =    "Academic Press",
  year =         "1977",
  address =      "New York/London",
  pages =        "494",
}

@Book{mo:Kastning:76,
  title =        "Integer Programming and Related Areas : {A} Classified
                 Bibliography",
  publisher =    "Springer",
  year =         "1976",
  address =      "Heidelberg",
  editor =       "C. Kastning",
  series =       "Lecture Notes in Economics and Mathematical Systems",
  volume =       "128",
  pages =        "495",
}

@Book{mo:Kaufmann:63,
  author =       "A. Kaufmann",
  title =        "Methods and Models of Operations Research",
  publisher =    "Prentice-Hall",
  year =         "1963",
  pages =        "510",
}

@Book{mo:KaufmannHenry-Labordere:77,
  author =       "A. Kaufmann and A. Henry-Labordere",
  title =        "Integer and Mixed Programming: Theory and
                 Applications",
  publisher =    "Academic Press",
  year =         "1977",
  address =      "New York",
  pages =        "379",
}

@Book{mo:Kemp:84,
  author =       "R. Kemp",
  title =        "Fundamentals of the Average Case Analysis of
                 Particular Algorithms",
  publisher =    "Teubner",
  year =         "1984",
  address =      "Stuttgart",
  pages =        "233",
}

@Book{mo:KenningtonHelgason:80,
  author =       "J. L. Kennington and R. V. Helgason",
  title =        "Algorithms for Network Programming",
  publisher =    "John Wiley & sons",
  year =         "1980",
  address =      "New York/Chichester",
  pages =        "291",
}

@Book{mo:KernighanRitchie:90,
  author =       "B. W. Kernighan and D. M. Ritchie",
  title =        "Programmieren in {C}",
  publisher =    "Hanser",
  year =         "1990",
  address =      "Muenchen",
  pages =        "279",
}

@Book{mo:KiHangKim:82,
  author =       "Ki Hang Kim",
  title =        "Boolean Matrix Theory and Applications",
  publisher =    "Dekker",
  year =         "1982",
  address =      "New York",
  pages =        "288",
}

@Book{mo:KirschWarth:78,
  author =       "A. Kirsch and W. Warth",
  title =        "Notwendige Optimalitaetsbedingungen und ihre
                 Anwendung",
  publisher =    "Springer",
  year =         "1978",
  address =      "Heidelberg",
  series =       "Lecture Notes in Economics and Mathematical Systems",
  volume =       "152",
  pages =        "157",
}

@Book{mo:Kiwiel:85,
  author =       "K. C. Kiwiel",
  title =        "Methods of Descent for Nondifferentiable
                 Optimization",
  publisher =    "Springer",
  year =         "1985",
  address =      "Berlin",
  pages =        "362",
}

@Book{mo:KleinHaneveld:86,
  author =       "W. K. Klein Haneveld",
  title =        "Duality in Stochastic Linear and Dynamic
                 Programming.",
  publisher =    "Springer",
  year =         "1986",
  address =      "Berlin",
  series =       "Lecture Notes in Economics and Mathematical System",
  volume =       "274",
  pages =        "295",
}

@Book{mo:Knoedel:69,
  author =       "W. Knoedel",
  title =        "Graphentheoretische Methoden und ihre Anwendungen",
  publisher =    "Springer",
  year =         "1969",
  address =      "Berlin",
  series =       "Oekonometrie und Unternehmensforschung",
  volume =       "XIII",
  pages =        "111",
}

@Book{mo:Knuth:69,
  author =       "D. E. Knuth",
  title =        "The Art of computer programming, Vol. 1: Fundamental
                 Algorithms",
  publisher =    "Addison-Wesley",
  year =         "1969",
  address =      "Reading",
  series =       "Series in Computer Science and Information
                 Processing",
  pages =        "634",
}

@Book{mo:Knuth:69a,
  author =       "D. E. Knuth",
  title =        "The Art of computer programming, Vol. 2 :
                 Seminumerical Algorithms",
  publisher =    "Addison-Wesley",
  year =         "1969",
  address =      "Reading",
  series =       "Series in Computer Science and Information
                 Processing",
  pages =        "624",
}

@Book{mo:Knuth:73,
  author =       "D. E. Knuth",
  title =        "The Art of computer programming, Vol. 3 : Sorting and
                 Searching",
  publisher =    "Addison-Wesley",
  year =         "1973",
  address =      "Reading",
  series =       "Series in Computer Science and Information
                 Processing",
  pages =        "722",
}

@Book{mo:Knuth:84,
  author =       "D. E. Knuth",
  title =        "The {TEX} book",
  publisher =    "Addison-Wesley",
  year =         "1984",
  address =      "Reading",
  pages =        "478",
}

@Book{mo:Kocak:89,
  author =       "H. Kocak",
  title =        "Differential and Difference Equations through Computer
                 Experiments",
  publisher =    "Springer",
  year =         "1989",
  address =      "New York",
  pages =        "224",
}

@Book{mo:Koeckler:90,
  author =       "N. Koeckler",
  title =        "Numerische Algorithmen in Softwaresystemen",
  publisher =    "Teubner",
  year =         "1990",
  address =      "Stuttgart",
  pages =        "394",
}

@Book{mo:Kohlas:77,
  author =       "J. Kohlas",
  title =        "Stochastische Methoden des Operations Research",
  publisher =    "Teubner",
  year =         "1977",
  address =      "Stuttgart",
  pages =        "192",
}

@Book{mo:Kolchin:86,
  author =       "V. F. Kolchin",
  title =        "Random Mappings",
  publisher =    "Optimization Software, Inc.",
  year =         "1986",
  address =      "New York",
  pages =        "206",
}

@Book{mo:Koenig:81,
  title =        "Mathematical Programming at Oberwolfach",
  publisher =    "North-Holland",
  year =         "1981",
  address =      "Amsterdam",
  editor =       "H. Koenig and B. Korte and K. Ritter",
  series =       "Math. Programming Stud.",
  volume =       "14",
  pages =        "257",
}

@Book{mo:Kopka:91,
  author =       "H. Kopka",
  title =        "{LATEX}. Eine Einfuehrung",
  publisher =    "Addison-Wesley",
  year =         "1991",
  address =      "Bonn",
  edition =      "dritte",
  pages =        "375",
}

@Book{mo:Korfhage:84,
  author =       "R. R. Korfhage",
  title =        "Discrete Computational Structures",
  publisher =    "Academic Press",
  year =         "1984",
  pages =        "360",
}

@Book{mo:Korte:90,
  author =       "B. Korte",
  title =        "Paths, Flows, and {VLSI}-Layout",
  publisher =    "Springer",
  year =         "1990",
  address =      "Berlin",
  pages =        "383",
}

@Book{mo:KorteLovaszSchrader:91,
  author =       "B. Korte and L. Lovasz and R. Schrader",
  title =        "Greedoids",
  publisher =    "Springer",
  year =         "1991",
  address =      "Berlin",
  pages =        "211",
}

@Book{mo:KowalikOsborne:68,
  author =       "J. Kowalik and M. R. Osborne",
  title =        "methods for unconstrained optimization problems",
  publisher =    "American Elsevier",
  year =         "1968",
  address =      "New York",
  series =       "Modern analytic and computational methods in sci. and
                 math.",
  volume =       "13",
  pages =        "148",
}

@Book{mo:Krabs:75,
  author =       "W. Krabs",
  title =        "Optimierung und Approximation",
  publisher =    "Teubner",
  year =         "1975",
  address =      "Stuttgart",
  pages =        "208",
}

@Book{mo:Kronsjoe:87,
  author =       "L. Kronsjoe",
  title =        "Algorithms: Their Complexity and Efficiency",
  publisher =    "John Wiley & sons",
  year =         "1987",
  address =      "Chichester",
  pages =        "363",
}

@Book{mo:Kruse:86,
  author =       "H.-J. Kruse",
  title =        "Degeneracy Graphs and the Neighborhood Problem.",
  publisher =    "Springer",
  year =         "1986",
  address =      "Berlin",
  series =       "Lecture Notes in Economics and Mathematical Systems",
  volume =       "260",
  pages =        "126",
}

@Book{mo:Kucera:90,
  author =       "L. Kucera",
  title =        "Combinatorial Algorithms",
  publisher =    "Adam Hilger",
  year =         "1990",
  address =      "Briston",
  pages =        "270",
}

@Book{mo:KulischMiranker:81,
  author =       "U. W. Kulisch and W. L. Miranker",
  title =        "Computer Arithmetic in Theory and Practice",
  publisher =    "Academic Press Inc.",
  year =         "1981",
}

@Book{mo:KulischMiranker:83,
  author =       "U. W. Kulisch and W. L. Miranker",
  title =        "A New Approach to Sientific Computation",
  publisher =    "Academic Press",
  year =         "1983",
  address =      "Orlando",
  pages =        "383",
}

@Book{mo:Kulisch:87,
  title =        "Pascal-{SC}: {A} Pascal Extension for Scientific
                 Computation",
  publisher =    "John Wiley & sons",
  year =         "1987",
  address =      "Chichester/New York",
  editor =       "U. Kulisch",
  pages =        "190",
}

@Book{mo:Kung:86,
  author =       "J. P. S. Kung",
  title =        "A Source Book in Matroid Theory",
  publisher =    "Birkhaeuser",
  year =         "1986",
  address =      "Boston",
  pages =        "499",
}

@Book{mo:KurzhanskiNeumann:88,
  author =       "A. Kurzhanski and K. Neumann",
  title =        "Optimization, Parallel Processing and Applications",
  publisher =    "Springer",
  year =         "1988",
  address =      "Berlin",
  pages =        "292",
}

@Book{mo:KuestersArminger:89,
  author =       "U. Kuesters and G. Arminger",
  title =        "Programmieren in {GAUSS}",
  publisher =    "Fischer",
  year =         "1989",
  address =      "Stuttgart",
  pages =        "315",
}

@Book{mo:KuznetsovAdelson-Velskii:85,
  author =       "O. P. Kuznetsov and G. M. Adelson-Velskii",
  title =        "Discrete Mathematics for Engineers",
  publisher =    "Gordon and Breach",
  year =         "1985",
  address =      "New York",
  pages =        "410",
}

@Book{mo:Laarhoven:88,
  author =       "P. J. M. van Laarhoven",
  title =        "Theoretical and computational aspects of simulated
                 annealing",
  publisher =    "Centrum voor Wiskunde en Informatica",
  year =         "1988",
  address =      "Amsterdam",
  pages =        "168",
}

@Book{mo:Lau:86,
  author =       "H. T. Lau",
  title =        "Combinatorial Heuristic Algorithms with {FORTRAN}",
  publisher =    "Springer",
  year =         "1986",
  address =      "Berlin",
  series =       "Lecture Notes in Economics and Mathematical Systems",
  volume =       "280",
  pages =        "126",
}

@Book{mo:Laeuchli:91,
  author =       "P. Laeuchli",
  title =        "Algorithmische Graphentheorie",
  publisher =    "Birkhaeuser",
  year =         "1991",
  address =      "Basel",
  pages =        "139",
}

@Book{mo:Lawler:85,
  title =        "The Travelling Salesman Problem",
  publisher =    "John Wiley & sons",
  year =         "1985",
  address =      "Manchester/New York",
  editor =       "E. L. Lawler and J. K. Lenstra and A. H. G Rinnooy Kan
                 and D. B. Shmoys",
  pages =        "465",
}

@Book{mo:Leeuwen:90,
  author =       "Jan van Leeuwen",
  title =        "Algorithms and Complexity, Vol. {A}",
  publisher =    "Elsevier",
  year =         "1990",
  address =      "Amsterdam",
  pages =        "996",
}

@Book{mo:Lenstra:85,
  author =       "J. K. Lenstra",
  title =        "Sequencing by Enumerative Methods",
  publisher =    "Mathematisch Centrum",
  year =         "1985",
  address =      "Amsterdam",
  pages =        "198",
}

@Book{mo:Lengauer:90,
  author =       "T. Lengauer",
  title =        "Combinatorial Algorithms for Integrated Circuit
                 Layout",
  publisher =    "Teubner",
  year =         "1990",
  address =      "Stuttgart",
  pages =        "697",
}

@Book{mo:Lewis:86,
  author =       "F. L. Lewis",
  title =        "Optimal Control",
  publisher =    "John Wiley & sons",
  year =         "1986",
  address =      "New York",
  pages =        "362",
}

@Book{mo:Lewis:86a,
  author =       "F. L. Lewis",
  title =        "Optimal Estimation (With an Introduction to Stochastic
                 Control Theory)",
  publisher =    "John Wiley & sons",
  year =         "1986",
  address =      "New York",
  pages =        "376",
}

@Book{mo:Liebling:70,
  author =       "T. M. Liebling",
  title =        "Graphentheorie in Planungs- und Tourenproblemen",
  publisher =    "Springer",
  year =         "1970",
  address =      "Berlin/New York",
  series =       "LN in Operations Research and Mathematical Systems",
  volume =       "21",
  pages =        "116",
}

@Book{mo:Liu:85,
  author =       "C. L. Liu",
  title =        "Elements of Discrete Mathematics",
  publisher =    "McGraw-Hill",
  year =         "1985",
  address =      "New York",
  edition =      "second",
  pages =        "433",
}

@Book{mo:Lommatzsch:79,
  author =       "K. Lommatzsch",
  title =        "Anwendungen der Linearen Parametrischen Optimierung",
  publisher =    "Birkhaeuser",
  year =         "1979",
  address =      "Basel",
  pages =        "189",
}

@Book{mo:Lovasz:79,
  author =       "L. Lovasz",
  title =        "Combinatorial Problems and Exercises",
  publisher =    "North-Holland",
  year =         "1979",
  address =      "Amsterdam",
  pages =        "551",
}

@Book{mo:LovaszPlummer:86,
  author =       "L. Lovasz and M. D. Plummer",
  title =        "Matching Theory",
  publisher =    "North-Holland",
  year =         "1986",
  address =      "Amsterdam",
  pages =        "544",
}

@Book{mo:Lovasz:86,
  author =       "L. Lovasz",
  title =        "An algorithmic Theory of Numbers, Graphs and
                 Convexity",
  publisher =    "SIAM",
  year =         "1986",
  address =      "Philadelphia",
  pages =        "91",
}

@Book{mo:LuceRaiffa:57,
  author =       "R. D. Luce and H. Raiffa",
  title =        "Games and Dicisions",
  publisher =    "John Wiley & sons",
  year =         "1957",
  address =      "New York",
  pages =        "509",
}

@Book{mo:Luenberger:84,
  author =       "D. G. Luenberger",
  title =        "Linear and Nonlinear Programming",
  publisher =    "Addison-Wesley",
  year =         "1984",
  address =      "Reading",
  edition =      "second",
  pages =        "491",
}

@Book{mo:Luethi:76,
  author =       "H.-J. Luethi",
  title =        "Komplementaritaets- und Fixpunktalgorithmen in der
                 Mathem. Programmierung, Spieltheorie und Oekonomie",
  publisher =    "Springer",
  year =         "1976",
  address =      "Berlin",
  series =       "Lecture Notes in Economic and Mathematical Systems",
  volume =       "129",
  pages =        "145",
}

@Book{mo:MalanowskiMizukami:86,
  author =       "K. Malanowski and K. Mizukami",
  title =        "Analysis and Algorithms of Optimization Problems",
  publisher =    "Springer",
  year =         "1986",
  address =      "Berlin",
  series =       "Lecture Notes in Control and Information Sciences",
  volume =       "82",
  pages =        "236",
}

@Book{mo:Marshall:71,
  author =       "C. W. Marshall",
  title =        "Applied Graph Theory",
  publisher =    "Wiley-Interscience",
  year =         "1971",
  address =      "New York/London",
  pages =        "322",
}

@Book{mo:Martos:75,
  author =       "B. Martos",
  title =        "Nonlinear Programming Theory and Methods",
  publisher =    "North Holland",
  year =         "1975",
  address =      "Amsterdam",
  pages =        "279",
}

@Book{mo:Martello:87,
  author =       "S. Martello",
  title =        "Surveys in Combinatorial Optimization",
  publisher =    "North-Holland",
  year =         "1987",
  address =      "Amsterdam",
  pages =        "384",
}

@Book{mo:MartelloToth:90b,
  author =       "S. Martello and P. Toth",
  title =        "Knapsack Problems. Algorithms and Computer
                 Implementations",
  publisher =    "John Wiley & sons",
  year =         "1990",
  address =      "Chichester",
  pages =        "296",
}

@Book{mo:Maurer:74,
  author =       "H. Maurer",
  title =        "Datenstrukturen und Programmierverfahren",
  publisher =    "Teubner",
  year =         "1974",
  address =      "Stuttgart",
  pages =        "222",
}

@Book{mo:McCormick:83,
  author =       "G. P. McCormick",
  title =        "Nonlinear Programming. Theory, Algorithms, and
                 Applications",
  publisher =    "John Wiley & sons",
  year =         "1983",
  address =      "New York",
  pages =        "444",
}

@Book{mo:MederScheuber:90,
  author =       "N. Meder and P. Scheuber",
  title =        "{MS}-{OS}/2",
  publisher =    "Markt \& Technik",
  year =         "1990",
  address =      "Haar",
  pages =        "569",
}

@Book{mo:Megiddo:89,
  author =       "N. Megiddo",
  title =        "Progress in Mathematical Programming",
  publisher =    "Springer",
  year =         "1989",
  address =      "New York",
  pages =        "158",
}

@Book{mo:Mehlhorn:84,
  author =       "K. Mehlhorn",
  title =        "Graph Algorithms and {NP}-Completeness",
  publisher =    "Springer",
  year =         "1984",
  address =      "Berlin",
  series =       "Data Structures and Algorithms",
  volume =       "2",
  pages =        "260",
}

@Book{mo:Mehlhorn:84a,
  author =       "K. Mehlhorn",
  title =        "Multi-dimensional Searching and Computational
                 Geometry",
  publisher =    "Springer",
  year =         "1984",
  address =      "Berlin",
  series =       "Data Structures and Algorithms",
  volume =       "3",
  pages =        "284",
}

@Book{mo:Mehlhorn:86,
  author =       "K. Mehlhorn",
  title =        "Datenstrukturen und effiziente Algorithmen, Band 1:
                 Sortieren und Suchen",
  publisher =    "Teubner",
  year =         "1986",
  address =      "Stuttgart",
  pages =        "314",
}

@Book{mo:MeisMarcowitz:78,
  author =       "Th. Meis and U. Marcowitz",
  title =        "Numerische Behandlung partieller
                 Differentialgleichungen",
  publisher =    "Springer",
  year =         "1978",
  address =      "Berlin",
  pages =        "452",
}

@Book{mo:MessingerRuedenberg:77,
  author =       "H. Messinger and W. Ruedenberg",
  title =        "Langenscheidts Handwoerterbuch.
                 Engl.-Deutsch/Deutsch-Engl",
  publisher =    "Langenscheidt",
  year =         "1977",
  address =      "Berlin",
  pages =        "1470",
}

@Book{mo:MeyerZenios:88,
  author =       "R. R. Meyer and S. A. Zenios",
  title =        "Parallel Optimization on Novel Computer
                 Architectures",
  publisher =    "Baltzer",
  year =         "1988",
  address =      "Basel",
  series =       "Annals of Operations Research",
  volume =       "14",
  pages =        "322",
}

@Book{mo:Minieka:78,
  author =       "E. Minieka",
  title =        "Optimization Algorithms for Networks and Graphs",
  publisher =    "Marcel Dekker",
  year =         "1978",
  address =      "New York/Basel",
  pages =        "356",
}

@Book{mo:Minoux:86,
  author =       "M. Minoux",
  title =        "Mathematical Programming. Theory and Algorithms",
  publisher =    "John Wiley & sons",
  year =         "1986",
  address =      "Chichester",
  pages =        "489",
}

@Book{mo:Minc:88,
  author =       "H. Minc",
  title =        "Nonnegative Matrices",
  publisher =    "John Wiley & sons",
  year =         "1988",
  address =      "New York",
  pages =        "206",
}

@Book{mo:MirkinRoding:84,
  author =       "B. G. Mirkin and S. N. Roding",
  title =        "Graphs and Genes.",
  publisher =    "Springer",
  year =         "1984",
  address =      "Berlin",
  series =       "Biomathematics",
  volume =       "11",
  pages =        "197",
}

@Book{mo:Morgenstern:63,
  author =       "O. Morgenstern",
  title =        "Spieltheorie und Wirtschaftswissenschaft",
  publisher =    "Oldenbourg",
  year =         "1963",
  address =      "Wien/Muenchen",
  pages =        "200",
}

@Book{mo:Mosler:76,
  author =       "K. C. Mosler",
  title =        "Optimale Transportnetze",
  publisher =    "Springer",
  year =         "1976",
  address =      "Berlin/New York",
  series =       "Lecture Notes in Economics and Mathematical Systems",
  volume =       "125",
  pages =        "142",
}

@Book{mo:Mosler:87,
  author =       "K. C. Mosler",
  title =        "Continuous Location of Transportation Networks",
  publisher =    "Springer",
  year =         "1987",
  address =      "Berlin",
  pages =        "158",
}

@Book{mo:MuellerNollauPolovinkin:86,
  author =       "Mueller and Nollau and Polovinkin",
  title =        "Stochastische Suchverfahren",
  publisher =    "Deutsch",
  year =         "1986",
  address =      "Thun",
  pages =        "89",
}

@Book{mo:Murray:72,
  title =        "Numerical methods for unconstrained optimization",
  publisher =    "Academic Press",
  year =         "1972",
  address =      "London/New York",
  editor =       "W. Murray",
  pages =        "144",
}

@Book{mo:Murty:83,
  author =       "K. G. Murty",
  title =        "Linear Programming",
  publisher =    "John Wiley & sons",
  year =         "1983",
  address =      "New York/Chichester",
  pages =        "482",
}

@Book{mo:Murota:87,
  author =       "K. Murota",
  title =        "Systems Analysis by Graphs and Matroids",
  publisher =    "Springer",
  year =         "1987",
  address =      "Berlin",
  pages =        "281",
}

@Book{mo:Murty:88,
  author =       "K. G. Murty",
  title =        "Linear Complementarity, Linear and Nonlinear
                 Programming",
  publisher =    "Heldermann",
  year =         "1988",
  address =      "Berlin",
  pages =        "629",
}

@Book{mo:Murty:92,
  author =       "K. G. Murty",
  title =        "Network Programming",
  publisher =    "Prentice Hall",
  year =         "1992",
  address =      "Englewood Cliffs, NJ",
  pages =        "623",
}

@Book{mo:Nazareth:87,
  author =       "J. L. Nazareth",
  title =        "Computer Solution of Linear Programs",
  publisher =    "Oxford University Press",
  year =         "1987",
  address =      "Oxford",
  pages =        "231",
}

@Book{mo:Nemirovsky:83,
  author =       "A. S. Nemirovsky and D. B. Yudin",
  title =        "Problem Complexity and Method Efficiency in
                 Optimization",
  publisher =    "John Wiley & sons",
  year =         "1983",
  address =      "Chichester",
  pages =        "388",
}

@Book{mo:NemhauserWolsey:88,
  author =       "G. L. Nemhauser and L. A. Wolsey",
  title =        "Integer and Combinatorial Optimization",
  publisher =    "John Wiley & sons",
  year =         "1988",
  address =      "New York",
  pages =        "763",
}

@Book{mo:NemhauserRinnooyKanTodd:89,
  author =       "G. L. Nemhauser and A. H. G. Rinnooy Kan and M. J.
                 Todd",
  title =        "Optimization",
  publisher =    "North-Holland",
  year =         "1989",
  address =      "Amsterdam",
  pages =        "709",
}

@Book{mo:Neunzert:80,
  title =        "Analysis 1. Ein Lehr- und Arbeitsbuch fuer
                 Studienanfaenger",
  publisher =    "Springer",
  year =         "1980",
  address =      "Berlin",
  editor =       "H. Neunzert",
  series =       "Mathematik fuer Physiker und Ing.",
  pages =        "335",
}

@Book{mo:Neunzert:82,
  title =        "Analysis 2. Mit einer Einfuehrung in die Vektor- und
                 Matrizenrechnung",
  publisher =    "Springer",
  year =         "1982",
  address =      "Berlin",
  editor =       "H. Neunzert",
  series =       "Mathematik fuer Physiker und Ing.",
  pages =        "316",
}

@Book{mo:NeumannPallaschke:85,
  author =       "K. Neumann and D. Pallaschke",
  title =        "Contributions to Operations Research",
  publisher =    "Springer",
  year =         "1985",
  address =      "Berlin",
  pages =        "190",
}

@Book{mo:NeumannMorlock:93,
  author =       "K. Neumann and M. Morlock",
  title =        "Operations Research",
  publisher =    "Hanser",
  year =         "1993",
  address =      "Muenchen",
  pages =        "779",
}

@Book{mo:Newman:72,
  author =       "M. Newman",
  title =        "Integral Matrices",
  publisher =    "Academic Press",
  year =         "1972",
  address =      "New York",
  pages =        "224",
}

@Book{mo:NijenhuisWilf:78,
  author =       "A. Nijenhuis and H. S. Wilf",
  title =        "Combinatorial Algorithms: For Computers and
                 Calculators",
  publisher =    "Academic Press",
  year =         "1978",
  pages =        "302",
}

@Book{mo:NishizekiChiba:88,
  author =       "T. Nishizeki and N. Chiba",
  title =        "Planar Graphs: Theory and Algorithms",
  publisher =    "North-Holland",
  year =         "1988",
  address =      "Amsterdam",
  pages =        "232",
}

@Book{mo:NoebauerTimischl:79,
  author =       "W. Noebauer and W. Timischl",
  title =        "Mathematische Modelle in der Biologie",
  publisher =    "Vieweg \& Sohn",
  year =         "1979",
  address =      "Braunschweig/Wiesbaden",
  pages =        "232",
}

@Book{mo:Noltemeier:70,
  author =       "H. Noltemeier",
  title =        "Sensitivitaetsanalyse bei diskreten linearen
                 Optimierungsproblemen",
  publisher =    "Springer",
  year =         "1970",
  address =      "Berlin",
  series =       "LN in Operations Research and Mathematical Systems",
  volume =       "30",
  pages =        "102",
}

@Book{mo:Noltemeier:76,
  author =       "H. Noltemeier",
  title =        "Graphentheorie mit Algorithmen und Anwendungen",
  publisher =    "de Gruyter",
  year =         "1976",
  address =      "Berlin/New York",
  pages =        "239",
}

@Book{mo:Noltemeier:88,
  author =       "H. Noltemeier",
  title =        "Computational Geometry and its Applications",
  publisher =    "Springer",
  year =         "1988",
  address =      "Berlin",
  pages =        "252",
}

@Book{mo:NozickaGuddatHollatz:72,
  author =       "F. Nozicka and J. Guddat and H. Hollatz",
  title =        "Theorie der linearen Optimierung",
  publisher =    "Akademie",
  year =         "1972",
  address =      "Berlin",
  series =       "Mathematische Lehrbuecher",
  volume =       "XXI",
  pages =        "378",
}

@Book{mo:NozickaGuddatHollatzBank:74,
  author =       "R. Nozicka and J. Guddat and H. Hollatz and B. Bank",
  title =        "Theorie der linearen parametrischen Optimierung",
  publisher =    "Akademie",
  year =         "1974",
  address =      "Berlin",
  pages =        "312",
}

@Book{mo:OettliRitter:76,
  title =        "Optimization and Operations Research ( Oberwolfach
                 1975 )",
  publisher =    "Springer",
  year =         "1976",
  address =      "Berlin",
  editor =       "W. Oettli and K. Ritter",
  series =       "Lecture Notes in Economics and Mathematical Systems",
  volume =       "117",
  pages =        "316",
}

@Book{mo:OhEigeartaighLenstraRinnooyKan:85,
  title =        "Combinatorial Optimization",
  publisher =    "John Wiley & sons",
  year =         "1985",
  address =      "Chichester/New York",
  editor =       "M. O'hEigeartaigh and J. K. Lenstra and A. H. G.
                 Rinnooy Kan",
  pages =        "204",
}

@Book{mo:Ore:62,
  author =       "O. Ore",
  title =        "Theory of Graphs",
  publisher =    "American Mathematical Society",
  year =         "1962",
  series =       "Colloquium Publications",
  volume =       "XXXVIII",
  pages =        "267",
}

@Book{mo:OrtegaRheinboldt:70,
  author =       "J. M. Ortega and W. G. Rheinboldt",
  title =        "Iterative Solution of Nonlinear Equations in Several
                 Variables",
  publisher =    "Academic Press",
  year =         "1970",
  address =      "New York/Amsterdam",
  pages =        "572",
}

@Book{mo:Osborne:85,
  author =       "M. R. Osborne",
  title =        "Finite Algorithms in Optimization and Data Analysis",
  publisher =    "John Wiley & sons",
  year =         "1985",
  address =      "Chichester",
  pages =        "383",
}

@Book{mo:PageWilson:79,
  author =       "E. S. Page and L. B. Wilson",
  title =        "An Introduction to Computational Combinatorics",
  publisher =    "Cambridge Univ. Press",
  year =         "1979",
  address =      "Cambridge",
  pages =        "218",
}

@Book{mo:Palmer:85,
  author =       "E. M. Palmer",
  title =        "Graphical Evolution",
  publisher =    "John Wiley & sons",
  year =         "1985",
  address =      "New York/Chichester",
  pages =        "177",
}

@Book{mo:PapadimitriouSteiglitz:82,
  author =       "C. H. Papadimitriou and K. Steiglitz",
  title =        "Combinatorial Optimization ( Algorithms and Complexity
                 )",
  publisher =    "Prentice-Hall",
  year =         "1982",
  address =      "New Jersey",
  pages =        "496",
}

@Book{mo:PardalosRosen:87,
  author =       "P. M. Pardalos and J. B. Rosen",
  title =        "Constrained Global Optimization: Algorithms and
                 Applications",
  publisher =    "Springer",
  year =         "1987",
  address =      "Berlin",
  pages =        "143",
}

@Book{mo:ParkerRardin:88,
  author =       "R. Gary Parker and Ronald L. Rardin",
  title =        "Discrete Optimization",
  publisher =    "Academic Press",
  year =         "1988",
  address =      "Boston",
  pages =        "472",
}

@Book{mo:Parker:90,
  author =       "T. Parker",
  title =        "{UNIX} Survival Guide",
  publisher =    "Addison-Wesley",
  year =         "1990",
  address =      "Reading, Ma.",
  pages =        "259",
}

@Book{mo:Pearl:84,
  author =       "J. Pearl",
  title =        "Heuristics: Intelligent Search Strategies for Computer
                 problem Solving",
  publisher =    "Addison-Wesley",
  year =         "1984",
  address =      "Reading",
  pages =        "382",
}

@Book{mo:PeressiniSullivanUhl:88,
  author =       "A. L. Peressini and F. E. Sullivan and J. J. Uhl jr.",
  title =        "The Mathematics of Nonlinear Programming",
  publisher =    "Springer",
  year =         "1988",
  address =      "New York",
  pages =        "269",
}

@Book{mo:Pesch:88,
  author =       "E. Pesch",
  title =        "Retracts of Graphs",
  publisher =    "Athenaeum",
  year =         "1988",
  address =      "Frankfurt a.M.",
  series =       "Mathematical Systems in Economics",
  volume =       "110",
  pages =        "220",
}

@Book{mo:Pfanzagl:88,
  author =       "J. Pfanzagl",
  title =        "Elementare Wahrscheinlichkeitsrechnung",
  publisher =    "de Gruyter",
  year =         "1988",
  address =      "Berlin",
  pages =        "313",
}

@Book{mo:Piehler:83,
  author =       "J. Piehler",
  title =        "Algebraische Methoden in der ganzzahligen
                 Optimierung",
  publisher =    "Teubner",
  year =         "1983",
  address =      "Leipzig",
  series =       "Teubner-Texte zur Mathematik",
  volume =       "51",
  pages =        "99",
}

@Book{mo:Pissanetzky:84,
  author =       "S. Pissanetzky",
  title =        "Sparse Matrix Technology",
  publisher =    "Academic Press",
  year =         "1984",
  pages =        "321",
}

@Book{mo:PohstZassenhaus:89,
  author =       "M. Pohst and H. Zassenhaus",
  title =        "Algorithmic Algebraic Number Theory",
  publisher =    "Cambridge University Press",
  year =         "1989",
  address =      "Cambridge",
  pages =        "465 p.",
}

@Book{mo:Polak:71,
  author =       "Polak",
  title =        "Computational Methods in Optimization: {A} Unified
                 Approach",
  publisher =    "Academic Press",
  year =         "1971",
  address =      "New York/London",
  series =       "Mathematics in Science and Engineering",
  volume =       "77",
  pages =        "329",
}

@Book{mo:PolyaTarjanWoods:83,
  author =       "G. Polya and R. E. Tarjan and D. R. Woods",
  title =        "Notes on Introductory Combinatorics",
  publisher =    "Birkhaeuser",
  year =         "1983",
  address =      "Boston/Basel/Stuttgart",
  series =       "Progress in Computer Science",
  volume =       "4",
  pages =        "202",
}

@Book{mo:PosthoffBochmannHaubold:86,
  author =       "C. Posthoff and D. Bochmann and K. Haubold",
  title =        "Diskrete Mathematik",
  publisher =    "Teubner",
  year =         "1986",
  address =      "Leipzig",
  series =       "Mathematisch-Naturwissenschaftliche Bibliothek",
  volume =       "70",
  pages =        "248",
}

@Book{mo:PreparataShamos:85,
  author =       "F. P. Preparata and M. I. Shamos",
  title =        "Computational Geometry",
  publisher =    "Springer",
  year =         "1985",
  address =      "New York",
  pages =        "390",
}

@Book{mo:PressFlanneryTeukolskyVetterling:86,
  author =       "W. H. Press and B. P. Flannery and S. A. Teukolsky and
                 W. T. Vetterling",
  title =        "Numerical Recipes",
  publisher =    "Cambridge University Press",
  year =         "1986",
  address =      "Cambridge/London",
  pages =        "818",
}

@Book{mo:Press:90,
  author =       "W. H. Press",
  title =        "Numerical Recipes in {C}",
  publisher =    "Cambridge University Press",
  year =         "1990",
  address =      "Cambridge",
  pages =        "735",
}

@Book{mo:Press:92,
  author =       "W. H. Press",
  title =        "Numerical Recipes in {C}",
  publisher =    "Cambridge University Press",
  year =         "1992",
  address =      "Cambridge",
  edition =      "second",
  pages =        "994",
}

@Book{mo:Pschenitschny:72,
  author =       "B. N. Pschenitschny",
  title =        "Notwendige Optimalitaetsbedingungen",
  publisher =    "Oldenbourg",
  year =         "1972",
  address =      "Muenchen/Wien",
  pages =        "152",
}

@Book{mo:Pulleyblank:84,
  author =       "W. R. Pulleyblank",
  title =        "Progress in Combinatorial Optimization",
  publisher =    "Academic Press",
  year =         "1984",
  pages =        "374",
}

@Book{mo:PunKindlerHinkel:74,
  title =        "Abriss der Optimierungspraxis",
  publisher =    "Oldenbourg",
  year =         "1974",
  address =      "Muenchen/Wien",
  editor =       "L. Pun and E.-H. H. Kindler and H. Hinkel",
  pages =        "307",
}

@Book{mo:Ralston:71,
  author =       "A. Ralston",
  title =        "Introduction to Programming and Computer Science",
  publisher =    "McGraw-Hill",
  year =         "1971",
  pages =        "511",
}

@Book{mo:Randow:75,
  author =       "R. von Randow",
  title =        "Introduction to the Theory of Matroids",
  publisher =    "Springer",
  year =         "1975",
  address =      "Berlin",
  series =       "LN in Economics and Mathematical Systems",
  volume =       "109",
  pages =        "102",
}

@Book{mo:Randow:82,
  title =        "Integer Programming and Related Areas: {A} Classified
                 Bibliography 1978 - 1981",
  publisher =    "Springer",
  year =         "1982",
  address =      "Berlin",
  editor =       "R. von Randow",
  series =       "LN in Economics and Mathematical Systems",
  volume =       "197",
  pages =        "338",
}

@Book{mo:Randow:85,
  title =        "Integer Programming and Related Areas: {A} Classified
                 Bibliography 1981-1984",
  publisher =    "Springer",
  year =         "1985",
  address =      "Berlin",
  editor =       "R. von Randow",
  series =       "LN in Economics and Mathematical Systems",
  volume =       "243",
  pages =        "386",
}

@Book{mo:Randow:90,
  title =        "Integer Programming and Related Areas",
  publisher =    "Springer",
  year =         "1990",
  address =      "Berlin",
  editor =       "R. von Randow",
  pages =        "514",
}

@Book{mo:RatschekRokne:84,
  author =       "H. Ratschek and J. Rokne",
  title =        "Computer Methods for the Range of Functions",
  publisher =    "Ellis Horwood Ltd.",
  year =         "1984",
  address =      "Chichester",
  pages =        "168",
}

@Book{mo:RatschekRokne:88,
  author =       "H. Ratschek and J. Rokne",
  title =        "New Computer Methods for Global Optimization",
  publisher =    "Ellis Horwood Ltd.",
  year =         "1988",
  address =      "Chichester",
  pages =        "229",
}

@Book{mo:RauhutSchmitzZachow:79,
  author =       "B. Rauhut and N. Schmitz and E.-W. Zachow",
  title =        "Spieltheorie",
  publisher =    "Teubner",
  year =         "1979",
  address =      "Stuttgart",
  series =       "LAMM",
  volume =       "49",
  pages =        "400",
}

@Book{mo:Rayna:87,
  author =       "G. Rayna",
  title =        "Reduce",
  publisher =    "Springer",
  year =         "1987",
  address =      "Berlin",
  pages =        "329",
}

@Book{mo:Recht:86,
  author =       "P. Recht",
  title =        "Hacijan-Shor Methods and Quadratic Optimization",
  publisher =    "Hain",
  year =         "1986",
  address =      "Frankfurt a.M.",
  series =       "Mathematical Systems in Economics",
  volume =       "105",
  pages =        "100",
}

@Book{mo:Recski:89,
  author =       "A. Recski",
  title =        "Matroid Theory and its Applications in Electric
                 Network Theory and in Statics",
  publisher =    "Springer",
  year =         "1989",
  address =      "Berlin",
  pages =        "531",
}

@Book{mo:ReingoldNievergeltDeo:77,
  author =       "E. M. Reingold and J. Nievergelt and N. Deo",
  title =        "Combinatorial Algorithms: Theory and Practice",
  publisher =    "Prentice-Hall",
  year =         "1977",
  address =      "Englewood Cliffs, NJ",
  pages =        "433",
}

@Book{mo:Reichmeider:84,
  author =       "P. F. Reichmeider",
  title =        "The Equivalence of Some Combinatorial Matching
                 Theorems",
  publisher =    "Polygonal Publishing House",
  year =         "1984",
  address =      "Washington",
  pages =        "117",
}

@Book{mo:Reiter:86,
  author =       "S. Reiter",
  title =        "Studies in Mathematical Economics",
  publisher =    "Mathe. Association of America",
  year =         "1986",
  address =      "USA",
  pages =        "441",
}

@Book{mo:Rheinbold:86,
  author =       "W. Rheinboldt",
  title =        "Numerical Analysis of Parametrized Nonlinear
                 Equations",
  publisher =    "John Wiley & sons",
  year =         "1986",
  address =      "New York",
  pages =        "299",
}

@Book{mo:Rice:83,
  author =       "J. Rice",
  title =        "Numerical Methods, Software and Analysis",
  publisher =    "McGraw-Hill",
  year =         "1983",
  pages =        "483",
}

@Book{mo:Rice:85,
  author =       "J. R. Rice",
  title =        "Matrix Computations \& Mathematical Software",
  publisher =    "McGraw-Hill",
  year =         "1985",
  address =      "Hamburg",
  pages =        "248",
}

@Book{mo:RingeisenRoberts:88,
  author =       "R. D. Ringeisen and F. S. Roberts",
  title =        "Applications of Discrete Mathematics",
  publisher =    "SIAM",
  year =         "1988",
  address =      "Philadelphia",
  pages =        "230",
}

@Book{mo:Rival:82,
  author =       "I. Rival",
  title =        "Ordered Sets",
  publisher =    "Reidel",
  year =         "1982",
  address =      "Dordrecht/Boston/London",
  pages =        "966",
}

@Book{mo:RobinsonFoulds:80,
  author =       "D. F. Robinson and L. R. Foulds",
  title =        "Digraphs: Theory and Techniques",
  publisher =    "Gordon and Breach",
  year =         "1980",
  address =      "New York/London",
  pages =        "256",
}

@Book{mo:Roberts:84,
  author =       "F. S. Roberts",
  title =        "Applied Combinatorics",
  publisher =    "Prentice-Hall",
  year =         "1984",
  pages =        "606",
}

@Book{mo:Robertson:84,
  author =       "S. A. Robertson",
  title =        "Polytopes and Symmetry",
  publisher =    "Cambridge University Press",
  year =         "1984",
  address =      "Cambridge",
  series =       "London Mathematical Society Lecture Note Series",
  volume =       "90",
  pages =        "112",
}

@Book{mo:Robert:86,
  author =       "F. Robert",
  title =        "Discrete Iterations, {A} Metric Study",
  publisher =    "Springer",
  year =         "1986",
  address =      "Berlin",
  pages =        "195",
}

@Book{mo:Rockafellar:74,
  author =       "R. T. Rockafellar",
  title =        "Conjugate Duality and Optimization",
  publisher =    "Society for Industrial and Appl. Mathematics",
  year =         "1974",
  address =      "Philadelphia",
}

@Book{mo:Rockafellar:84,
  author =       "R. T. Rockafellar",
  title =        "Network Flows and Monotropic Optimization",
  publisher =    "John Wiley & sons",
  year =         "1984",
  address =      "New York",
  pages =        "616",
}

@Book{mo:Rodrigue:82,
  author =       "G. Rodrigue",
  title =        "Parallel Computations",
  publisher =    "Academic Press",
  year =         "1982",
  pages =        "403",
}

@Book{mo:RossSheldon:83,
  author =       "M. Ross and Sheldon",
  title =        "Introduction to Stochastic Dynamic Programming",
  publisher =    "Academic Press",
  year =         "1983",
  pages =        "164",
}

@Book{mo:Roy:69,
  author =       "B. Roy",
  title =        "algebre moderne et theorie des graphes (tome 1)",
  publisher =    "Dunod",
  year =         "1969",
  address =      "Paris",
  pages =        "502",
}

@Book{mo:Roy:75,
  author =       "B. Roy",
  title =        "Combinatorial Programming: Methods and Applications",
  publisher =    "Reidel",
  year =         "1975",
  address =      "Dordrecht/Boston",
  pages =        "386",
}

@Book{mo:Rubbe:84,
  author =       "T. Rubbe",
  title =        "Geometrische Programmierung",
  publisher =    "Deutsch",
  year =         "1984",
  address =      "Frankfurt a.M.",
  pages =        "304",
}

@Book{mo:Ruhe:91,
  author =       "Guenther Ruhe",
  title =        "Algorithmic Aspects of Flows in Networks",
  publisher =    "Kluwer",
  year =         "1991",
  address =      "Dordrecht",
  pages =        "203",
}

@Book{mo:Ryser:63,
  author =       "H. J. Ryser",
  title =        "Combinatorial Mathematics",
  publisher =    "John Wiley & sons",
  year =         "1963",
  pages =        "154",
}

@Book{mo:Sachs:85,
  author =       "H. Sachs",
  title =        "Graphs, Hypergraphs and Applications",
  publisher =    "Teubner",
  year =         "1985",
  address =      "Leipzig",
  series =       "Teubner-Texte zur Mathematik Band",
  volume =       "73",
  pages =        "224",
}

@Book{mo:SalkinMathur:89,
  author =       "H. M. Salkin and K. Mathur",
  title =        "Foundations for Integer Programming",
  publisher =    "North-Holland",
  year =         "1989",
  address =      "New York",
  pages =        "755",
}

@Book{mo:SavePrager:85,
  author =       "M. Save and W. Prager",
  title =        "Structural Optimization. Vol.1: Optimality Criteria",
  publisher =    "Plenum Press",
  year =         "1985",
  address =      "New York",
  pages =        "334",
}

@Book{mo:SavePrager:90,
  author =       "M. Save and W. Prager",
  title =        "Structural Optimization. Vol. 2: Mathematical
                 Programming",
  publisher =    "Plenum Press",
  year =         "1990",
  address =      "New York",
  pages =        "398",
}

@Book{mo:Schwefel:77,
  author =       "H.-P. Schwefel",
  title =        "Numerische Optimierung von Computer-Modellen mittels
                 der Evolutionstrategie",
  publisher =    "Birkhaeuser",
  year =         "1977",
  address =      "Basel/Stuttgart",
  series =       "ISR",
  volume =       "26",
  pages =        "390",
}

@Book{mo:Schrijver:78,
  author =       "A. Schrijver",
  title =        "Matroids and Linking Systems",
  publisher =    "Mathematisch Centrum",
  year =         "1978",
  address =      "Amsterdam",
  series =       "Mathematical Centre Tracts",
  volume =       "88",
  pages =        "125",
}

@Book{mo:Schwarz:80,
  author =       "H. R. Schwarz",
  title =        "Methode der finiten Elemente",
  publisher =    "Teubner",
  year =         "1980",
  address =      "Stuttgart",
  pages =        "320",
}

@Book{mo:Schendel:81,
  author =       "U. Schendel",
  title =        "Einfuehrung in die parallele Numerik",
  publisher =    "Oldenbourg",
  year =         "1981",
  address =      "Muenchen/Wien",
  pages =        "126",
}

@Book{mo:Schoenberg:82,
  author =       "I. J. Schoenberg",
  title =        "Mathematical Time Exposures",
  publisher =    "The Mathematical Ass. of America",
  year =         "1982",
  address =      "USA",
  pages =        "267",
}

@Book{mo:Schrijver:82,
  author =       "A. Schrijver",
  title =        "Packing and Covering in Combinatorics",
  publisher =    "Mathematisch Centrum",
  year =         "1982",
  address =      "Amsterdam",
  series =       "Mathematical Centre Tracts",
  volume =       "106",
  pages =        "313",
}

@Book{mo:Schrijver:86,
  author =       "A. Schrijver",
  title =        "Theory of Linear and Integer Programming",
  publisher =    "John Wiley & sons",
  year =         "1986",
  address =      "Chichester/New York",
  pages =        "471",
}

@Book{mo:Schwarz:86,
  author =       "H. R. Schwarz",
  title =        "Numerische Mathematik",
  publisher =    "Teubner",
  year =         "1986",
  address =      "Stuttgart",
  pages =        "496",
}

@Book{mo:Schittkowski:87,
  author =       "K. Schittkowski",
  title =        "More Test Examples for Nonlinear Programming Codes",
  publisher =    "Springer",
  year =         "1987",
  address =      "Berlin",
  series =       "Lecture Notes in Economics and Mathematical Systems",
  volume =       "282",
  pages =        "261",
}

@Book{mo:SchaarSonntagTeichert:88,
  author =       "G. Schaar and M. Sonntag and H.-M. Teichert",
  title =        "Hamiltonian Properties of Products of Graphs and
                 Digraphs",
  publisher =    "Teubner",
  year =         "1988",
  address =      "Leipzig",
  series =       "Teubner-Texte zur Mathematik",
  volume =       "108",
  pages =        "148",
}

@Book{mo:Scharlau:90,
  author =       "W. Scharlau",
  title =        "Mathematische Institute in Deutschland 1800 - 1945",
  publisher =    "Vieweg",
  year =         "1990",
  address =      "Braunschweig",
  pages =        "291",
}

@Book{mo:Schroeder:90,
  author =       "R. Schroeder",
  title =        "Numerik-Praktikum mit {VISU}",
  publisher =    "Vieweg",
  year =         "1990",
  address =      "Braunschweig",
  pages =        "179",
}

@Book{mo:SebastianSieber:81,
  author =       "H.-J. Sebastian and N. Sieber",
  title =        "Diskrete Dynamische Optimierung",
  publisher =    "Geest \& Portig",
  year =         "1981",
  address =      "Leipzig",
  pages =        "272",
}

@Book{mo:Sedgewick:83,
  author =       "R. Sedgewick",
  title =        "Algorithms",
  publisher =    "Addison-Wesley",
  year =         "1983",
  address =      "Reading, Mass.",
  pages =        "551",
}

@Book{mo:SeierstadSydsaeter:87,
  author =       "A. Seierstad and K. Sydsaeter",
  title =        "Optimal Control Theory with Economic Applications",
  publisher =    "North-Holland",
  year =         "1987",
  address =      "Amsterdam",
  pages =        "445",
}

@Book{mo:Sengupta:81,
  author =       "J. K. Sengupta",
  title =        "Optimal Decisions under Uncertainty",
  publisher =    "Springer",
  year =         "1981",
  address =      "Berlin/New York",
  series =       "Lecture Notes in Economics and Mathematical Systems",
  volume =       "193",
  pages =        "156",
}

@Book{mo:Sewell:87,
  author =       "M. J. Sewell",
  title =        "Maximum and minimum principles",
  publisher =    "Cambridge University Press",
  year =         "1987",
  address =      "Cambridge",
  pages =        "468",
}

@Book{mo:Shapiro:79,
  author =       "J. S. Shapiro",
  title =        "Mathematical Programming: Structures and Algorithms",
  publisher =    "John Wiley & sons",
  year =         "1979",
  address =      "New York/Chichester",
  pages =        "388",
}

@Book{mo:Shapiro:84,
  author =       "R. D. Shapiro",
  title =        "Optimization Models for Planing and Allocation: Text
                 and Cases in Math. Programming",
  publisher =    "John Wiley & sons",
  year =         "1984",
  address =      "New York/Chichester",
  pages =        "650",
}

@Book{mo:SheraliShetty:80,
  author =       "H. D. Sherali and C. M. Shetty",
  title =        "Optimization with Disjunctive Constraints.",
  publisher =    "Springer",
  year =         "1980",
  address =      "Berlin",
  series =       "Lecture Notes in Economics and Mathematical Systems",
  volume =       "181",
  pages =        "156",
}

@Book{mo:Shier:91,
  author =       "D. R. Shier",
  title =        "Network Reliability and Algebraic Structures",
  publisher =    "Clarendon Press",
  year =         "1991",
  address =      "Oxford",
  pages =        "144",
}

@Book{mo:Shor:85,
  author =       "N. U. Shor",
  title =        "Minimization Methods for Non-Differentiable
                 Functions",
  publisher =    "Springer",
  year =         "1985",
  address =      "Berlin",
  series =       "Springer Series in Computational Mathematics",
  volume =       "3",
  pages =        "162",
}

@Book{mo:Sillescu:92,
  author =       "Daniel Sillescu",
  title =        "WordPerfect fuer Windows",
  publisher =    "Markt-und-Technik",
  year =         "1992",
  address =      "Haar",
  pages =        "674",
}

@Book{mo:Simeone:89,
  author =       "B. Simeone",
  title =        "Combinatorial Optimization",
  publisher =    "Springer",
  year =         "1989",
  address =      "Berlin",
  pages =        "312",
}

@Book{mo:Simon:92,
  author =       "K. Simon",
  title =        "Effiziente Algorithmen fuer perfekte Graphen",
  publisher =    "Teubner",
  year =         "1992",
  address =      "Stuttgart",
  pages =        "286",
}

@Book{mo:Skiena:90,
  author =       "S. Skiena",
  title =        "Implementing Discrete Mathematics",
  publisher =    "Addison-Wesley",
  year =         "1990",
  address =      "Redwood City",
  pages =        "334",
}

@Book{mo:SmithBoyleGarbowKlemaMoler:74,
  author =       "B. T. Smith and J. M. Boyle and Y. I. Garbow and V. C.
                 Klema and C. B. Moler",
  title =        "Matrix Eigensystem Routines - {EISPACK} Guide",
  publisher =    "Springer",
  year =         "1974",
  address =      "Berlin/New York",
  series =       "Lecture Notes in Computer Science",
  volume =       "6",
  pages =        "387",
}

@Book{mo:Smith:82,
  author =       "D. K. Smith",
  title =        "Network Optimization Practice. ({A} Computational
                 Guide)",
  publisher =    "John Wiley & sons",
  year =         "1982",
  address =      "New York",
  pages =        "237",
}

@Book{mo:Solow:84,
  author =       "D. Solow",
  title =        "Linear Programming: An Introduction to Finite
                 Improvement Algorithms",
  publisher =    "North-Holland",
  year =         "1984",
  address =      "Amsterdam",
  pages =        "392",
}

@Book{mo:Spellucci:93,
  author =       "Peter Spellucci",
  title =        "Numerische Verfahren der nichtlinearen Optimierung",
  publisher =    "Birkhaeuser",
  year =         "1993",
  address =      "Basel",
  pages =        "556",
}

@Book{mo:Stanley:83,
  author =       "R. P. Stanley",
  title =        "Combinatorics and Commutative Algebra",
  publisher =    "Birkhaeuser",
  year =         "1983",
  address =      "Boston/Basel/Stuttgart",
  series =       "Progress in Mathematics",
  volume =       "41",
  pages =        "88",
}

@Book{mo:StantonWhite:86,
  author =       "D. Stanton and D. White",
  title =        "Constructive Combinatorics",
  publisher =    "Springer",
  year =         "1986",
  address =      "New York",
  pages =        "183",
}

@Book{mo:SteinitzRademacher:76,
  author =       "E. Steinitz and H. Rademacher",
  title =        "Vorlesungen ueber die Theorie der Polyeder",
  publisher =    "Springer",
  year =         "1976",
  address =      "Berlin",
  pages =        "351",
}

@Book{mo:SteinhausenLanger:77,
  author =       "D. Steinhausen and K. Langer",
  title =        "Clusteranalyse",
  publisher =    "de Gruyter",
  year =         "1977",
  address =      "Berlin/New York",
  pages =        "206",
}

@Book{mo:Stengel:86,
  author =       "R. F. Stengel",
  title =        "Stochastic Optimal Control. Theory and Applications",
  publisher =    "John Wiley & sons",
  year =         "1986",
  address =      "New York",
  pages =        "638",
}

@Book{mo:Steuer:86,
  author =       "R. E. Steuer",
  title =        "Multiple Criteria Optimization: Theory, Computation,
                 and Application",
  publisher =    "John Wiley & sons",
  year =         "1986",
  address =      "New York",
  pages =        "546",
}

@Book{mo:StoerWitzgall:70,
  author =       "J. Stoer and C. Witzgall",
  title =        "Convexity and Optimization in Finite Dimensions {I}",
  publisher =    "Springer",
  year =         "1970",
  address =      "Berlin",
  series =       "Die Grundlehren der mathematischen Wissenschaften",
  volume =       "163",
  pages =        "293",
}

@Book{mo:StoerBulirsch:80,
  author =       "J. Stoer and R. Bulirsch",
  title =        "Introduction to Numerical Analysis",
  publisher =    "Springer",
  year =         "1980",
  address =      "New York",
  pages =        "609",
}

@Book{mo:Stoer:89,
  author =       "J. Stoer",
  title =        "Einfuehrung in die Numerische Mathematik {I}",
  publisher =    "Springer",
  year =         "1989",
  address =      "Berlin",
  pages =        "314",
}

@Book{mo:StoerBulirsch:90,
  author =       "J. Stoer and R. Bulirsch",
  title =        "Einfuehrung in die Numerische Mathematik {II}",
  publisher =    "Springer",
  year =         "1990",
  address =      "Berlin",
  edition =      "dritte",
  pages =        "341",
}

@Book{mo:Strang:86,
  author =       "G. Strang",
  title =        "Introduction to Applied Mathematics",
  publisher =    "Wellesley-Cambridge Press",
  year =         "1986",
  address =      "Wellesley",
  pages =        "758",
}

@Book{mo:Strang:88,
  author =       "G. Strang",
  title =        "Linear Algebra and its Applications",
  publisher =    "Harcourt Brace Jovanovich",
  year =         "1988",
  address =      "San Diego",
  pages =        "505",
}

@Book{mo:SwamyThulasiraman:81,
  author =       "M. N. S. Swamy and K. Thulasiraman",
  title =        "Graphs, Networks, and Algorithms",
  publisher =    "John Wiley & sons",
  year =         "1981",
  address =      "Chichester",
  pages =        "592",
}

@Book{mo:Swan:86,
  author =       "T. Swan",
  title =        "Mastering Turbo Pascal",
  publisher =    "Hayden Book Company",
  year =         "1986",
  address =      "New Jersey",
  pages =        "450",
}

@Book{mo:SysloDeoKowalik:83,
  author =       "M. M. Syslo and M. Deo and J. S. Kowalik",
  title =        "Discrete Optimization Algorithms ( with Pascal
                 Programs )",
  publisher =    "Prentice-Hall",
  year =         "1983",
  pages =        "542",
}

@Book{mo:Talman:80,
  author =       "A. J. J. Talman",
  title =        "Variable Dimension fixed Point Algorithms and
                 Triangulations",
  publisher =    "Mathematical Centre",
  year =         "1980",
  address =      "Amsterdam",
  pages =        "172",
}

@Book{mo:Tarjan:83,
  author =       "R. E. Tarjan",
  title =        "Data Structures and Network Algorithms",
  publisher =    "SIAM",
  year =         "1983",
  address =      "Philadelphia",
  pages =        "131",
}

@Book{mo:Terno:81,
  author =       "J. Terno",
  title =        "Numerische Verfahren der diskreten Optimierung",
  publisher =    "Teubner",
  year =         "1981",
  address =      "Leipzig",
  series =       "Teubner-Texte zur Mathematik",
  volume =       "36",
  pages =        "168",
}

@Book{mo:TernoLindemannScheithauer:87,
  author =       "J. Terno and R. Lindemann and G. Scheithauer",
  title =        "Zuschnittprobleme und ihre praktische Loesung",
  publisher =    "Deutsch",
  year =         "1987",
  address =      "Thun",
  pages =        "207",
}

@Book{mo:Tewarson:73,
  author =       "R. P. Tewarson",
  title =        "Sparse matrices",
  publisher =    "Academic Press",
  year =         "1973",
  address =      "New York/London",
  series =       "Mathematics in science and engineering",
  volume =       "99",
  pages =        "160",
}

@Book{mo:TheOpenUniversity:81,
  author =       "The Open University",
  title =        "Graphs and Digraphs",
  publisher =    "The Open University Press",
  year =         "1981",
  address =      "Milton Keynes",
  pages =        "54",
}

@Book{mo:Thomas:86,
  author =       "L. C. Thomas",
  title =        "Games, Theory and Applications",
  publisher =    "Ellis Horwood Ltd.",
  year =         "1986",
  address =      "Chichester",
  pages =        "279",
}

@Book{mo:Tikhomirov:90,
  author =       "V. M. Tikhomirov",
  title =        "Stories about Maxima and Minima",
  publisher =    "American Mathematical Society",
  year =         "1990",
  pages =        "187",
}

@Book{mo:Tinhofer:76,
  author =       "G. Tinhofer",
  title =        "Methoden der angewandten Graphentheorie",
  publisher =    "Springer",
  year =         "1976",
  address =      "Wien",
  pages =        "236",
}

@Book{mo:TinhoferMayr:90,
  author =       "G. Tinhofer and H. Mayr",
  title =        "Computational Graph Theory",
  publisher =    "Springer",
  year =         "1990",
  address =      "Wien",
  pages =        "282",
}

@Book{mo:Todd:76,
  author =       "M. J. Todd",
  title =        "The Computation of Fixed Points and Applications",
  publisher =    "Springer",
  year =         "1976",
  address =      "Berlin/New York",
  series =       "Lecture Notes in Economics and Mathematical Systems",
  volume =       "124",
  pages =        "129",
}

@Book{mo:TomescuMelter:85,
  author =       "I. Tomescu and R. A. Melter",
  title =        "Problems in Combinatorics and Graph Theory",
  publisher =    "John Wiley & sons",
  year =         "1985",
  address =      "New York/Chichester",
  pages =        "335",
}

@Book{mo:ToernZilinskas:89,
  author =       "A. Toern and A. Zilinskas",
  title =        "Global Optimization",
  publisher =    "Springer",
  year =         "1989",
  address =      "Berlin",
  pages =        "255",
}

@Book{mo:Townsend:87,
  author =       "M. Townsend",
  title =        "Discrete Mathematics: Applied Combinatorics and Graph
                 Theory",
  publisher =    "Benjamin Cummings",
  year =         "1987",
  address =      "Menlo Park",
  pages =        "387",
}

@Book{mo:Traub:73,
  author =       "J. E. Traub",
  title =        "Complexity of Sequential and Parallel Numerical
                 Algorithms",
  publisher =    "Academic Press",
  year =         "1973",
  address =      "New York/London",
  pages =        "300",
}

@Book{mo:Traub:76,
  author =       "J. F. Traub",
  title =        "Algorithms and Complexity: New Directions and Recent
                 Results",
  publisher =    "Academic Press",
  year =         "1976",
  address =      "New York/London",
  pages =        "523",
}

@Book{mo:TremblayManohar:75,
  author =       "J. P. Tremblay and R. Manohar",
  title =        "Discrete Mathematical Structures with Applications to
                 Computer Science",
  publisher =    "McGraw Hill",
  year =         "1975",
  address =      "New York",
  pages =        "606",
}

@Book{mo:Trinkaus:88,
  author =       "H. L. Trinkaus",
  title =        "Probleme? Hoehere Mathematik! Eine Aufgabensammlung
                 zur Analysis, Vektor- und Matrizenrechnung",
  publisher =    "Springer",
  year =         "1988",
  address =      "Berlin",
  pages =        "339",
}

@Book{mo:Tucker:84,
  author =       "A. Tucker",
  title =        "Applied Combinatorics",
  publisher =    "John Wiley & sons",
  year =         "1984",
  address =      "New York/Chichester",
  pages =        "447",
}

@Book{mo:Tutte:66,
  author =       "W. T. Tutte",
  title =        "Connectivity in Graphs",
  publisher =    "University of Toronto Press",
  year =         "1966",
  pages =        "145",
}

@Book{mo:Tutte:84,
  author =       "W. T. Tutte",
  title =        "Graph Theory",
  publisher =    "Addison-Wesley",
  year =         "1984",
  address =      "Reading/Amsterdam",
  pages =        "333",
}

@Book{mo:Vajda:72,
  author =       "S. Vajda",
  title =        "Probabilistic Programming.",
  publisher =    "Academic Press",
  year =         "1972",
  address =      "New York",
  pages =        "127",
}

@Book{mo:Varga:62,
  author =       "R. S. Varga",
  title =        "Matrix Iterative Analysis",
  publisher =    "Prentice-Hall",
  year =         "1962",
  address =      "New Jersey",
  pages =        "332",
}

@Book{mo:VetterlingPress:85,
  author =       "W. T. Vetterling and W. H. Press",
  title =        "Numerical Recipes: Example Book (Fortran)",
  publisher =    "Cambridge University Press",
  year =         "1985",
  address =      "Cambridge/London",
  pages =        "179",
}

@Book{mo:Vetterling:90,
  author =       "W. H. Vetterling",
  title =        "Numerical Recipes. Example Book ({C})",
  publisher =    "Cambridge University Press",
  year =         "1990",
  address =      "Cambridge",
  pages =        "239",
}

@Book{mo:Vetterling:92,
  author =       "W. T. Vetterling",
  title =        "Numerical Recipes. Example Book ({C})",
  publisher =    "Cambridge University Press",
  year =         "1992",
  address =      "Cambridge",
  edition =      "second",
  pages =        "325",
}

@Book{mo:Vorobev:77,
  author =       "N. N. Vorobev",
  title =        "Game Theory. Lectures for Economists and Systems
                 Scientists",
  publisher =    "Springer",
  year =         "1977",
  address =      "New York",
  pages =        "178",
}

@Book{mo:Wagner:70,
  author =       "K. Wagner",
  title =        "Graphentheorie",
  publisher =    "BI",
  year =         "1970",
  address =      "Mannheim",
  series =       "BI Hochschultaschenbuecher",
  volume =       "248/248a",
  pages =        "220",
}

@Book{mo:WagnerBodendiek:89,
  author =       "K. Wagner and R. Bodendiek",
  title =        "Graphentheorie, Bd 1: Anwendung auf Topologie, ...",
  publisher =    "BI",
  year =         "1989",
  address =      "Mannheim",
  pages =        "252",
}

@Book{mo:WagnerBodendiek:90,
  author =       "K. Wagner and R. Bodendiek",
  title =        "Graphentheorie, Bd 2: Weitere Methoden, Masse-Graphen,
                 ...",
  publisher =    "BI",
  year =         "1990",
  address =      "Mannheim",
  pages =        "356",
}

@Book{mo:Walsh:75,
  author =       "G. R. Walsh",
  title =        "Methods of Optimization",
  publisher =    "John Wiley & sons",
  year =         "1975",
  address =      "Chichester",
  pages =        "200",
}

@Book{mo:Walther:79,
  author =       "H. Walther",
  title =        "Anwendungen der Graphentheorie",
  publisher =    "Vieweg",
  year =         "1979",
  address =      "Braunschweig",
  pages =        "239",
}

@Book{mo:Wallace:89,
  author =       "S. W. Wallace",
  title =        "Algorithms and Model Formulations in Mathematical
                 Programming",
  publisher =    "Springer",
  year =         "1989",
  address =      "Berlin",
  pages =        "191",
}

@Book{mo:Walter:90,
  author =       "W. Walter",
  title =        "Gewoehnliche Differentialgleichungen",
  publisher =    "Springer",
  year =         "1990",
  address =      "Berlin",
  pages =        "236",
}

@Book{mo:Walukiewicz:90,
  author =       "St. Walukiewicz",
  title =        "Integer Programming",
  publisher =    "Kluwer",
  year =         "1990",
  address =      "Dordrecht",
  pages =        "182",
}

@Book{mo:Wegener:89,
  author =       "I. Wegener",
  title =        "Effiziente Algorithmen fuer grundlegende Funktionen",
  publisher =    "Teubner",
  year =         "1989",
  address =      "Stuttgart",
  pages =        "261",
}

@Book{mo:Wehnes:91,
  author =       "H. Wehnes",
  title =        "{FORTRAN} 7",
  publisher =    "Hanser",
  year =         "1991",
  address =      "Muenchen",
  pages =        "279",
}

@Book{mo:Welsh:76,
  author =       "D. J. A. Welsh",
  title =        "Matroid Theory",
  publisher =    "Academic Press",
  year =         "1976",
  pages =        "433",
}

@Book{mo:Werner:84,
  author =       "Werner",
  title =        "Optimization Theory and Applications",
  publisher =    "Vieweg",
  year =         "1984",
  address =      "Braunschweig",
  pages =        "233",
}

@Book{mo:Wets:76,
  author =       "R. Wets",
  title =        "Grundlagen Konvexer Optimierung",
  publisher =    "Springer",
  year =         "1976",
  address =      "Berlin",
  series =       "Lecture Notes in Economic and Mathematical Systems",
  volume =       "137",
  pages =        "146",
}

@Book{mo:White:69,
  author =       "D. J. White",
  title =        "Dynamic Programming",
  publisher =    "Oliver \& Boyd Ltd.",
  year =         "1969",
  address =      "San Francisco, CA",
  pages =        "180",
}

@Book{mo:Whitaker:84,
  author =       "D. Whitaker",
  title =        "{OR} on the Micro",
  publisher =    "John Wiley & sons",
  year =         "1984",
  address =      "Chichester/New York",
  pages =        "197",
}

@Book{mo:White:86,
  author =       "N. White",
  title =        "Theory of Matroids",
  publisher =    "Cambridge University Press",
  year =         "1986",
  address =      "Cambridge/London",
  pages =        "316",
}

@Book{mo:White:87,
  author =       "N. White",
  title =        "Combinatorial Geometries",
  publisher =    "Cambridge University Press",
  year =         "1987",
  address =      "Cambridge",
  pages =        "212",
}

@Book{mo:Wiedey:82,
  author =       "H. Wiedey",
  title =        "Tourenplanung bei grosser Kundenzahl",
  publisher =    "Kieler Wissenschaf.-Verl. Vauk",
  year =         "1982",
  address =      "Kiel",
}

@Book{mo:Wiedermann:87,
  author =       "J. Wiedermann",
  title =        "Searching Algorithms",
  publisher =    "Teubner",
  year =         "1987",
  address =      "Leipzig",
  series =       "Teubner-Texte zur Mathematik",
  volume =       "99",
  pages =        "123",
}

@Book{mo:WilkinsonReinsch:71,
  author =       "J. H. Wilkinson and C. Reinsch",
  title =        "Handbook for Automatic Computation. 2. Linear
                 Algebra",
  publisher =    "Springer",
  year =         "1971",
  address =      "Berlin",
  series =       "Grundlehren der mathem. Wissenschaften in
                 Einzeldarstellungen",
  volume =       "186",
  pages =        "439",
}

@Book{mo:Wilson:76,
  author =       "R. J. Wilson",
  title =        "Einfuehrung in die Graphentheorie",
  publisher =    "Vandenhoeck \& Ruprecht",
  year =         "1976",
  address =      "Goettingen",
  pages =        "174",
}

@Book{mo:Wilf:89,
  author =       "H. S. Wilf",
  title =        "Combinatorial Algorithms: An Update",
  publisher =    "Soc. for Industrial and Appl. Mathematics",
  year =         "1989",
  address =      "Philadelphia",
  pages =        "47",
}

@Book{mo:Wimp:84,
  author =       "J. Wimp",
  title =        "Computation with Recurrence Relations",
  publisher =    "Pitman Publishing",
  year =         "1984",
  address =      "Boston/London",
  pages =        "310",
}

@Book{mo:Winograd:80,
  author =       "S. Winograd",
  title =        "Arithmetic Complexity of Computations",
  publisher =    "SIAM",
  year =         "1980",
  address =      "Philadelphia",
  pages =        "93",
}

@Book{mo:Wirth:86,
  author =       "N. Wirth",
  title =        "Algorithmen und Datenstrukturen mit Modula - 2",
  publisher =    "Teubner",
  year =         "1986",
  address =      "Stuttgart",
  pages =        "299",
}

@Book{mo:Wolfram:88,
  author =       "St. Wolfram",
  title =        "Mathematica",
  publisher =    "Addison-Wesley",
  year =         "1988",
  address =      "Redwood City, CA",
  pages =        "749",
}

@Book{mo:WooffHodgkinson:87,
  author =       "C. Wooff and D. Hodgkinson",
  title =        "mu{MATH}: {A} microcomputer algebra system",
  publisher =    "Academic Press",
  year =         "1987",
  address =      "London",
  pages =        "159",
}

@Book{mo:Yap:86,
  author =       "H. P. Yap",
  title =        "Some Topics in Graph Theory",
  publisher =    "Cambridge Univ. Press",
  year =         "1986",
  address =      "Cambridge",
  pages =        "230",
}

@Book{mo:YemelichewKovalevKravtsov:84,
  author =       "V. A. Yemelichew and M. M. Kovalev and M. K.
                 Kravtsov",
  title =        "Polytopes, Graphs, Optimization",
  publisher =    "Cambridge University Press",
  year =         "1984",
  address =      "Cambridge/London",
  pages =        "423",
}

@Book{mo:Young:71,
  author =       "D. M. Young",
  title =        "Iterative Solution of Large Linear Systems",
  publisher =    "Academic Press",
  year =         "1971",
  address =      "New York/London",
  pages =        "570",
}

@Book{mo:ZangwillGarcia:81,
  author =       "W. I. Zangwill and C. B. Garcia",
  title =        "Pathways to Solutions, Fixed Points, and Equilibria",
  publisher =    "Prentice-Hall",
  year =         "1981",
  address =      "London",
  pages =        "479",
}

@Book{mo:Zeleny:74,
  author =       "M. Zeleny",
  title =        "Linear Multiobjective Programming",
  publisher =    "Springer",
  year =         "1974",
  address =      "Berlin/New York",
  series =       "Lecture Notes in Economics and Mathematical Systems",
  volume =       "95",
  pages =        "220",
}

@Book{mo:Zionts:78,
  author =       "S. Zionts",
  title =        "Multiple Criteria Problem Solving",
  publisher =    "Springer",
  year =         "1978",
  address =      "Berlin",
  series =       "Lecture Notes in Economics and Mathematical Systems",
  volume =       "155",
  pages =        "567",
}

@Book{mo:Zoutendijk:76,
  author =       "G. Zoutendijk",
  title =        "Mathematical Programming Methods",
  publisher =    "North Holland",
  year =         "1976",
  address =      "Amsterdam",
  pages =        "500",
}

@TechReport{sep:AchatzKleinschmidtPaparriz:90,
  author =       "H. Achatz and P. Kleinschmidt and K. Paparrizos",
  title =        "A dual forest algorithm for the assignment problem",
  institution =  "Universit{\"a}t Passau, Fakult{\"a}t f{\"u}r
                 Mathematik und Informatik",
  year =         "1990",
  number =       "MIP-9017",
  address =      "Passau",
  pages =        "12",
}

@TechReport{sep:AczelRoteSchwaiger:93,
  author =       "J\'anos Acz\'el and G{\"u}nter Rote and Jens
                 Schwaiger",
  title =        "Webs, Iteration Groups, and Equivalent Changes in
                 Probabilities",
  institution =  "Institut f{\"u}r Mathematik",
  year =         "1993",
  number =       "270",
  address =      "Technische Universit{\"a}t Graz",
}

@Article{sep:AdamsBalasZawack:88,
  author =       "J. Adams and E. Balas and D. Zawack",
  title =        "The Shifting Bottleneck Procedure for Job Shop
                 Scheduling",
  year =         "1988",
  journal =      "Management Sci.",
  volume =       "34",
  number =       "3",
  pages =        "391--401",
}

@Article{sep:AdlerHoffmannShamir:90,
  author =       "I. Adler and A. J. Hoffman and R. Shamir",
  title =        "Monge and Feasibility Sequences in General Flow
                 Problems",
  year =         "1990",
  journal =      "TECHREP",
  volume =       "?",
  number =       "3",
  pages =        "22",
}

@Article{sep:AdlerResendeVeiga:89,
  author =       "I. Adler and M. G. C. Resende and G. Veiga",
  title =        "An Implementation of Karmarkar's Algorithm for Linear
                 Programming",
  year =         "1989",
  journal =      "Math. Programming Stud.",
  volume =       "44",
  number =       "3",
  pages =        "297--335",
}

@TechReport{sep:AdrabinskiSyslo:80,
  author =       "A. Adrabinski and M. M. Syslo",
  title =        "Computational experiments with some heuristic
                 algorithms for the travelling salesman problem",
  institution =  "Institute of Computer Science Wroclaw University",
  year =         "1980",
  number =       "N-78",
  address =      "Wroclaw, Poland",
  pages =        "32",
}

@Article{sep:AggarwalKlaweMoranShorWilber:87,
  author =       "Alok Aggarwal and Maria M. Klawe and Shlomo Moran and
                 Peter Shor and Robert Wilber",
  title =        "Geometric Applications of a Matrix-Searching
                 Algorithm",
  journal =      "Algorithmica",
  volume =       "2",
  pages =        "195--208",
  year =         "1987",
}

@Article{sep:Agrawal:74,
  author =       "S. C. Agrawal",
  title =        "On Mixed Integer Quadratic Programs",
  journal =      "Naval Research Logistics Quarterly",
  year =         "1974",
  volume =       "21",
  pages =        "289--297",
}

@TechReport{sep:Ahrens:7a,
  author =       "J. H. Ahrens",
  title =        "Counting Basic Feasible Solutions of Transportation
                 Problems",
  institution =  "Mathematisches Seminar der Universit{\"a}t Kiel",
  year =         "197x",
  address =      "Kiel",
  pages =        "15",
}

@TechReport{sep:Ahrens:7b,
  author =       "J. H. Ahrens",
  title =        "A Code for the Transportation Problem",
  institution =  "Universit{\"a}t Kiel",
  year =         "197x",
  address =      "Kiel",
  pages =        "16",
}

@Article{sep:AhrensFinke:80,
  author =       "J. H. Ahrens and G. Finke",
  title =        "Primal Transportation and Transshipment Algorithms",
  journal =      "Z. Oper. Res. Ser. A-B",
  year =         "1980",
  volume =       "24",
  pages =        "1--32",
}

@Article{sep:Ahuja:85,
  author =       "R. K. Ahuja",
  title =        "Minimax Linear Programming Problem",
  year =         "1985",
  journal =      "Oper. Res. Lett.",
  volume =       "4",
  number =       "1",
  pages =        "131--134",
}

@Article{sep:Ahuja:86,
  author =       "R. K. Ahuja",
  title =        "Algorithms for the Minimax Transportation Problem",
  year =         "1986",
  journal =      "Naval Research Logistics Quarterly",
  volume =       "33",
  number =       "1",
  pages =        "725--739",
}

@Article{sep:Ahuja:88,
  author =       "R. K. Ahuja",
  title =        "Minimum Cost-Reliability Ratio Path Problem",
  year =         "1988",
  journal =      "Comput. Oper. Res.",
  volume =       "15",
  number =       "1",
  pages =        "83--89",
}

@Article{sep:AhujaMagnantiOrlin:91,
  author =       "R. K. Ahuja and T. L. Magnanti and J. B. Orlin",
  title =        "Some recent advances in network flows",
  year =         "1991",
  journal =      "SIAM Rev.",
  volume =       "33",
  number =       "2",
  pages =        "175--219",
}

@Article{sep:AhujaMehlhornOrlinTarjan:90,
  author =       "R. K. Ahuja and K. Mehlhorn and J. B. Orlin and R. E.
                 Tarjan",
  title =        "Faster Algorithms for the Shortes Path Problem",
  year =         "1990",
  journal =      "J. Assoc. Comput. Mach.",
  volume =       "37",
  number =       "2",
  pages =        "213--223",
}

@Article{sep:AhujaOrlin:89,
  author =       "R. K. Ahuja and J. B. Orlin",
  title =        "A Fast and Simple Algorithm for the Maximum Flow
                 Problem",
  year =         "1989",
  journal =      "SIAM J. Comput.",
  volume =       "18",
  number =       "5",
  pages =        "939--954",
}

@TechReport{sep:AhujaOrlinTarjan:88,
  author =       "R. K. Ahuja and J. B. Orlin and R. E. Tarjan",
  title =        "Improved Time Bounds for the Maximum Flow Problem",
  institution =  "Massachusetts Institute of Technology",
  year =         "1988",
  number =       "OR 176-88",
  address =      "Cambridge, MA",
  pages =        "1--19",
}

@Article{sep:AignerDowling:71,
  author =       "M. Aigner and Th.A. Dowling",
  title =        "Matching Theory for Combinatorial Geometries",
  journal =      "Trans. Amer. Math. Soc.",
  year =         "1971",
  volume =       "158",
  number =       "1",
  pages =        "231--245",
}

@TechReport{sep:Akguel:80,
  author =       "M. Akg{\"u}l",
  title =        "Shortest Paths and Simplex Method",
  institution =  "Middle East Technical University",
  year =         "1980",
  address =      "Ankara",
  pages =        "25",
}

@Article{sep:Akguel:88,
  author =       "M. Akg{\"u}l",
  title =        "A Sequential Dual Simplex Algorithm for the Linear
                 Assigment Problem",
  year =         "1988",
  journal =      "Oper. Res. Lett.",
  volume =       "7",
  number =       "3",
  pages =        "155--158",
}

@Article{sep:AllineyBarnabeiPezzoli:80,
  author =       "St. Alliney and M. Barnabei and L. Pezzoli",
  title =        "{W}-Optimal Assignable Sets and Allocation Problems",
  journal =      "Boll. Un. Mat. Ital. A (6)",
  year =         "1980",
  volume =       "17",
  number =       "5",
  pages =        "131--136",
}

@TechReport{sep:AlstrupBoasMadsen:85,
  author =       "J. Alstrup and S. Boas and O. B. G. Madsen and R. V.
                 V. Vidal",
  title =        "Booking Policy for Flights with two Passenger Types",
  institution =  "IMSOR, The Institute of Mathematical Statistics and
                 Operations Research, The Technical University of
                 Denmark",
  year =         "1985",
  number =       "01/1985",
  address =      "Lyngby, Denmark",
  pages =        "32",
}

@Article{sep:AmerZimmermann:89,
  author =       "F. J. Amer and K. Zimmermann",
  title =        "Max-Separable Equations and the Set Covering",
  journal =      "Acta Univ. Carolin.---Math. Phys.",
  year =         "1989",
  volume =       "30",
  pages =        "13--21",
}

@TechReport{sep:AndoFujishige:94,
  author =       "Kazutoshi Ando and Satoru Fujishige",
  title =        "On Structures of Bisubmodular Polyhedra",
  institution =  "Institute of Socio-Economic Planning",
  year =         "1994",
  address =      "University of Tsukuba, Tsukuba,Ibaraki/Japan",
}

@TechReport{sep:AndoFujishigeNemoto:94,
  author =       "Kazutoshi Ando and Satoru Fujishige and Toshio
                 Nemoto",
  title =        "Decomposition of a Signed Graph into Strongly
                 Connected Components and its Signed Poset Structure",
  institution =  "Institute of Socio-Economic Planning",
  year =         "1994",
  address =      "University of Tsukuba, Tsukuba,Ibaraki/Japan",
}

@Article{sep:Andonov:87,
  author =       "R. A. Andonov",
  title =        "Finding Facets of the Knapsack Polytope which cut off
                 a given Point",
  journal =      "C. R. Acad. Bulgare Sci.",
  year =         "1987",
  volume =       "40",
  pages =        "41--44",
}

@Article{sep:AngluinValiant:79,
  author =       "D. Angluin and L. G. Valiant",
  title =        "Fast Probabilistic Algorithms for Hamiltonian Circuits
                 and Matchings",
  journal =      "J. Comput. System Sci.",
  year =         "1979",
  volume =       "18",
  pages =        "155--193",
}

@Article{sep:Anstee:87,
  author =       "R. P. Anstee",
  title =        "A polynomial algorithm for b-matchings: an alternative
                 approach",
  journal =      "Inform. Process. Lett.",
  volume =       "24",
  year =         "1987",
  pages =        "153--157",
}

@TechReport{sep:Anstreicher:85,
  author =       "K. M. Anstreicher",
  title =        "Analysis of a modified Karmarkar Algorithm for Linear
                 Programming",
  institution =  "Yale School of Organization and Management",
  year =         "1985",
  number =       "B\#84",
  address =      "New Haven",
  pages =        "13",
}

@Article{sep:Anstreicher:86,
  author =       "K. M. Anstreicher",
  title =        "A monotonic projective Algorithm for fractional linear
                 programming",
  journal =      "Algorithmica",
  volume =       "1",
  year =         "1986",
  pages =        "483--498",
}

@Article{sep:Anstreicher:88,
  author =       "K. M. Anstreicher",
  title =        "Linear Programming and the Newton Barrier Flow",
  year =         "1988",
  journal =      "Math. Programming",
  volume =       "41",
  number =       "3",
  pages =        "367--373",
}

@Article{sep:Anstreicher:89a,
  author =       "K. M. Anstreicher",
  title =        "The worst-case Step in Karmarkar's algorithm",
  year =         "1989",
  journal =      "Math. Oper. Res.",
  volume =       "14",
  number =       "2",
  pages =        "294--302",
}

@Article{sep:Anstreicher:89b,
  author =       "K. M. Anstreicher",
  title =        "A combined phase {I}-phase {II} projective algorithm
                 for linear programming",
  journal =      "Math. Programming",
  volume =       "43",
  number =       "2",
  year =         "1989",
  pages =        "209--223",
}

@TechReport{sep:AnstreicherHertogTerlaky:90,
  author =       "K. M. Anstreicher and D. den Hertog and C. Roos and T.
                 Terlaky",
  title =        "A Long Step Barrier Method for Convex Quadratic
                 Programming",
  institution =  "Delft University of Technology",
  year =         "1990",
  number =       "90-53",
  address =      "Delft",
  pages =        "19",
}

@TechReport{sep:AnstreicherTerlaky:91,
  author =       "K. M. Anstreicher and T. Terlaky",
  title =        "A Monotonic Build-Up Simplex Algorithm for Linear
                 Programming",
  institution =  "University of Technology",
  year =         "1991",
  number =       "91-82",
  address =      "Delft",
  pages =        "16",
}

@Article{sep:Aprile:83,
  author =       "G. Aprile",
  title =        "Graphs of Direct and Mediate Adjacency in the Colored
                 Maps Topology",
  year =         "1983",
  journal =      "Atti Accad. Sci. Lett. Arti Palermo Parte I (4)",
  volume =       "4",
  number =       "1",
  pages =        "363--366",
}

@TechReport{sep:Araoz:81a,
  author =       "J. Ar\`{a}oz",
  title =        "Polyhedral Neopolarities",
  institution =  "Universidad Simon Bolivar, Departamento de Matematicas
                 y Ciencia de la Computacion",
  year =         "1981",
  number =       "63",
  address =      "Valle de Sartenejas, Edo. Miranda, Venezuela",
  pages =        "1.1--8.4",
}

@TechReport{sep:Araoz:82,
  author =       "J. Ar\`{a}oz",
  title =        "Subadditive Characterization of Ordered Semigroup
                 Problems",
  institution =  "Institut f{\"u}r {\"O}konometrie und Operations
                 Research, Universit{\"a}t Bonn",
  year =         "1982",
  number =       "82240-OR",
  address =      "Bonn",
  pages =        "14",
}

@Article{sep:Araoz:84,
  author =       "J. Ar\`aoz",
  title =        "Packing Problems in Semigroup Programming",
  year =         "1984",
  journal =      "Ann. Disc. Math.",
  volume =       "19",
  pages =        "1--22",
}

@Article{sep:AraozCunninghamEdmonds:83,
  author =       "J. Ar\`{a}oz and W. H. Cunningham and J. Edmonds and
                 J. Green-Kr\'{o}tki",
  title =        "Reductions to 1-Matching Polyhedra",
  journal =      "Networks",
  year =         "1983",
  volume =       "13",
  pages =        "455--474",
}

@TechReport{sep:AraozEdmonds:82,
  author =       "J. Ar\`{a}oz and J. Edmonds",
  title =        "A Case of Non-Convergent Pivoting in Assignment
                 Problems",
  institution =  "Institut f{\"u}r {\"O}konometrie und Operations
                 Research, Universit{\"a}t Bonn",
  year =         "1982",
  number =       "82233-OR",
  address =      "Bonn",
  pages =        "10",
}

@TechReport{sep:AraozJohnson:82,
  author =       "J. Ar\`{a}oz and E. L. Johnson",
  title =        "Mappings and Liftings for Group and Semigroup
                 Problems",
  institution =  "Institut f{\"u}r {\"O}konometrie und Operations
                 Research, Universit{\"a}t Bonn",
  year =         "1982",
  number =       "82231-OR",
  address =      "Bonn",
  pages =        "42",
}

@Article{sep:ArlazarovDinicKronrodFaradzev:70,
  author =       "V. L. Arlazarov and E. A. Dinic and M. A. Kronrod and
                 I. A. Faradzev",
  title =        "On Economical Construction of the Transitive Closure
                 of an Oriented Graph",
  journal =      "Soviet Math. Dokl.",
  year =         "1970",
  volume =       "11",
  pages =        "1209--1210",
}

@Article{sep:ArmstrongCharnesPhillips:79,
  author =       "R. Armstrong and A. Charnes and F. Phillips",
  title =        "Page Cuts for Integer Interval Linear Programming",
  journal =      "Discrete Appl. Math.",
  year =         "1979",
  volume =       "1",
  pages =        "14",
}

@TechReport{sep:ArmstrongJin:91,
  author =       "R. D. Armstrong and Z. Jin",
  title =        "Solving Linear Bottleneck Assignment Problems via
                 Strong Spanning Trees",
  institution =  "Graduate School of Management, Rutgers University",
  year =         "1991",
  address =      "Newark, NJ",
  pages =        "6",
}

@TechReport{sep:AronsonBarrHelgasonKenningtonLohZaki:85,
  author =       "J. Aronson and R. Barr and R. Helgason and J.
                 Kennington and A. Loh and H. Zaki",
  title =        "The Projective Transformation Algorithm by Karmarkar:
                 {A} Computational Experiment with Assignment Problems",
  institution =  "University of Houston, Dep. of Industrial
                 Engineering",
  year =         "1985",
  number =       "85-OR-3",
  address =      "Houston",
  pages =        "11",
}

@TechReport{sep:AscheuerEscuderoGroetschelStoer:90,
  author =       "N. Ascheuer and L. F. Escudero and M. Gr{\"o}tschel
                 and M. Stoer",
  title =        "A Cutting Plane Approach to the Sequential Ordering
                 Problems (with Applications to Job Scheduling in
                 Manufaturing)",
  institution =  "Universit{\"a}t Augsburg, Institut f{\"u}r
                 Mathematik",
  year =         "1990",
  number =       "190",
  address =      "Augsburg",
  pages =        "27",
}

@TechReport{sep:AsicRadosavljevic-NikolicKovacevic-Vujcic:8,
  author =       "M. D. Asic and M. D. Radosavljevic-Nikolic and V. V.
                 Kovacevic-Vujcic",
  title =        "Asymptotic Behaviour of Karmarkar's Method for Linear
                 Programming",
  institution =  "Belgrade University",
  year =         "198x",
  address =      "Belgrad",
  pages =        "25",
}

@Article{sep:AttmannHahn:75,
  author =       "J. Attmann and W. Hahn",
  title =        "Numerische Erfahrungen mit der Filtermethode von Balas
                 in der linearen bin{\"a}ren Optimierung",
  journal =      "Computing",
  year =         "1975",
  volume =       "14",
  pages =        "261--270",
}

@TechReport{sep:AusielloLucertini:81,
  author =       "G. Ausiello and M. Lucertini",
  title =        "Analysis and Design of Algorithms in Combinatorial
                 Optimization",
  institution =  "International, Centre for Mechanical Sciences",
  year =         "1981",
  number =       "266",
  address =      "Rom",
  pages =        "129--145",
}

@TechReport{sep:Bachem:75,
  author =       "A. Bachem",
  title =        "Intersection of Corner Polyhedra and a Decomposition
                 Algorithm",
  institution =  "Institut f{\"u}r {\"O}konometrie und Operations
                 Research, Universit{\"a}t Bonn",
  year =         "1975",
  number =       "7534-OR",
  address =      "Bonn",
  pages =        "34",
}

@Article{sep:Bachem:80a,
  author =       "A. Bachem",
  title =        "Anwendungen der Komplexit{\"a}tstheorie im Operations
                 Research: Ein {\"U}berblick",
  journal =      "Zeitschrift f{\"u}r Betriebswirtschaft",
  year =         "1980",
  volume =       "50",
  pages =        "812--844",
}

@InProceedings{sep:Bachem:80b,
  author =       "A. Bachem",
  title =        "Theorems of the alternative in Combinatorial
                 Programming",
  booktitle =    "Methods of Operations Research",
  year =         "1980",
  editor =       "R. Henn and P. Kall et al",
  pages =        "7--20",
  address =      "Meisenheim",
  publisher =    "Athen{\"a}um, Hain",
}

@InProceedings{sep:Bachem:82,
  author =       "A. Bachem",
  title =        "Concepts of Algorithmic Computation",
  booktitle =    "Modern Applied Mathematics, Optimization and
                 Operations Research",
  year =         "1982",
  editor =       "B. Korte",
  pages =        "3--49",
  address =      "Amsterdam",
  publisher =    "North-Holland",
}

@InCollection{sep:Bachem:83,
  author =       "A. Bachem",
  title =        "Convexity and Optimization in Discrete Structures",
  booktitle =    "Convexity and its Applications",
  year =         "1983",
  editor =       "P. M. Gruber and J. M. Wills",
  pages =        "9--29",
  address =      "Basel",
  publisher =    "Birkh{\"a}user",
}

@Article{sep:Bachem:84,
  author =       "A. Bachem",
  title =        "Optimization and Geometry in Discrete Structures",
  year =         "1984",
  journal =      "XX",
  volume =       "232",
  number =       "1",
  pages =        "27",
}

@Article{sep:BachemEuler:84,
  author =       "A. Bachem and R. Euler",
  title =        "Recent Trends in Combinatorial Optimization",
  journal =      "OR Spektrum",
  year =         "1984",
  volume =       "6",
  pages =        "1--22",
}

@TechReport{sep:BachemGroetschel:79,
  author =       "A. Bachem and M. Gr{\"o}tschel",
  title =        "New Aspects of Polyhedral Theorey",
  institution =  "Institut f{\"u}r {\"O}konometrie und Operations
                 Research, Universit{\"a}t Bonn",
  year =         "1979",
  number =       "79149-OR",
  address =      "Bonn",
  pages =        "77",
}

@Article{sep:BachemGroetschel:81,
  author =       "A. Bachem and M. Gr{\"o}tschel",
  title =        "Characterizations of Adjacency of Faces of Polyhedra",
  journal =      "Math. Programming Stud.",
  year =         "1981",
  volume =       "14",
  pages =        "1--22",
}

@Article{sep:BachemJohnsonSchrader:82,
  author =       "A. Bachem and E. L. Johnson and R. Schrader",
  title =        "A Characterization of Minimal Valid Inequalities for
                 Mixed Integer Programs",
  journal =      "Oper. Res. Lett.",
  year =         "1982",
  volume =       "1",
  pages =        "63--66",
}

@InProceedings{sep:BachemKern:84,
  author =       "A. Bachem and W. Kern",
  title =        "Polyhedral Theory in Oriented Matroids",
  booktitle =    "Mathematical Programming, Proc. of the Intern. Cogress
                 on Mathematical Programming, Rio de Janeiro 1981",
  year =         "1984",
  editor =       "R. E. Cottle and M. L. Kelmanson and B. Korte",
  pages =        "1--12",
  address =      "Amsterdam",
  publisher =    "North Holland",
}

@Article{sep:BachemKern:86,
  author =       "A. Bachem and W. Kern",
  title =        "Adjoints of Oriented Matroids",
  year =         "1986",
  journal =      "Combinatorica",
  volume =       "6",
  number =       "1",
  pages =        "209--308",
}

@Article{sep:BachemKern:88,
  author =       "A. Bachem and W. Kern",
  title =        "On Sticky Matroids",
  year =         "1988",
  journal =      "Discrete Math.",
  volume =       "69",
  number =       "1",
  pages =        "11--18",
}

@Article{sep:BachemKorte:78,
  author =       "A. Bachem and B. Korte",
  title =        "An Algorithm for Quadratic Optimization Over
                 Transportation Polytopes",
  journal =      "Z. Angew. Math. Mech.",
  year =         "1978",
  volume =       "58",
  pages =        "459--461",
}

@Article{sep:BachemKorte:80,
  author =       "A. Bachem and B. Korte",
  title =        "Minimum Norm Problems over Transportation Polytopes",
  journal =      LINAA2,
  year =         "1980",
  volume =       "31",
  pages =        "103--118",
}

@Article{sep:BachemKorte:81a,
  author =       "A. Bachem and B. Korte",
  title =        "Estimating Matrices",
  journal =      "Metrika",
  year =         "1981",
  volume =       "28",
  pages =        "273--286",
}

@InProceedings{sep:BachemKorte:81b,
  author =       "A. Bachem and B. Korte",
  title =        "Mathematical Programming and Estimation of
                 Input-Output Matrices",
  booktitle =    "Mathematical programming and its economic
                 applications, 423 - 451 p.",
  year =         "1981",
  editor =       "Giovanni Castellani and Piera Mazzoleni",
  address =      "Milano",
}

@InProceedings{sep:BachemKorte:81c,
  author =       "A. Bachem and B. Korte",
  title =        "Primal and Dual Methods for Updating Input-Output
                 Matrices",
  booktitle =    "Unternehmensplanung",
  year =         "1981",
  editor =       "K. Brockhoff and W. Krelle",
  pages =        "117--127",
  address =      "Berlin",
  publisher =    "Springer-Verlag",
}

@InProceedings{sep:BachemRandow:79,
  author =       "A. Bachem and R. von Randow",
  title =        "Integer Theorems of Farkas Lemma Type",
  booktitle =    "Proceedings of the III Symposium on Operations
                 Research, 32",
  year =         "1979",
  editor =       "W. Oettli and F. Steffens",
  pages =        "19--28",
  address =      "K{\"o}nigsstein/Ts.",
  publisher =    "Athen{\"a}um",
}

@Article{sep:BachemSchrader:80,
  author =       "A. Bachem and R. Schrader",
  title =        "Minimal Inequalities and Subadditive Duality",
  journal =      "SIAM J. Control Optim.",
  volume =       "18",
  year =         "1980",
  pages =        "437--443",
  organization = "Society for Industrial and Applied Mathematics",
}

@TechReport{sep:BachemSchrader:x0,
  author =       "A. Bachem and R. Schrader",
  title =        "Einf{\"u}hrung in das Operations Research",
  institution =  "?",
  year =         "19x0",
  number =       "R72-WP80155",
  pages =        "1--76",
}

@Article{sep:BachemWanka:88,
  author =       "A. Bachem and A. Wanka",
  title =        "Separation Theorems for Oriented Matroids",
  year =         "1988",
  journal =      "Discrete Math.",
  volume =       "70",
  number =       "3",
  pages =        "303--310",
}

@Article{sep:BackhouseCarre:75,
  author =       "R. C. Backhouse and B. A. Carr\'{e}",
  title =        "Regular Algebra Applied to Path-finding Problems",
  journal =      "J. Inst. Maths Applics",
  year =         "1975",
  volume =       "15",
  pages =        "181--186",
}

@TechReport{sep:BahnGoffinVialDuMerle:91,
  author =       "O. Bahn and J. L. Goffin and J. P. Vial and O. Du
                 Merle",
  title =        "Implementation and Behavior of an Interior Point
                 Cutting Plane Algorithm for Convex Programming: An
                 Application to Geometric Programming",
  institution =  "Universit\'{e} de Gen\`{e}ve, D\'{e}partement
                 d'\'{e}conomie commerciale et industrielle",
  year =         "1991",
  address =      "Gen\`{e}ve",
  pages =        "29",
}

@Article{sep:BakerMartin:74,
  author =       "K. R. Baker and J. B. Martin",
  title =        "An Experimental Comparison of Solution Algorithms for
                 the Single-Machine Tardiness Problem",
  journal =      "Naval Research Logistics Quarterly",
  year =         "1974",
  volume =       "21",
  number =       "1",
  pages =        "187--199",
}

@TechReport{sep:Balas:74,
  author =       "E. Balas",
  title =        "Disjunctive Programming: Properties of the Convex Hull
                 of Feasible Points",
  institution =  "Management Sciences Research Group, Carnegie-Mellon
                 University",
  year =         "1974",
  number =       "MSRR-348",
  address =      "Pittsburgh",
  pages =        "1--56",
}

@InProceedings{sep:Balas:79,
  author =       "E. Balas",
  title =        "Disjunctive Programming",
  booktitle =    "Discrete Optimization II, 5",
  year =         "1979",
  editor =       "P. L. Hammer and E. L. Johnson and B. H. Korte",
  pages =        "3--51",
  organization = "Annals of Discrete Mathematics",
  address =      "Amsterdam",
  publisher =    "North-Holland",
}

@Article{sep:Balas:84,
  author =       "E. Balas",
  title =        "A Sharp Bound On The Ratio Between Optimal Integer And
                 Fractional Covers",
  year =         "1984",
  journal =      "Math. Oper. Res.",
  volume =       "9",
  number =       "1",
  pages =        "1--5",
}

@TechReport{sep:Balas:86,
  author =       "E. Balas",
  title =        "More on Graphs with Polynomially Solvable
                 Maximum-Weight Clique Problem",
  institution =  "Carnegie Mellon University, Graduate School of
                 Industrial Administration",
  year =         "1986",
  number =       "MSRR-530",
  address =      "Pittsburgh, PA",
  pages =        "10",
}

@Article{sep:Balas:87,
  author =       "E. Balas",
  title =        "The Assignable Subgraph Polytope of a Directed Graph",
  year =         "1987",
  journal =      "Congr. Numer.",
  volume =       "60",
  number =       "1",
  pages =        "35--42",
}

@Article{sep:Balas:88,
  author =       "E. Balas",
  title =        "On the Convex Hull of the Union of Certain Polyhedra",
  year =         "1988",
  journal =      "Oper. Res. Lett.",
  volume =       "7",
  number =       "6",
  pages =        "279--283",
}

@Article{sep:Balas:89a,
  author =       "E. Balas",
  title =        "The Prize Collectiing Travelling Salesman Problem",
  year =         "1989",
  journal =      "Networks",
  volume =       "19",
  number =       "6",
  pages =        "621--636",
}

@TechReport{sep:Balas:92,
  author =       "E. Balas",
  title =        "Projection with a Minimal System of Inequalities",
  institution =  "Carnegie Mellon University",
  year =         "1992",
  number =       "MSRR-585",
  address =      "Pittsburg, PA",
}

@TechReport{sep:BalasCasrrera:91,
  author =       "E. Balas and M. C. Casrrera",
  title =        "A Dynamic Subgradient-Based Branch and Bound Procedure
                 for Set Covering",
  institution =  "Carnegie-Mellon University",
  year =         "1991",
  number =       "MSRR-568",
  address =      "Pittsburgh, PA",
  pages =        "28",
}

@TechReport{sep:BalasCeriaCornuejols:92,
  author =       "E. Balas and S. Ceria and G. Cornu\'ejols",
  title =        "A Lift-And-Project Cutting Plane Algorithm for Mixed
                 0--1 Programs",
  institution =  "Carnegie Mellon University",
  year =         "1992",
  number =       "576(R)",
  address =      "Pittsburgh, PA",
}

@Article{sep:BalasChristofides:81,
  author =       "E. Balas and N. Christofides",
  title =        "A Restricted Lagrangean Approach to the Travelling
                 Salesman Problem",
  journal =      "Math. Programming",
  year =         "1981",
  volume =       "21",
  pages =        "19--46",
}

@TechReport{sep:BalasFischetti:88,
  author =       "E. Balas and M. Fischetti",
  title =        "The Fixed-Outdegree 1-Arborescence Polytope",
  institution =  "Carnegie Mellon University, Graduate School of
                 Industrial Administration",
  year =         "1988",
  number =       "MSRR-551",
  address =      "Pittsburgh, PA",
  pages =        "25",
}

@TechReport{sep:BalasJeroslow:75,
  author =       "E. Balas and R. G. Jeroslow",
  title =        "Strengthening Cuts for Mixed Integer Programs",
  institution =  "Management Sciences Research, Graduate School of
                 Industrial Administration, Carnegie-Mellon University",
  year =         "1975",
  number =       "MSRR-359",
  address =      "Pittsburgh, PA",
  pages =        "28",
}

@TechReport{sep:BalasLenstraVazacopoulos:92,
  author =       "E. Balas and J. K. Lenstra and A. Vazacopoulos",
  title =        "One Machine Scheduling with Delayed Precedence
                 Contraints",
  institution =  "Carnegie-Mellon University",
  year =         "1992",
  number =       "MSRR-589",
  address =      "Pittsburgh, PA",
  pages =        "34",
}

@TechReport{sep:BalasMillerPeknyToth:89,
  author =       "E. Balas and D. Miller and J. Pekny and P. Toth",
  title =        "A Parallel Shortest Augmenting Path Algorithm for the
                 Assignment Problem",
  institution =  "Carnegie Mellon University, Graduate School of
                 Industrial Administration",
  year =         "1989",
  number =       "MSRR-552",
  address =      "Pittsburgh, PA",
  pages =        "25",
}

@Article{sep:BalasNg:89a,
  author =       "E. Balas and S. M. Ng",
  title =        "On the Set Covering Polytope: {II}. Lifting the Facets
                 with Coefficients in { 0, 1, 2 }",
  journal =      "Math. Programming",
  year =         "1988",
  volume =       "45",
  pages =        "1--20",
}

@Article{sep:BalasNg:89b,
  author =       "E. Balas and S. M. Ng",
  title =        "On the Set Covering Polyope: {I}. All the Facets with
                 Coefficients in {0, 1, 2}",
  journal =      "Math. Programming",
  year =         "1989",
  volume =       "43",
  pages =        "57--69",
}

@InProceedings{sep:BalasPadberg:8,
  author =       "E. Balas and M. W. Padberg",
  title =        "Set Partitioning - {A} Survey",
  booktitle =    "Combinatorial Optimization",
  year =         "198x",
  editor =       "N. Christofides and A. Mingozzi and P. Toth and
                 Sandi",
  pages =        "151--210",
  address =      "Chichester, New York, Brisbane, Toronto",
  publisher =    "Wiley",
}

@Article{sep:BalasPulleyblank:82,
  author =       "E. Balas and W. Pulleyblank",
  title =        "The Perfectly Matchable Subgraph Polytope of Bipartite
                 Graph",
  journal =      "Networks",
  year =         "1982",
  volume =       "13",
  pages =        "495--516",
}

@TechReport{sep:BalasQi:90,
  author =       "E. Balas and L. Qi",
  title =        "Linear-Time Separation Algorithms for the Three-Index
                 Assignment Polytope",
  institution =  "Carnegie Mellon University",
  year =         "1990",
  number =       "MSRR-562",
  address =      "Pittsburgh, PA",
  pages =        "15",
}

@Article{sep:BalasSaltzman:89,
  author =       "E. Balas and M. J. Saltzman",
  title =        "Facets of the Three-Index Assignment Polytope",
  year =         "1989",
  journal =      "Discrete Appl. Math.",
  volume =       "23",
  number =       "3",
  pages =        "201--229",
}

@Article{sep:BalasSaltzman:91,
  author =       "E. Balas and M. Saltzman",
  title =        "An Algorithm for the Three-Index Assignment Problem",
  year =         "1991",
  journal =      "Oper. Res.",
  volume =       "39",
  number =       "1",
  pages =        "150--161",
}

@Article{sep:BalasTamaTind:89,
  author =       "E. Balas and J. M. Tama and J. Tind",
  title =        "Sequential Convexification in Reverse Convex and
                 Disjunctive Programming",
  year =         "1989",
  journal =      "Math. Programming Stud.",
  volume =       "44",
  number =       "3",
  pages =        "337--350",
}

@Article{sep:BalasXue:91,
  author =       "E. Balas and J. Xue",
  title =        "Minimum Weighted Coloring of Triangulated Graphs, with
                 Application to maximum Weighted Vertex Packing and
                 clique finding in Abbitrary Graphs",
  year =         "1991",
  journal =      "SIAM J. Comput.",
  volume =       "29",
  number =       "2",
  pages =        "209--221",
}

@Article{sep:BalasYu:89,
  author =       "E. Balas and C. S. Yu",
  title =        "More on Graphs with Polynomially Solvable
                 Maximum-Weight Clique Problem",
  year =         "1989",
  journal =      "Networks",
  volume =       "19",
  number =       "2",
  pages =        "247--253",
}

@TechReport{sep:Balinski:82,
  author =       "M. L. Balinski",
  title =        "Signature Methods for the Assignment Problem",
  institution =  "Laboratoire d'Econom\'{e}trie de l'Ecole
                 Polytechnique",
  year =         "1982",
  number =       "AD 253 1182",
  address =      "Paris",
  pages =        "18",
}

@Article{sep:Balinski:83,
  author =       "M. L. Balinski",
  title =        "Combinatoire. Signatures des Points extr\^{e}mes du
                 polyede dual du probl\`{e}me de transport",
  journal =      "Mathematique, Serie 1",
  year =         "1983",
  volume =       "296",
  pages =        "457--459",
}

@Article{sep:BalinskiGomory:8,
  author =       "M. L. Balinski and R. E. Gomory",
  title =        "A Mutual Primal-Dual Simplex Method",
  journal =      "Math. Programming",
  year =         "198x",
  pages =        "17--25",
}

@Article{sep:BalinskiGonzalesz:91,
  author =       "M. L. Balinski and J. Gonzalesz",
  title =        "Maximum Matchings in Bipartite Graphs via Strong
                 Spanning Trees",
  journal =      "Networks",
  year =         "1991",
  volume =       "21",
  pages =        "165--179",
}

@Article{sep:BalinskiLieblingNobs:86,
  author =       "M. L. Balinski and Th.M. Liebling A.-E. Nobs",
  title =        "On the Average Length of Lexicographic Paths",
  year =         "1986",
  journal =      "Math. Programming",
  volume =       "22",
  pages =        "362--364",
}

@Article{sep:BalinskiRussakoff:72,
  author =       "M. L. Balinski and A. Russakoff",
  title =        "Some Properties of the Assignment Polytope",
  journal =      "Math. Programming",
  year =         "1972",
  volume =       "3",
  pages =        "257--258",
}

@Article{sep:BalinskiRussakoff:74,
  author =       "M. L. Balinski and A. Russakoff",
  title =        "On the Assignment Polytope",
  journal =      "SIAM Rev.",
  year =         "1974",
  volume =       "16",
  pages =        "516--525",
}

@Article{sep:BalinskiRussakoff:84,
  author =       "M. L. Balinski and A. Russakoff",
  title =        "Faces of Dual Transportation Polyhedra",
  journal =      "Math. Programming",
  year =         "1984",
  volume =       "22",
  pages =        "1--8",
}

@Article{sep:Ball:83,
  author =       "M. O. Ball",
  title =        "An Analysis of Alternate Strategies for Implementing
                 Matching Algorithms",
  journal =      "Networks",
  year =         "1983",
  volume =       "13",
  pages =        "517--550",
}

@Article{sep:BandtBuroschDrews:81,
  author =       "Ch. Bandt and G. Burosch and K.-D. Drews",
  title =        "Conditionally Monotone Functions and Three Sperner
                 Type Conditions",
  journal =      "Elektron. Informationsverarb. Kybernet.",
  year =         "1981",
  volume =       "EIK 17",
  pages =        "523--537",
}

@Article{sep:BankMandel:87,
  author =       "B. Bank and R. Mandel",
  title =        "Nonlinear Parametric Integer Programming",
  year =         "1987",
  journal =      "Proc. .. MathRes",
  volume =       "35",
  pages =        "16--48",
}

@Article{sep:BansalBakshi:78,
  author =       "S. Bansal and H. C. Bakshi",
  title =        "An Algorithm for Extreme Point Mathematical
                 Programming Problem Using Duality Relations",
  journal =      "?",
  year =         "1978",
  volume =       "9",
  pages =        "1048--1058",
}

@Article{sep:BansalPuri:80,
  author =       "S. Bansal and M. C. Puri",
  title =        "A Min Max Problem",
  journal =      "ZOR",
  year =         "1980",
  volume =       "24",
  pages =        "191--200",
}

@TechReport{sep:BapatStanfordDriessche:93,
  author =       "R. B. Bapat and David P. Stanford and P. van den
                 Driessche",
  title =        "The Eigenproblem in Max Algebra",
  institution =  "Indian Statistical Institute",
  year =         "1993",
  address =      "New Delhi, India",
}

@TechReport{sep:Barahona:82,
  author =       "F. Barahona",
  title =        "The Max-Cut Problem on Graphs not Contractible to
                 {K5}",
  institution =  "Institut f{\"u}r {\"O}konometrie und Operations
                 Research, Universit{\"a}t Bonn",
  year =         "1982",
  number =       "82239-OR",
  address =      "Bonn",
  pages =        "14",
}

@Article{sep:Barahona:83,
  author =       "F. Barahona",
  title =        "On Some Weakly Bipartite Graphs",
  journal =      "Oper. Res. Lett.",
  year =         "1983",
  volume =       "2",
  pages =        "239--242",
}

@TechReport{sep:Barahona:87,
  author =       "F. Barahona",
  title =        "On via Minimization",
  institution =  "Institut f{\"u}r {\"O}konometrie und Operations
                 Research, Universit{\"a}t Bonn",
  year =         "1987",
  number =       "85491-OR",
  address =      "Bonn",
  pages =        "11",
}

@TechReport{sep:BarahonaCunningham:88,
  author =       "F. Barahona and W. H. Cunningham",
  title =        "On Dual Intergrality in Matching Problems",
  institution =  "Universit{\"a}t Bonn, Institut f{\"u}r {\"O}konometrie
                 und OR",
  year =         "1988",
  number =       "88521-OR",
  address =      "Bonn",
  pages =        "11",
}

@TechReport{sep:BarahonaGroetschel:85,
  author =       "F. Barahona and M. Gr{\"o}tschel",
  title =        "The Travelling Salesman Problem for Graphs not
                 Contractible to {K5}-e",
  institution =  "Institut f{\"u}r Mathematik, Universit{\"a}t
                 Augsburg",
  year =         "1985",
  number =       "77",
  address =      "Augsburg",
  pages =        "10",
}

@Article{sep:BarahonaGroetschel:86,
  author =       "P. Barahona and M. Gr{\"o}tschel",
  title =        "On Cycles in Binary Matroids",
  year =         "1986",
  journal =      "J. Combin. Theory Ser. B",
  volume =       "40",
  pages =        "40--62",
}

@Article{sep:BarahonaGroetschelJuengerReinelt:88,
  author =       "F. Barahona and M. Gr{\"o}tschel and M. J{\"u}nger and
                 G. Reinelt",
  title =        "An Application of Combinatorial Optimization to
                 Statistical Physics and Circuit Layout Design",
  year =         "1988",
  journal =      "Oper. Res.",
  volume =       "36",
  number =       "3",
  pages =        "493--513",
}

@Article{sep:BarahonaGroetschelMahjoub:88,
  author =       "F. Barahona and M. Gr{\"o}tschel and A. R. Mahjoub",
  title =        "Facets of the Bipartite Subgraph Polytope",
  journal =      "Math. Oper. Res.",
  year =         "1988",
  volume =       "10",
  pages =        "340--358",
}

@Article{sep:BarahonaJuengerReinelt:89,
  author =       "F. Barahona and M. J{\"u}nger and G. Reinelt",
  title =        "Experiments in Quadratic 0-1 Programming",
  year =         "1989",
  journal =      "Math. Programming",
  volume =       "44",
  number =       "2",
  pages =        "127--137",
}

@TechReport{sep:BarahonaMahjoub:85,
  author =       "F. Barahona and A. R. Mahjoub",
  title =        "Compositions in the Acyclic Subdigraph Polytope",
  year =         "1985",
  institution =  "Institut f{"u}r {\"O}konometrie und Operations
                 Research",
  series =       "85371-OR",
  pages =        "XX",
}

@Article{sep:BarahonaTardos:89,
  author =       "F. Barahona and E. Tardos",
  title =        "Note on Weintraub's Minimum Cost Flow Algorithm",
  year =         "1989",
  journal =      "SIAM J. Comput.",
  volume =       "18",
  number =       "3",
  pages =        "579--583",
}

@Article{sep:BarlowWu:78,
  author =       "R. E. Barlow and A. S. Wu",
  title =        "Coherent Systems with Multi-State Compoments",
  journal =      "Math. Oper. Res.",
  year =         "1978",
  volume =       "3",
  number =       "4",
  pages =        "275--281",
}

@Article{sep:Barnes:86,
  author =       "E. R. Barnes",
  title =        "A Variation on Karmarkar's Algorithm for Solving
                 Linear Programming Problems",
  journal =      "Math. Programming",
  year =         "1986",
  volume =       "36",
  pages =        "174--182",
}

@Article{sep:BarrGloverKlingman:77,
  author =       "R. S. Barr and F. Glover and D. Klingman",
  title =        "The Alternating Basis Algorithm for Assignment",
  journal =      "Math. Programming",
  year =         "1977",
  volume =       "13",
  pages =        "1--13",
}

@Article{sep:BarrGloverKlingmann:79,
  author =       "R. Barr and F. Glover and D. Klingmann",
  title =        "Enhancements of Spanning Tree Labelling Procedures for
                 Network Optimization",
  journal =      "Infor",
  year =         "1979",
  volume =       "17",
  pages =        "16--34",
}

@TechReport{sep:Barsow:,
  author =       "Barsow",
  title =        "Lineare Programmierung",
  institution =  "Mathematisches Institut der Universit{\"a}t K{\"o}ln,
                 Abt. f{\"u}r Mathemat. Statistik u.
                 Wirtschaftsmathematik",
  year =         "xxxx",
  address =      "K{\"o}ln",
  pages =        "93--107",
}

@Article{sep:Bartels:69,
  author =       "R. H. Bartels",
  title =        "A Stabilization of the Simplex Method",
  journal =      "?",
  year =         "1969",
}

@Article{sep:BartelsConnSinclair:78,
  author =       "R. H. Bartels and A. R. Conn and J. W. Sinclair",
  title =        "Minimization Techniques for Pievewise Differentiable
                 Funcktions: The l1 Solution to an Overdetermined Linear
                 System",
  journal =      "SIAM J. Numer. Anal.",
  year =         "1978",
  volume =       "15",
  pages =        "224--241",
}

@TechReport{sep:BartelsNezam:85,
  author =       "R. H. Bartels and M. A. Nezam",
  title =        "On Generating Test Problems for Nonlinear Programming
                 Algorithms",
  institution =  "University of Waterloo, Department of Computer
                 Science",
  year =         "1985",
  address =      "Waterloo, Ontario",
  pages =        "31",
}

@Article{sep:BartuschMoehringRadermacher:88,
  author =       "M. Bartusch and R. H. M{\"o}hring and F. J.
                 Radermacher",
  title =        "Scheduling Project Networks with Resource Constraints
                 and Time Windows",
  year =         "1988",
  journal =      "Ann.Op.Res.",
  volume =       "16",
  number =       "1--4",
  pages =        "201--240",
}

@TechReport{sep:BaumTrotter:78,
  author =       "S. Baum and L. E. Trotter Jr.",
  title =        "Finite Checkability for Integer Rounding Properties in
                 Combinatorial Programming Problems",
  institution =  "Institut f{\"u}r {\"O}konometrie und Operations
                 Research, Universit{\"a}t Bonn",
  year =         "1978",
  number =       "78109-OR",
  address =      "Bonn",
  pages =        "13",
}

@TechReport{sep:BaumTrotter:79,
  author =       "S. Baum and L. E. Trotter",
  title =        "Integer Rounding for Polymatroid and Branching
                 Optimization Problems",
  institution =  "Bell Telephone Laboratories",
  year =         "1979",
  number =       "78120-OR",
  address =      "Holmdel, New Jersey",
  pages =        "21",
}

@TechReport{sep:BayerLagarias:87a,
  author =       "D. A. Bayer and J. C. Lagarias",
  title =        "The Nonlinear Geometry of Linear Programming, {II}.
                 Legendre Transform Coordinates and Central
                 Trajectories",
  institution =  "Columbia University",
  year =         "1987",
  address =      "New York",
  pages =        "75",
}

@TechReport{sep:BayerLagarias:87b,
  author =       "D. A. Bayer and J. C. Lagarias",
  title =        "The Nonlinear Geometry of Linear Programming. {I}.
                 Affine and Projective Scaling Trajectories",
  institution =  "Columbia University",
  year =         "1987",
  address =      "New York",
  pages =        "38",
}

@Article{sep:BayerLagarias:91,
  author =       "D. A. Bayer and J. C. Lagarias",
  title =        "Karmarkar's linear programming algorithm and Newton's
                 method",
  year =         "1991",
  journal =      "Math. Programming",
  volume =       "50",
  number =       "3",
  pages =        "291--330",
}

@Article{sep:BazarraSherali:80,
  author =       "M. S. Bazarra and H. D. Sherali",
  title =        "Benders' Partitioning Scheme Applied to a new
                 Formulation of the Quadratic Assignment Problem",
  journal =      "Naval Research Logistics Quarterly",
  year =         "1980",
  volume =       "27",
  pages =        "29--41",
}

@TechReport{sep:Bednarczuk:77,
  author =       "E. Bednarczuk",
  title =        "{O} Wynikach Test\'{o}w Zadan Programowania Liniowego
                 {W} Oparciu, {O} Pakiety Program\'{o}w Maszyn {IBM} i
                 Robotron",
  institution =  "Polska Akademia Nauk",
  year =         "1977",
  address =      "Nauk (Polen)",
  pages =        "18",
}

@Article{sep:Behringer:81,
  author =       "F. A. Behringer",
  title =        "A simplex based algorithm for the lexicographically
                 extended linear maximum problem",
  journal =      "European J. Oper. Res.",
  year =         "1981",
  volume =       "7",
  pages =        "274--283",
}

@Article{sep:Behringer:83,
  author =       "F. A. Behringer",
  title =        "Discrete and Nondiscrete Quasiconvexlike Functions and
                 Single-Peakedness (Unimodality)",
  journal =      "Ser. Optimization",
  year =         "1983",
  volume =       "14",
  pages =        "163--181",
}

@Article{sep:BeinBrucker:86,
  author =       "W. W. Bein and P. Brucker",
  title =        "Greedy Concepts for Network Flow Problems",
  year =         "1986",
  journal =      "Discrete Appl. Math.",
  volume =       "15",
  pages =        "135--144",
}

@TechReport{sep:BeinBrucker:87,
  author =       "W. W. Bein and P. Brucker",
  title =        "Modelling Polymatroidal Functions by Networks",
  institution =  "Duke University, Computer Science Department",
  year =         "1987",
  number =       "CS-1987-8",
  address =      "Durham, North Carolina",
  pages =        "27",
}

@Article{sep:BeinBruckerStallmann:91,
  author =       "W. W. Bein and P. Brucker and M. Stallmann",
  title =        "Characterization Network Representable Polymatroids",
  journal =      "Z. Oper. Res. Ser. A-B",
  volume =       "35",
  number =       "4",
  year =         "1991",
  pages =        "267--272",
}

@TechReport{sep:BeinBruckner:8,
  author =       "W. W. Bein and P. Brucker",
  title =        "A Characterization of Network Representable
                 Polymatroids",
  institution =  "University of New Mexico",
  year =         "198x",
  address =      "Albuquerque",
  pages =        "9",
}

@TechReport{sep:BekesiGalambosPferschyWoeginger:93,
  author =       "Jozsef Bekesi and Gabor Galambos and Ulrich Pferschy
                 and Gerhard J. Woeginger",
  title =        "Greedy Algorithms for On-Line Data Compression",
  institution =  "Institut f{\"u}r Mathematik",
  year =         "1993",
  number =       "276",
  address =      "Technische Universit{\"a}t Graz",
}

@Article{sep:BellSharpiro:77,
  author =       "D. E. Bell and J. F. Shapiro",
  title =        "A Convergent Duality Theory for Integer Programming",
  journal =      "Oper. Res.",
  year =         "1977",
  volume =       "25",
  number =       "3",
  pages =        "419--434",
}

@InProceedings{sep:Belling-Seib:84,
  author =       "K. Belling-Seib",
  title =        "Methods for Solving Nonlinear Network Flow Problems",
  booktitle =    "Methods of Operations Research 51",
  year =         "1984",
  editor =       "G. Hammer and D. Pallaschke",
  pages =        "227--238",
  address =      "K{\"o}nigstein/Ts.",
  publisher =    "Athen{\"a}um",
}

@Article{sep:Belling-SeibMevertMueller:88,
  author =       "K. Belling-Seib",
  title =        "Network Flow Problems with one Side constraint: {A}
                 Comparison of three Solution Methods",
  year =         "1988",
  journal =      "Comput. Oper. Res.",
  volume =       "15",
  number =       "4",
  pages =        "381--394",
}

@Article{sep:Bellmann:58,
  author =       "R. Bellmann",
  title =        "On a Routing Problem",
  journal =      "Quart. Appl. Math.",
  year =         "1958",
  volume =       "16",
  pages =        "87--90",
}

@Article{sep:BellmannKalaba:60,
  author =       "R. Bellmann and R. Kalaba",
  title =        "On kth Best Policies",
  journal =      "SIAM J. Appl. Math.",
  year =         "1960",
  volume =       "8",
  pages =        "582--588",
}

@Article{sep:BellmoreMalone:71,
  author =       "M. Bellmore and J. C. Malone",
  title =        "Pathology of Travelling-Salesman Subtour-Elimination
                 Algorithms",
  journal =      "Oper. Res.",
  year =         "1971",
  volume =       "19",
  pages =        "278--307",
}

@Article{sep:BellmoreNemhauser:68,
  author =       "M. Bellmore and G. L. Nemhauser",
  title =        "The Travelling Salesman Problem: {A} Survey",
  journal =      "Oper. Res.",
  year =         "1968",
  volume =       "16",
  pages =        "538--558",
}

@TechReport{sep:Ben-TalZowe:81,
  author =       "A. Ben-Tal and J. Zowe",
  title =        "Necessary and Sufficient Optimality Conditions for a
                 Class of Nonsmooth Minimization Problems",
  institution =  "Technion-Israel Institute of Technology",
  year =         "1981",
  address =      "Haifa, Israel",
  pages =        "30",
}

@Article{sep:Benders:62,
  author =       "J. F. Benders",
  title =        "Partitioning procedures for solving mixed-variables
                 programming problems",
  journal =      "Numer. Math.",
  year =         "1962",
  volume =       "4",
  pages =        "238--252",
}

@Article{sep:BenkerGoepfert:,
  author =       "H. Benker and A. G{\"o}pfert",
  title =        "Zu einigen Aspekten der Dualit{\"a}tstheorie in
                 allgemeinen {R}{\"a}umen",
  journal =      "?",
  year =         "xxxx",
  pages =        "6--24",
}

@InProceedings{sep:Benzaken:68,
  author =       "C. Benzaken",
  title =        "Structures Alg\'{e}briques des Cheminements:
                 Pseudo-Treillis, Gerbiers de Carr\'{e} Nul",
  booktitle =    "Network and Switching Theory",
  year =         "1968",
  editor =       "G. Biorci",
  pages =        "40--57",
  address =      "New York",
  publisher =    "Academic Press",
}

@TechReport{sep:BenzakenHammer:76,
  author =       "C. Benzaken and Pl. Hammer",
  title =        "Linear Separation of Dominating Sets in Graphs",
  year =         "1985",
  institution =  "University of Waterloo",
  series =       "CORR 76-47",
  pages =        "7--34",
}

@Article{sep:BenzakenHammer:85,
  author =       "C. Benzaken and P. L. Hammer",
  title =        "Boolean Techniques for Matroidal Decomposition of
                 Independence Systems and Applications to Graphs",
  year =         "1985",
  journal =      "Discrete Math.",
  volume =       "56",
  pages =        "7--34",
}

@Article{sep:Beoni:86,
  author =       "C. Beoni",
  title =        "A Generalization of Fenchel Duality Theory",
  year =         "1986",
  journal =      "J. Optim. Theory Appl.",
  volume =       "49",
  pages =        "375--387",
}

@Article{sep:BergeLasVergnas:70,
  author =       "C. Berge and M. Las Vergnas",
  title =        "Sur un Theorem du Type {K}{\"o}nig pour Hypergraphs",
  journal =      "Ann. Acad. Sci. Fenn. Ser. A I Math.",
  year =         "1970",
  volume =       "175",
  number =       "1",
  pages =        "32--40",
}

@Article{sep:BernLawlerWong:87,
  author =       "M. W. Bern and E. L. Lawler and A. L. Wong",
  title =        "Linear-Time Computation of Optimal Subgraphs of
                 Decomposable Graphs",
  year =         "1987",
  journal =      "J. Algorithms",
  volume =       "8",
  pages =        "216--235",
}

@TechReport{sep:Bertet:74,
  author =       "R. Bertet",
  title =        "Optimierung in Topologischen Vektorr{\"a}umen",
  institution =  "Mathematische-Statistische Sektion im
                 Forschungszentrum Graz",
  year =         "1974",
  number =       "12",
  address =      "Graz",
  pages =        "105",
}

@TechReport{sep:Bertrand:90,
  author =       "G. Bertrand",
  title =        "Computing the Lengths of Shortest Paths in ${Z}^n$",
  institution =  "Laboratoire Intelligence Artificielle \& Analyse
                 d'Images",
  year =         "1990",
  address =      "Paris",
  pages =        "11",
}

@TechReport{sep:BertsekasCastanon:90,
  author =       "D. P. Bertsekas and Castanon",
  title =        "Parallel Asynchronous Hungarian Methods for the
                 Assignment Problem",
  institution =  "?",
  year =         "1990",
  number =       "LIDS-P-1997",
  pages =        "25",
}

@Article{sep:BertsekasDimitri:85,
  author =       "D. P. Bertsekas and P. Dimitri",
  title =        "A Unified Framework for Primal-Dual Methods in Minimum
                 Cost Network Flow Problems",
  journal =      "Math. Programming",
  year =         "1985",
  volume =       "32",
  pages =        "125--145",
}

@Article{sep:BertsekasTseng:88,
  author =       "D. P. Bertsekas and P. Tseng",
  title =        "Relaxation Methods for Minimum Cost Ordinary and
                 Generalized Network Flow Problems",
  year =         "1988",
  journal =      "Oper. Res.",
  volume =       "36",
  number =       "1",
  pages =        "93--114",
}

@TechReport{sep:Betke:86,
  author =       "U. Betke",
  title =        "An interative algorithm for {LP} with finite
                 termination property",
  institution =  "Universit{\"a}t Siegen, FB Mathematik",
  year =         "1986",
  number =       "178",
  address =      "Siegen",
  pages =        "13",
}

@TechReport{sep:Betke:91,
  author =       "U. Betke",
  title =        "Approximating the Volume of Convex Bodies",
  institution =  "Universit{\"a}t Siegen, Institut f{\"u}r Mathematik",
  year =         "1991",
  number =       "252",
  address =      "Siegen",
  pages =        "6",
}

@TechReport{sep:BetkeGritzmann:8,
  author =       "U. Betke and P. Gritzmann",
  title =        "A Geometric Approach to the Dual Simplex-Algorithm",
  institution =  "Universit{\"a}t Siegen, FB Mathematik",
  year =         "198x",
  number =       "150",
  address =      "Siegen",
  pages =        "18",
}

@Article{sep:BetkeGritzmann:84,
  author =       "U. Betke and P. Gritzmann",
  title =        "Polyedrische 2-Mannigfaltigkeiten mit wenigen
                 nicht-konvexen Ecken",
  journal =      "Monatsh. Math.",
  year =         "1984",
  volume =       "97",
  pages =        "1--21",
}

@TechReport{sep:BetkeGritzmann:86,
  author =       "U. Betke and P. Gritzmann",
  title =        "Projection algorithms for linear programming",
  institution =  "Universit{\"a}t Siegen, FB Mathematik",
  year =         "1986",
  number =       "176",
  address =      "Siegen",
  pages =        "22",
}

@Article{sep:BetkeGritzmann:92,
  author =       "U. Betke and P. Gritzmann",
  title =        "Projection algorithms for linear programming",
  journal =      "European J. Oper. Res.",
  year =         "1992",
  volume =       "60",
  pages =        "287--295",
}

@Article{sep:BetkeHenk:91a,
  author =       "U. Betke and M. Henk",
  title =        "Linear Programming by Mimimizing Distances",
  year =         "1991",
  journal =      "Z. Oper. Res. Ser. A-B",
  volume =       "35",
  number =       "4",
  pages =        "299--307",
}

@TechReport{sep:BetkeHenk:91b,
  author =       "U. Betke and M. Henk",
  title =        "Estimating Sizes of a Convex Body by Successive
                 Diameteres and Widths",
  institution =  "Universit{\"a}t Siegen, Institut f{\"u}r Mathematik",
  year =         "1991",
  number =       "251",
  address =      "Siegen",
  pages =        "10",
}

@Article{sep:BettsBrownLuss:94,
  author =       "Lisa M. Betts and Randall Brown and Hanan Luss",
  title =        "Minimax Resource Allocation Problems with Ordering
                 Constraints",
  journal =      "Naval Research Logistics",
  volume =       "41",
  pages =        "719--738",
  year =         "1994",
}

@TechReport{sep:Beyer:89,
  author =       "J. Beyer",
  title =        "Ein auf einer Indexmengenstrategie beruhender
                 Algorithmus f{\"u}r das linare Optimierungsproblem",
  institution =  "Technische Universit{\"a}t {"}Otto von Guericke{"},
                 Sektion Mathematik",
  year =         "1989",
  address =      "Magdeburg",
  pages =        "18",
}

@Article{sep:BhatiaSwarupPuri:76,
  author =       "H. L. Bhatia and K. Swarup and M. C. Puri",
  title =        "Time-Cost Trade-Off in a Transportation Problem",
  journal =      "Opsearch",
  year =         "1976",
  volume =       "13",
  pages =        "129--142",
}

@Article{sep:Bielak:83,
  author =       "H. Bielak",
  title =        "On a j-neighbourhood in simple graphs",
  year =         "1983",
  journal =      "Teubner-Texte Math.",
  volume =       "59",
  pages =        "7--11",
}

@TechReport{sep:BielakSoczewinska:86,
  author =       "H. Bielak and E. Soczewinska",
  title =        "On j-neighbourhoods in in digraphs",
  year =         "1986",
  journal =      "Colloq. Math.",
  number =       "42",
  pages =        "133--140",
}

@Article{sep:BielakSyslo:83,
  author =       "H. Bielak and M. M. Syslo",
  title =        "Peripheral vertices in graphs",
  year =         "1983",
  journal =      "Studia Sci. Math. Hungar.",
  volume =       "18",
  pages =        "269--275",
}

@Article{sep:BirgeQi:88,
  author =       "J. R. Birge and L. Qi",
  title =        "Solving Stochastic Linear Programs Via a Variant of
                 Karmarkar's Algorithm",
  year =         "1988",
  journal =      "Management Sci.",
  volume =       "34",
  number =       "12",
  pages =        "1472--1479",
}

@Article{sep:Biro:90,
  author =       "M. Bir\'{o}",
  title =        "The Interval Subset Sum Problem",
  journal =      "Optimization",
  year =         "1990",
  volume =       "21",
  pages =        "255--264",
}

@InProceedings{sep:Bixby:84,
  author =       "R. E. Bixby",
  title =        "Recent Algorithms for Two Versions of Graph
                 Realization and Remarks on Applications to linear
                 Programming",
  booktitle =    "Progress in Combinatorial Optimization",
  year =         "1984",
  editor =       "W. L. Pulleyblank",
  pages =        "39--67",
  address =      "Toronto",
  publisher =    "Academic Press",
}

@TechReport{sep:Bixby:90,
  author =       "R. E. Bixby",
  title =        "Implementing the Simplex Method: The Initial Basis",
  institution =  "Rice University, Department of Mathematical Sciences",
  year =         "1990",
  number =       "TR90-32",
  address =      "Houston, Texas",
  pages =        "24",
}

@TechReport{sep:Bixby:92a,
  author =       "R. E. Bixby",
  title =        "Das Implementieren des Simplex-Vefahrens: Die
                 Startbasis",
  institution =  "Konrad-Zuse-Zentrum f{\"u}r Informationstechnik",
  year =         "1992",
  number =       "SC 92-11",
  address =      "Berlin",
  pages =        "26",
}

@TechReport{sep:Bixby:92b,
  author =       "R. E. Bixby",
  title =        "Das Simplex-Verfahren und die Herausforderung
                 gro\ss{}e praktische Probleme zu l{\"o}sen",
  institution =  "Rice University, Department of Mathematical Sciences",
  year =         "1992",
  address =      "Houston, Texas",
  pages =        "51",
}

@TechReport{sep:BixbyCunningham:90,
  author =       "R. E. Bixby and W. H. Cunningham",
  title =        "Matroid Optimization and Algorithms",
  institution =  "Rice University, Department of Mathematical Sciences",
  year =         "1990",
  number =       "TR90-15",
  address =      "Houston, Texas",
  pages =        "65",
}

@Article{sep:BixbyGregoryLustigMarstenShanno:92,
  author =       "R. E. Bixby and J. W. Gregory and I. J. Lustig and R.
                 E. Marsten and D. F. Shanno",
  title =        "Very Large-Scale Linear Programming: {A} Case Study in
                 Combining Interior Point and Simplex Methods",
  journal =      "Operations Research",
  volume =       "40",
  number =       "5",
  pages =        "885--897",
  year =         "1992",
}

@Article{sep:Blair:86,
  author =       "C. E. Blair",
  title =        "The Iterative Step in the Linear Programming Algorithm
                 of {N}. Karmarkar",
  journal =      "Algorithmica",
  volume =       "1",
  year =         "1986",
  pages =        "537--540",
}

@Article{sep:BlairJeroslow:82,
  author =       "C. E. Blair and R. G. Jeroslow",
  title =        "The Value Function of an Integer Program",
  journal =      "Math. Programming",
  year =         "1982",
  volume =       "23",
  pages =        "237--273",
}

@Article{sep:BlairJeroslow:84a,
  author =       "C. E. Blair and R. G. Jeroslow",
  title =        "Constructive Characterizations of the Value Function
                 of a Mixed-Integer Program {I}.",
  year =         "1981",
  journal =      "Discrete Appl. Math.",
  volume =       "9",
  pages =        "217--233",
}

@Article{sep:BlairJeroslow:84b,
  author =       "C. E. Blair and R. G. Jeroslow",
  title =        "Extensions of a Theorem of Balas",
  journal =      "Discrete Appl. Math.",
  year =         "1984",
  volume =       "9",
  pages =        "11--26",
}

@Article{sep:BlairJeroslow:86,
  author =       "C. E. Blair and G. Jeroslow",
  title =        "Computational Complexity of Some Problems in
                 Parametric Discrete Programming: {I}",
  year =         "1982",
  journal =      "Math. Oper. Res.",
  volume =       "11",
  pages =        "241--260",
}

@Article{sep:BlandGoldfarbTodd:81,
  author =       "R. G. Bland and D. Goldfarb and M. J. Todd",
  title =        "The Ellipsoid Method: {A} Survey",
  journal =      "Oper. Res.",
  year =         "1981",
  volume =       "29",
  pages =        "1039--1091",
}

@Article{sep:Blazewicz:81,
  author =       "J. Blazewicz",
  title =        "Solving the resource constrained deadline scheduling
                 problem via reduction to the network flow problem",
  journal =      "European J. Oper. Res.",
  year =         "1981",
  volume =       "6",
  pages =        "75--79",
}

@TechReport{sep:Blazewicz:84,
  author =       "J. Blazewicz",
  title =        "On the Complexity of Minimizing Mean Execution Time
                 Loss",
  institution =  "Institut of Control Engineering, Technical University
                 of Poznan",
  year =         "1984",
  address =      "Poznan, Poland",
  pages =        "12",
}

@TechReport{sep:BlazewiczBurkardFinkeWoeginger:92,
  author =       "J. Blazewicz and R. E. Burkard and G. Finke and G. J.
                 Woeginger",
  title =        "Vehicle Scheduling in Two-Cycle Flexible Manufacturing
                 Systems",
  institution =  "Techn. Universit{\"a}t Graz, Inst. f. Mathematik",
  year =         "1992",
  number =       "237",
  address =      "Graz",
  pages =        "20",
}

@Article{sep:Blum:86,
  author =       "L. Blum",
  title =        "Towards an Asymptotic Analysis of Karmarkar's
                 Algorithm",
  year =         "1986",
  journal =      "Inform. Process. Lett.",
  volume =       "23",
  pages =        "189--194",
}

@Article{sep:Blyth:64,
  author =       "T. S. Blyth",
  title =        "Matrics over Ordered Algebraic Structures",
  journal =      "J. London Math. Soc. (2)",
  year =         "1964",
  volume =       "39",
  pages =        "427--432",
}

@TechReport{sep:BodlaenderJansenWoeginger:92,
  author =       "H. L. Bodlaender and K. Jansen and G. J. Woeginger",
  title =        "Scheduling with Incompatible Jobs",
  institution =  "Tech. Universit{\"a}t Graz, Inst. f. Mathematik",
  year =         "1992",
  number =       "203",
  address =      "Graz",
  pages =        "14",
}

@Article{sep:BokowskiSturmfels:86,
  author =       "J. Bokowski and B. Sturmfels",
  title =        "Coordinatization of Oriented Matroids",
  journal =      "Discrete Comp. Geometry 1",
  year =         "1986",
  volume =       "1",
  pages =        "293--306",
}

@Article{sep:Bollobas:88,
  author =       "B. Bollobas",
  title =        "Martingales, Isoperimetric Inequalities and Random
                 Graphs",
  journal =      "Colloq. Math.",
  year =         "1988",
  volume =       "52",
  pages =        "113--139",
}

@Article{sep:BonomiLutton:84,
  author =       "E. Bonomi and J.-L. Lutton",
  title =        "The {N}-City Travelling Salesman Problem: Statistical
                 Mechanics and the Metropolis Algorithm",
  journal =      "SIAM Rev.",
  year =         "1984",
  volume =       "26",
  pages =        "1--45",
}

@Article{sep:BonomiLutton:86,
  author =       "E. Bonomi and J. L. Lutton",
  title =        "The Asymptotic Behaviour of Quadratic Sum Assigment
                 Problems : {A} Statistical Mechanics Approach",
  journal =      "European J. Oper. Res.",
  year =         "1986",
  pages =        "295--300",
}

@Article{sep:BoothLuecker:76,
  author =       "K. S. Booth and G. S. Lueker",
  title =        "Testing for the Consecutive Ones Property, Interval
                 Graphs, and Graph Planarity Using {PQ}-Tree
                 Algorithms",
  journal =      "J. Comput. System Sci.",
  year =         "1976",
  volume =       "13",
  pages =        "335--379",
}

@TechReport{sep:Borgwardt:77,
  author =       "K.-H. Borgwardt",
  title =        "Untersuchungen zur Asymptotik der mittleren
                 Schrittzahl von Simplexverfahren in der Linearen
                 Optimierung",
  institution =  "Universit{\"a}t Kaiserslautern",
  year =         "1977",
  pages =        "109",
}

@Article{sep:BorieParkerTovey:91,
  author =       "R. B. Borie and R. G. Parker and C. A. Tovey",
  title =        "Deterministic Decomposition of Recursive Graph
                 Classes",
  journal =      "SIAM J. Disc. Math.",
  year =         "1991",
  volume =       "4",
  pages =        "481--501",
}

@Article{sep:BorieParkerTovey:92,
  author =       "R. B. Borie and R. G. Parker and C. A. Tovey",
  title =        "Automatic Generation of Linear-Time Algorithms from
                 Predicate Calculus Descriptions of Problems on
                 Recursively Constructed Graph Families",
  journal =      "Algorithmica",
  year =         "1992",
  volume =       "7",
  pages =        "555--581",
}

@TechReport{sep:Borkowska:79,
  author =       "H. Borkowska",
  title =        "Komputerowa Realizacja Maksiminimowego Zagadnienia
                 Przydzialu",
  institution =  "Systems Research Institute, Polish Academy of
                 Sciences",
  year =         "1979",
  number =       "ZPM-79",
  address =      "Warszawa",
  pages =        "38",
}

@Article{sep:Boruvka:26,
  author =       "O. Boruvka",
  title =        "{\"U}ber ein Minimalproblem",
  journal =      "Pr\`{a}ce, Moravsk\'{e} Prirodovedeck\'{e}
                 Spolecnosti",
  year =         "1926",
  pages =        "1--58",
}

@InProceedings{sep:BourjollyHammerSimeone:83,
  author =       "J.-M. Bourjolly and P. L. Hammer and B. Simeone",
  title =        "Weighted {K}{\"o}nig-Egerv\`{a}ry Graphs and
                 Pseudo-Boolean Optimization",
  booktitle =    "Methods of Operations Research 45",
  year =         "1982",
  editor =       "R. Henn et al.",
  pages =        "171--176",
  address =      "K{\"o}nigstein/T.",
  publisher =    "Athen{\"a}um",
}

@Article{sep:Bradley:70,
  author =       "G. H. Bradley",
  title =        "Algorithm and Bound for the Greatest Common Divisor of
                 n Integers",
  journal =      "Numer. Math.",
  year =         "1970",
  volume =       "13",
  number =       "7",
  pages =        "433--448",
}

@TechReport{sep:BradleyBrownGraves:76,
  author =       "G. H. Bradley and G. G. Brown and G. W. Graves",
  title =        "Design and Implementation of Large Scale Primal
                 Transshipment Algorithms",
  institution =  "Naval Postgraduate School",
  year =         "1976",
  address =      "Monterey, California",
  pages =        "59",
}

@Article{sep:Braesel:87,
  author =       "H. Br{\"a}sel",
  title =        "Rangminimale Maschinenbelegungsprobleme",
  journal =      "Wiss. Z. Tech. Hochsch. Magdeburg",
  year =         "1987",
  volume =       "31",
  number =       "5",
  pages =        "68--72",
}

@TechReport{sep:Braesel:90,
  author =       "H. Br{\"a}sel",
  title =        "Das Blockmatrizenmodell f{\"u}r
                 Maschinenbelegungsprobleme",
  institution =  "Techn. Univ. Otto von Guericke, Sektion Mathematik",
  year =         "1990",
  address =      "Magdeburg",
  pages =        "17",
}

@Article{sep:Brass:92,
  author =       "P. Brass",
  title =        "The Maximum Number of Second Smallest Distances in
                 Finite Planar Sets",
  journal =      "Discrete Comput. Geom.",
  volume =       "7",
  number =       "4",
  year =         "1992",
  pages =        "8",
}

@Article{sep:BrezovecCornuejolsGlover:88,
  author =       "C. Brezovec and G. Cornuejols and F. Glover",
  title =        "A Matroid Algorithms and its Application to the
                 Efficient Solution of two Optimization Problems on
                 Graphs",
  journal =      "Math. Programming",
  volume =       "42",
  year =         "1988",
  number =       "3",
  pages =        "471--487",
}

@Article{sep:Brosowski:84,
  author =       "B. Brosowski",
  title =        "A Refinement of an Optimality Criterion and Its
                 Application to Parametric Programming",
  journal =      "J. Optim. Theory Appl.",
  year =         "1984",
  volume =       "42",
  number =       "3",
  pages =        "367--381",
}

@Article{sep:Brown:74,
  author =       "J. R. Brown",
  title =        "Shortest Alternating Path Algorithms",
  journal =      "Networks",
  year =         "1974",
  volume =       "4",
  pages =        "311--334",
}

@Article{sep:Brown:79a,
  author =       "J. R. Brown",
  title =        "The Sharing Problem",
  journal =      "Oper. Res.",
  year =         "1979",
  volume =       "27",
  pages =        "324--340",
}

@Article{sep:Brown:79b,
  author =       "J. R. Brown",
  title =        "The knapsack sharing problem",
  journal =      "Operations Research",
  year =         "1979",
  volume =       "27",
  pages =        "341--351",
}

@Article{sep:Brown:83,
  author =       "J. R. Brown",
  title =        "The Flow Circulation Sharing Problem",
  journal =      "Math. Programming",
  year =         "1983",
  volume =       "25",
  pages =        "199--227",
}

@Article{sep:Brown:84,
  author =       "J. R. Brown",
  title =        "The Linear Sharing Problem",
  journal =      "Oper. Res.",
  year =         "1984",
  volume =       "32",
  pages =        "1087--1106",
}

@Article{sep:Brown:91,
  author =       "R. J. Brown",
  title =        "Solving knapsack sharing problems with general
                 tradeoff functions",
  journal =      "Math. Programming",
  volume =       "51",
  year =         "1991",
  number =       "1",
  pages =        "55--73",
}

@Article{sep:BrualdiGibson:76,
  author =       "R. A. Brualdi and P. M. Gibson",
  title =        "The Assignment Polytope",
  journal =      "Math. Programming",
  year =         "1976",
  volume =       "11",
  pages =        "97--101",
}

@Article{sep:BrualdiNewman:65,
  author =       "R. A. Brualdi and M. Newman",
  title =        "Some Theorems on the Permanent",
  journal =      "J. Res. Nat. Bur. Standards",
  year =         "1965",
  volume =       "69B",
  number =       "3",
  pages =        "159--163",
}

@Article{sep:Brucker:70,
  author =       "P. Brucker",
  title =        "Verb{\"a}nde stetiger Funktionen und kettenwertige
                 Honomophismen",
  journal =      "Math. Ann.",
  year =         "1970",
  volume =       "187",
  pages =        "77--84",
}

@Article{sep:Brucker:72,
  author =       "P. Brucker",
  title =        "{R}-Netzwerke und Matrixalgorithmen",
  journal =      "Computing",
  year =         "1972",
  volume =       "10",
  pages =        "271--283",
}

@TechReport{sep:Brucker:84,
  author =       "P. Brucker",
  title =        "{\"U}ber gewisse Prinzipien des Entwurfs effizienter
                 Algorithmen",
  institution =  "Mathematisch-Statistische Sektion in der
                 Forschungsgesellschaft Joanneum",
  year =         "1984",
  number =       "233",
  pages =        "20",
}

@Article{sep:BruckerBurkardHuring:90,
  author =       "P. Brucker and R. E. Burkard and J. Huring",
  title =        "Cyclic Schedules for r Irregularly Occurring Events",
  journal =      "J. Comput. Appl. Math.",
  volume =       "30",
  year =         "1990",
  number =       "2",
  pages =        "173--189",
}

@Article{sep:BruckerHamacher:89,
  author =       "P. J. Brucker and H. W. Hamacher",
  title =        "{K}-Optimal Solution Sets for some Polynomially
                 Solvable Scheduling Problems",
  journal =      "European J. Oper. Res.",
  volume =       "41",
  year =         "1989",
  number =       "2",
  pages =        "194--202",
}

@TechReport{sep:BruckerHurinkWerner:93,
  author =       "Peter Brucker and Johann Hurink and Frank Werner",
  title =        "Improving Local Search Heuristics for Some Scheduling
                 Problems",
  year =         "1993",
  annote =       "eingereicht in Discr. Appl. Math.",
  address =      "Universit{\"a}t Osnabr{\"u}ck",
}

@TechReport{sep:BruckerJurisch:93,
  author =       "Peter Brucker and Bernd Jurisch",
  title =        "Scheduling Unit Time Open Shops to Minimize the
                 Weighted Number of Late Jobs",
  year =         "1993",
  annote =       "eingereicht in OR Letters",
  address =      "Universit{\"a}t Osnabr{\"u}ck",
}

@Article{sep:BruckerPapenjohann:85,
  author =       "P. Brucker and W. Papenjohann",
  title =        "An Out-of-Kilter Method for the Algebraic Circulation
                 Problem",
  journal =      "Discrete Appl. Math.",
  year =         "1985",
  volume =       "10",
  pages =        "1--18",
}

@Article{sep:BruckerPapenjohannZimmermann:84,
  author =       "P. Brucker and W. Papenjohann and U. Zimmermann",
  title =        "A Dual Optimality Criterion for Algebraic Linear
                 Programs",
  journal =      "Ann. Disc. Math.",
  year =         "1984",
  volume =       "19",
  pages =        "35--40",
}

@Article{sep:BuShen:85,
  author =       "Q. Y. Bu and H. R. Shen",
  title =        "Some Properties of Efficient Solutions for Vector
                 Optimization",
  journal =      "J. Optim. Theory Appl.",
  year =         "1985",
  volume =       "46",
  number =       "3",
  pages =        "255--263",
}

@Article{sep:BulteauVial:87,
  author =       "J. P. Bulteau and J. P. Vial",
  title =        "Curvilinear Path and Trust Region in Unconstrained
                 Optimization: {A} Convergence Analysis",
  journal =      "Math. Programming Stud.",
  year =         "1987",
  volume =       "30",
  pages =        "82--101",
}

@Article{sep:BurginGabovich:83,
  author =       "M. S. Burgin and E. Ya. Gabovich",
  title =        "Equivalence Among Optimization Problems on Matrix
                 Sets",
  journal =      "Discrete Appl. Math.",
  year =         "1983",
  volume =       "6",
  pages =        "13--24",
}

@Article{sep:Burkard:72,
  author =       "R. E. Burkard",
  title =        "Iterierte zahlentheoretische Funktionen",
  journal =      "Mathematisch Physikalische Semesterberichte",
  year =         "1972",
  volume =       "XIX/1972",
  number =       "2",
  pages =        "235--253",
}

@TechReport{sep:Burkard:73,
  author =       "R. E. Burkard",
  title =        "Quadratische Zuordnungsprobleme {II}, Theorie und
                 Algorithmen",
  institution =  "Rechenzentrum",
  year =         "1973",
  number =       "84",
  address =      "Graz",
  pages =        "47",
}

@Article{sep:Burkard:75,
  author =       "R. E. Burkard",
  title =        "Heuristische Verfahren zur {L}{\"o}sung quadratischer
                 Zuordnungsprobleme",
  journal =      "Z. Oper. Res. Ser. A-B",
  year =         "1975",
  volume =       "19",
  number =       "183 -1z",
  pages =        "17",
}

@InProceedings{sep:Burkard:78,
  author =       "R. E. Burkard",
  title =        "Remarks on Some Scheduling Problems with Algebraic
                 Objective Funktions",
  booktitle =    "Operations Research Verfahren, 32",
  year =         "1978",
  editor =       "R. Henn",
  pages =        "63--77",
  publisher =    "Athen{\"a}um/Hain/Scriptor/Hanstein",
}

@InProceedings{sep:Burkard:79,
  author =       "R. E. Burkard",
  title =        "Travelling Salesman and Assignment Problems: {A}
                 Survey",
  booktitle =    "Discrete Optimization I",
  year =         "1979",
  editor =       "P. L. Hammer and E. L. Johnson and B. H. Korte",
  pages =        "193--215",
  organization = "Annals of Discrete Mathematic, 4",
  address =      "Amsterdam",
  publisher =    "North-Holland Publishing Company",
}

@InProceedings{sep:Burkard:80,
  author =       "R. E. Burkard",
  title =        "Subgradient Methods in Combinatorial Optimization",
  booktitle =    "Discrete Structures and Algorithms",
  year =         "1980",
  editor =       "U. Pape",
  pages =        "141--152",
  address =      "M{\"u}nchen",
  publisher =    "Hanser",
}

@TechReport{sep:Burkard:81a,
  author =       "R. E. Burkard",
  title =        "On Random Quadratic Bottleneck Assignment Problems",
  institution =  "Mathematisches Institut der Universit{\"a}t",
  year =         "1981",
  number =       "81-2",
  address =      "K{\"o}ln",
  pages =        "7",
}

@Article{sep:Burkard:81b,
  author =       "R. E. Burkard",
  title =        "Some numerical results for quadratic assignment and
                 bottleneck problems",
  year =         "1981",
  journal =      "Math. Programming",
  pages =        "53--62",
}

@TechReport{sep:Burkard:89,
  author =       "R. E. Burkard",
  title =        "Time Division Multiple Access Systems and Matrix
                 Decomposition",
  institution =  "Techn. Univ. Graz, Inst. f. Mathematik",
  year =         "1989",
  number =       "151",
  address =      "Graz",
  pages =        "12",
}

@Article{sep:Burkard:90,
  author =       "R. E. Burkard",
  title =        "Special Cases of Travelling Salesman Problems and
                 Heuristics",
  year =         "1990",
  journal =      ACTMA2,
  volume =       "6",
  number =       "3",
  pages =        "273--288",
}

@Article{sep:Burkard:91a,
  author =       "R. E. Burkard",
  title =        "Lexicographic bottleneck transportation on problems",
  year =         "1991",
  journal =      "Oper. Res. Lett.",
  volume =       "10",
  number =       "5",
  pages =        "303--308",
}

@TechReport{sep:Burkard:91b,
  author =       "R. E. Burkard",
  title =        "Workshop on Algebraic and Combinatorial Method in
                 Optimization",
  institution =  "Techn. Univ. Graz, Institut f{\"u}r Mathematik",
  year =         "1991",
  number =       "173",
  address =      "Graz",
  pages =        "37",
}

@TechReport{sep:Burkard:92a,
  author =       "R. E. Burkard",
  title =        "A Note on Greedily Solvable Time Transportation
                 Problems",
  institution =  "TU Graz, Inst. f{\"u}r Mathematik",
  year =         "1992",
  number =       "243",
  address =      "Graz",
  pages =        "7",
}

@TechReport{sep:Burkard:92b,
  author =       "R. E. Burkard",
  title =        "An analysis of complex combinatorial optimization
                 problems from practice",
  institution =  "TU Graz, Inst. f{\"u}r Mathematik",
  year =         "1992",
  number =       "227",
  address =      "Graz",
  pages =        "11",
}

@InBook{sep:Burkard:93,
  author =       "R. E. Burkard",
  title =        "Handbook of Convex Geometry",
  chapter =      "Convexity and Discrete Optimization",
  publisher =    "North Holland",
  year =         "1993",
  editor =       "P. M. Gruber",
  pages =        "675--698",
  volume =       "A",
  address =      "Amsterdam",
  ISBN =         "0-444-89597-3/hbk",
}

@TechReport{sep:BurkardCela:93,
  author =       "R. E. Burkard and E. Cela",
  title =        "On the Biquadratic Assignment Problem",
  institution =  "Institut f{\"u}r Mathematik",
  year =         "1993",
  number =       "260",
  address =      "Technische Universit{\"a}t Graz",
}

@Article{sep:BurkardFincke:83,
  author =       "R. E. Burkard and U. Fincke",
  title =        "The Asymptotic Probalistic Behaviour of Quadratic Sum
                 Assignment Problem",
  journal =      "Z. Oper. Res. Ser. A-B",
  year =         "1983",
  volume =       "A",
  number =       "27",
  pages =        "73--82",
}

@Article{sep:BurkardFincke:85,
  author =       "R. E. Burkard and U. Fincke",
  title =        "Probalistic Asymptotic Properties of Some
                 Combinatorial Optimization Problems",
  journal =      "Discrete Appl. Math.",
  year =         "1985",
  volume =       "12",
  pages =        "21--29",
}

@Article{sep:BurkardFroehlich:80,
  author =       "R. E. Burkard and K. Fr{\"o}hlich",
  title =        "Some Remarks on 3-Dimensional Assignment Problems",
  journal =      "Methods of Operations Research",
  year =         "1980",
  volume =       "36",
  pages =        "31--36",
}

@TechReport{sep:BurkardFruhwirthRote:91,
  author =       "R. E. Burkard and B. Fruhwirth and G. Rote",
  title =        "Vehicle Routing in an Automated Warehouse Analysis and
                 Optimization",
  institution =  "TU Graz, Inst. f{\"u}r Mathematik",
  year =         "1991",
  number =       "174",
  address =      "Graz",
  pages =        "9",
}

@Article{sep:BurkardGenser:74,
  author =       "R. E. Burkard and B. Genser",
  title =        "Zur Methode der approximierenden Optimierung",
  journal =      "Math. Operationsforsch. Statist. Ser. Optim.",
  year =         "1974",
  volume =       "5",
  pages =        "23--33",
}

@TechReport{sep:BurkardGerstl:73,
  author =       "R. E. Burkard and A. Gerstl",
  title =        "Quadratische Zuordnungsprobleme {III}, Testbeispiele
                 und Rechenzeiten",
  institution =  "Rechenzentrum",
  year =         "1973",
  number =       "85",
  address =      "Graz",
  pages =        "58",
}

@Article{sep:BurkardHahnZimmermann:77,
  author =       "R. E. Burkard and W. Hahn and U. Zimmermann",
  title =        "A Algebraic Approach to Assignment Problems",
  journal =      "Math. Programming",
  year =         "1977",
  volume =       "12",
  pages =        "318--327",
}

@Article{sep:BurkardHamacher:81,
  author =       "R. E. Burkard and H. Hamacher",
  title =        "Mininal Cost Flows in Regular Matroids",
  journal =      "Math. Programming Stud.",
  year =         "1981",
  volume =       "14",
  pages =        "42--47",
}

@TechReport{sep:BurkardHamacherRote:87,
  author =       "Rainer E. Burkard and Horst W. Hamacher and
                 G{\"u}nther Rote",
  title =        "Approximation of Convex Functions and Applications in
                 Mathematical Programming",
  institution =  "Technische Universit{\"a}t Graz",
  month =        apr,
  year =         "1987",
  number =       "89-1987",
  address =      "Graz,{\"O}sterreich",
  annote =       "Report",
}

@Article{sep:BurkardHamacherRote:89,
  author =       "R. E. Burkard and H. W. Hamacher and G. Rote",
  title =        "Approximation of Convex Curves with Applications to
                 the bicriterial Min. Cost. Flow Problem",
  year =         "1989",
  journal =      "European J. Oper. Res.",
  volume =       "42",
  number =       "3",
  pages =        "326--338",
}

@Article{sep:BurkardHamacherTind:82,
  author =       "R. E. Burkard and H. Hamacher and J. Tind",
  title =        "On Abstract Duality in Mathematical Programming",
  journal =      "Z. Oper. Res. Ser. A-B",
  year =         "1982",
  volume =       "A",
  number =       "26",
  pages =        "197--209",
}

@Article{sep:BurkardHamacherTind:85,
  author =       "R. E. Burkard and H. W. Hamacher and J. Tind",
  title =        "On General Decomposition Schemes in Mathematical
                 Programming",
  journal =      "Math. Programming Stud.",
  volume =       "24",
  year =         "1985",
  pages =        "238--252",
}

@TechReport{sep:BurkardHamacherZimmermann:76,
  author =       "R. E. Burkard and H. Hamacher and U. Zimmermann",
  title =        "The Algebraic Network Flow Problem",
  institution =  "Mathematisches Institut der Universit{\"a}t",
  year =         "1976",
  number =       "76-7",
  address =      "K{\"o}ln",
  pages =        "20",
}

@InProceedings{sep:BurkardHamacherZimmermann:77a,
  author =       "R. E. Burkard and H. Hamacher and U. Zimmermann",
  title =        "Flu\ss{}probleme mit Allgemeinen Kosten",
  booktitle =    "Numerische Methoden bei graphentheoretischen
                 Problemen",
  year =         "1977",
  editor =       "L. Collatz and G. Meinardus and W. Wetterling",
  pages =        "9--22",
  address =      "Basel",
  publisher =    "Birkh{\"a}user",
}

@InProceedings{sep:BurkardHamacherZimmermann:77b,
  author =       "R. E. Burkard and H. Hamacher and U. Zimmermann",
  title =        "Einige Bemerkungen zum algebraischen Flu\ss{}problem",
  booktitle =    "Operations Research Verfahren, Methods of Operations
                 Research, XXIII",
  year =         "1977",
  editor =       "R. Henn and P. Kall and B. Korte and O. Kraft et al.",
  pages =        "252--254",
  address =      "Meisenheim",
  publisher =    "Hain",
}

@TechReport{sep:BurkardKarischRendl:91,
  author =       "R. E. Burkard and S. Karisch and F. Rendl",
  title =        "{QAPLIB}-{A} Quadratic Assignment Problem Library",
  institution =  "TU Graz, Inst. f{\"u}r Mathematik",
  year =         "1991",
  number =       "175",
  address =      "Graz",
  pages =        "65",
}

@Article{sep:BurkardKeidingKrarupPruzan:81,
  author =       "R. E. Burkard and H. Keiding and J. Krarup and P. M.
                 Pruzan",
  title =        "A relationship between optimality and efficiency in
                 multicriteria 0-1 Programming Problems",
  journal =      "Comput. Oper. Res.",
  year =         "1981",
  volume =       "8",
  pages =        "241--241",
}

@Article{sep:BurkardKrarupPrudzan:82,
  author =       "R. E. Burkard and J. Krarup and P. M. Pruzan",
  title =        "Efficiency and Optimality in Minimum, Minimax {O}-1
                 Programming Problems",
  journal =      "J. Oper. Res. Soc. Japan",
  year =         "1982",
  volume =       "33",
  pages =        "137--152",
}

@Article{sep:BurkardKrarupPruzan:84,
  author =       "R. E. Burkard and J. Krarup and P. M. Pruzan",
  title =        "Some Relationships between Multicriteria and
                 Parametric Discrete Optimization Problems with
                 Bottleneck Objectives",
  journal =      "Math. Operationsforsch. Statist. Ser. Optim.",
  volume =       "15",
  year =         "1984",
  pages =        "389--395",
}

@Article{sep:BurkardRendl:84,
  author =       "R. E. Burkard and F. Rendl",
  title =        "A Thermodynamically Motivated Simulation Procedure for
                 Combinatorial Optimization Problems",
  journal =      "European J. Oper. Res.",
  year =         "1984",
  volume =       "17",
  pages =        "169--174",
}

@Article{sep:BurkardRendl:91,
  author =       "R. E. Burkard and F. Rendl",
  title =        "Lexicographic Bottleneck Problems",
  year =         "1991",
  journal =      "Oper. Res. Lett.",
  volume =       "10",
  number =       "5",
  pages =        "303--308",
}

@Article{sep:BurkardRoteYaoYu:90,
  author =       "R. E. Burkard and G. Rote and E. Y. Yao and Z. L. Yu",
  title =        "Shortest Polygonal Lines in Space",
  year =         "1990",
  journal =      "Computing",
  volume =       "45",
  number =       "1",
  pages =        "51--68",
}

@TechReport{sep:BurkardRudofWoeginger:92,
  author =       "R. E. Burkard and R. Rudolf and G. J. Woeginger",
  title =        "Three-Dimensional Axial Assignment Problems with
                 Decomposable cost-Coefficients",
  institution =  "TU Graz, Inst. f{\"u}r Mathematik",
  year =         "1992",
  number =       "238",
  address =      "Graz",
  pages =        "18",
}

@Article{sep:BurkardSandholzer:91,
  author =       "R. E. Burkard and W. Sandholzer",
  title =        "Efficiently Solvable Special Cases of Bottleneck
                 Travelling Salesman Problems",
  year =         "1991",
  journal =      "Discrete Appl. Math.",
  volume =       "32",
  number =       "1",
  pages =        "61--76",
}

@Article{sep:BurkardStratmann:78,
  author =       "R. E. Burkard and K.-H. Stratmann",
  title =        "Numerical Investigations on Quadratic Assignment
                 Problems",
  journal =      "Naval Research Logistics Quarterly",
  year =         "1978",
  volume =       "25",
  pages =        "129--148",
}

@Article{sep:BurkardVanderVeen:91a,
  author =       "R. E. Burkard and J. A. A. van der Veen",
  title =        "Universal Conditions for Algebraic Traveling Salesman
                 Problems to be Efficiently Solvable",
  year =         "1991",
  journal =      "Optimization",
  volume =       "22",
  number =       "5",
  pages =        "787--814",
}

@Article{sep:BurkardVanderVeen:91b,
  author =       "R. E. Burkard and J. A. A. van der Veen",
  title =        "Universal Conditions for Algebraic Traveling Salesman
                 Problems to be Efficiently Solvable",
  year =         "1991",
  journal =      "Optimization",
  volume =       "22",
  number =       "5",
  pages =        "787--814",
}

@TechReport{sep:BurkardWoeginger:,
  author =       "R. E. Burkard and G. J. Woeginger",
  title =        "A Note on Feasibility Checking for Jobs with Due
                 Dates",
  institution =  "TU Graz, Inst. f{\"u}r Mathematik",
  year =         "19xx",
  address =      "Graz",
  pages =        "5",
}

@TechReport{sep:BurkardYang:92,
  author =       "R. E. Burkard and Q. F. Yang",
  title =        "Hamiltonian cycles in circulent graphs with two
                 stripes",
  institution =  "TU Graz, Inst. f{\"u}r Mathematik",
  year =         "1992",
  number =       "226",
  address =      "Graz",
  pages =        "12",
}

@Article{sep:BurkardYao:90,
  author =       "R. E. Burkard and E. Yao",
  title =        "Constrained Partitioning Problems",
  year =         "1990",
  journal =      "Discrete Appl. Math.",
  volume =       "28",
  number =       "1",
  pages =        "21--34",
}

@InProceedings{sep:BurkardZimmermann:78,
  author =       "R. E. Burkard and U. Zimmermann",
  title =        "The Solution of Algebraic Assignment and
                 Transportation Problems",
  booktitle =    "Optimization and Operations Research",
  year =         "1978",
  editor =       "R. Henn and B. Korte and W. Oettli",
  pages =        "55--65",
  organization = "Lecture notes in economics and mathematival system,
                 157",
  address =      "Berlin",
  publisher =    "Springer",
}

@Article{sep:BurkardZimmermann:80,
  author =       "R. E. Burkard and U. Zimmermann",
  title =        "Weakly Admissible Transformations for Solving
                 Algebraic Assignment and Transportation Problems",
  journal =      "Math. Programming Stud.",
  year =         "1980",
  volume =       "12",
  pages =        "1--18",
}

@InProceedings{sep:BurkardZimmermann:82,
  author =       "R. E. Burkard and U. Zimmermann",
  title =        "Combinatorial Optimization in Linearly Ordered
                 Semimodules: a survey",
  booktitle =    "Modern Applied Mathematics, Optimization and
                 Operations Research",
  year =         "1982",
  editor =       "B. Korte",
  pages =        "391--436",
  address =      "Amsterdam",
  publisher =    "North Holland",
}

@TechReport{sep:BussieckHasslerWoegingerZimmermann:92,
  author =       "M. Bussieck and H. Hassler and G. J. Woeginger and U.
                 T. Zimmermann",
  title =        "Fast Algorithms for the Maximum Convolution Problem",
  institution =  "Techn. Universit{\"a}t Graz, Inst. f. Mathematik",
  year =         "1992",
  number =       "235",
  address =      "Graz",
  pages =        "11",
}

@TechReport{sep:Butkovic:8a,
  author =       "P. Butkovic",
  title =        "Interpretations of the Systems of Two-Sided Linear
                 Equations over an Extremal Algebra",
  institution =  "Katedera geometrie a algebry",
  year =         "198x",
  address =      "Kosice, CSSR",
  pages =        "6",
}

@TechReport{sep:Butkovic:8b,
  author =       "P. Butkovic",
  title =        "Linear parametrization in an optimization problem",
  institution =  "Katedera geometrie a algebry",
  year =         "198x",
  address =      "Kosice, CSSR",
  pages =        "2",
}

@Article{sep:Butkovic:84,
  author =       "P. Butkovic",
  title =        "An Elimination Method for Finding all Solutions of the
                 System of Linear Equations over an Ectremal Algebra",
  journal =      "Ekonom.-Mat. Obzor",
  year =         "1984",
  volume =       "20",
  pages =        "203--215",
}

@Article{sep:Butkovic:85,
  author =       "P. Butkovic",
  title =        "Necessary Solvability Conditions of Systems of Linear
                 Extremal Equations",
  journal =      "Discrete Appl. Math.",
  year =         "1985",
  volume =       "10",
  pages =        "19--26",
}

@Article{sep:Butkovic:94,
  author =       "Peter Butkovic",
  title =        "Strong regularity of matrices - a survey of results",
  journal =      "Discrete Applied Mathematics",
  volume =       "48",
  pages =        "45--68",
  year =         "1994",
}

@Article{sep:ButkovicCechlarovaSzabo:87,
  author =       "P. Butkovic and K. Cechl\`{a}rov\`{a} and P.
                 Szab\'{o}",
  title =        "Strong Linear Independence in Bottleneck Algebra",
  journal =      LINAA2,
  year =         "1987",
  volume =       "94",
  pages =        "133--144",
}

@TechReport{sep:ButkovicCuninghame-Green:89,
  author =       "P. Butkovic and R. A. Cuninghame-Green",
  title =        "An 0(n2) algorithm for the maximum cycle mean of an
                 nxn bivalent matrix",
  institution =  "Safarik's University",
  year =         "1989",
  address =      "CSSR",
  pages =        "35",
}

@TechReport{sep:ButkovicHevery:8a,
  author =       "P. Butkovic and F. Hevery",
  title =        "A Criterion of Strong Linear Independence on the
                 Minimax Algebra",
  institution =  "Katedera geometrie a algebry",
  year =         "198x",
  address =      "Kosice, CSSR",
  pages =        "2",
}

@TechReport{sep:ButkovicHevery:8b,
  author =       "P. Butkovic and P. Hevery",
  title =        "A Condition for the Strong Regularity of Matrices in
                 the Minimax Algebra",
  institution =  "Katedera geometrie a algebry",
  year =         "198x",
  address =      "Kosice, CSSR",
  pages =        "20",
}

@TechReport{sep:Butz:80,
  author =       "L. Butz",
  title =        "Characterizations of Connectivity in Row Column
                 Designs",
  institution =  "Inst. f. {\"O}konometrie und OR, Rheinische
                 Friedrich-Wilhelms-Universit{\"a}t",
  year =         "1980",
  number =       "80153-OR",
  address =      "Bonn",
  pages =        "1--19",
}

@TechReport{sep:Butz:81,
  author =       "L. Butz",
  title =        "A Note on Estimability Characterizations of Completely
                 Connected Designs for Multi-Way Elimination of
                 Heterogeneity",
  institution =  "Inst. f. {\"O}konometrie und OR, Rheinische
                 Friedrich-Wilhelms-Universit{\"a}t",
  year =         "1981",
  number =       "81184-OR",
  address =      "Bonn",
  pages =        "5",
}

@Article{sep:CaiGoh:94,
  author =       "X Cai and C. J. Goh",
  title =        "A Fast Heuristic for the Train Scheduling Problem",
  journal =      "Computers Ops. Res.",
  volume =       "21",
  number =       "5",
  pages =        "499--510",
  year =         "1994",
}

@TechReport{sep:CambiniMarteinSodini:8,
  author =       "A. Cambini and L. Martein and C. Sodini",
  title =        "An Algorithm for Two Particular Non-Linear Frational
                 Programs",
  institution =  "Dipartimento Di Matematica, Universita' di Pisa",
  year =         "198x",
  address =      "Pisa",
  pages =        "13",
}

@TechReport{sep:CameriniGalbiatiMaffiolo:87,
  author =       "P. M. Camerini and G. Galbiati and F. Maffiolo",
  title =        "Random Pseudo-Polynomial Algorithms and Exact
                 Problems",
  institution =  "Politecnico di Milano",
  year =         "1987",
  number =       "87-014",
  address =      "Milano",
  pages =        "38",
}

@InProceedings{sep:CameriniMaffioli:80,
  author =       "P. M. Camerini and F. Maffioli",
  title =        "Weighted Statisfiability Problems and Some
                 Implications",
  booktitle =    "Optimization Techniques, Part II",
  year =         "1980",
  editor =       "K. Iracki and K. Malanowski and P. Walukiewicz",
  pages =        "170--175",
  organization = "Lecture Notes in Control and Information Siences, 23",
  address =      "Berlin",
  publisher =    "Springer",
}

@TechReport{sep:CaponiPieroniSaviozzi:85,
  author =       "M. Caponi and P. Pieroni and G. Saviozzi",
  title =        "A Benders Dual Decomposition Approach to the Optimum
                 Network Orientation Problem",
  institution =  "Universita di Pisa, Dipartimento di Matematica",
  year =         "1985",
  address =      "Pisa",
  pages =        "22",
}

@Article{sep:CarpanetoDellAmicoFischettiToth:89,
  author =       "G. Carpaneto and M. Dell'Amico and M. Fischetti and P.
                 Toth",
  title =        "A Branch and Bound Algorithm for the Multiple Depot
                 Vehicle Scheduling Problem",
  journal =      "Networks",
  volume =       "19",
  pages =        "531--548",
  year =         "1989",
}

@Article{sep:CarpanetoMartelloToth:84,
  author =       "G. Carpaneto and S. Martello and P. Toth",
  title =        "An Algorithm for the Bottleneck Travelling Salesman
                 Problem",
  journal =      "Oper. Res.",
  year =         "1984",
  volume =       "32",
  pages =        "380--389",
}

@Article{sep:CarpanetoToth:80,
  author =       "G. Carpaneto and P. Toth",
  title =        "Solution of the Assignment Problem [{H}]. Algorithm
                 548",
  journal =      "ACM Trans. Math. Software",
  year =         "1980",
  volume =       "6",
  pages =        "104--111",
}

@Article{sep:CarpanetoToth:81,
  author =       "G. Carpaneto and P. Toth",
  title =        "Algorithm for the Solution of the Bottleneck
                 Assignment Problem. Algorithm 44",
  journal =      "Computing",
  year =         "1981",
  volume =       "32",
  pages =        "380--389",
}

@TechReport{sep:Carpentier:59,
  author =       "J. Carpentier",
  title =        "A Method for Solving Linear Programming Problems in
                 which Cost Depends Non Linearly on a Parameter",
  institution =  "Electricite de France, Direction des Etudes et
                 Recherches, Service des Edtudes Math\'{e}matiques et de
                 leure applications Nouvelles",
  year =         "1959",
  number =       "16-JLC/AM",
  pages =        "11",
}

@Article{sep:Carre:71,
  author =       "B. A. Carr\'{e}",
  title =        "An Algebra for Network Routing Problems",
  journal =      "J. Inst. Maths Applics",
  year =         "1971",
  volume =       "7",
  pages =        "273--294",
}

@Article{sep:CarsonLaw:,
  author =       "John S. Carson and A. M. Law",
  title =        "A Note on Spira's Algorithm for the All-pairs
                 Shortest-Path Problem",
  journal =      "SIAM J. Comput.",
  year =         "1977",
  volume =       "6",
  pages =        "696--699",
}

@TechReport{sep:CarvalhoTrotter:85,
  author =       "P. C. P. Carvalho and L. E. Trotter",
  title =        "Discrete Linear Duality",
  institution =  "School of Operations Research and Industrial
                 Engineering College of Engineering Cornell University",
  year =         "1985",
  number =       "650",
  address =      "Ithaca, New York",
  pages =        "39",
}

@Article{sep:CarvalhoTrotter:89,
  author =       "P. C. P. Carvalho and L. E. Trotter",
  title =        "An Abstract Linear Duality Model",
  year =         "1989",
  journal =      "Math. Oper. Res.",
  volume =       "14",
  number =       "4",
  pages =        "639--663",
}

@Article{sep:CavalierSchalle:87,
  author =       "T. M. Cavalier and K. C. Schalle",
  title =        "Implementing an affine scaling alorithm for linear
                 programming",
  journal =      "Comput. Oper. Res.",
  volume =       "14",
  year =         "1987",
  pages =        "341--347",
}

@TechReport{sep:CavalierSoyster:85,
  author =       "T. M. Cavalier and A. L. Soyster",
  title =        "Some Computational Experience and a Modification of
                 the Karmarkar Algorithm",
  institution =  "The Pennsylvania State University, Dep. of Industrial
                 and Management Systems Engineering",
  year =         "1985",
  address =      "University Park, PA 16802",
  pages =        "15",
}

@TechReport{sep:Cechlarova:92a,
  author =       "K. Cechl\'{a}rov\'{a}",
  title =        "Trapezoidal matrices and the bottleneck assignment
                 problem",
  institution =  "P.J.Saf\'{a}rik University, Dep. of Geometry and
                 Algebra",
  year =         "1992",
  address =      "Kosice, CSSR",
  pages =        "7",
}

@TechReport{sep:Cechlarova:92b,
  author =       "K. Cechl\'{a}rov\'{a}",
  title =        "Unique solvability of max - min fuzzy equations and
                 strong regularity of matrices over fuzzi algebra",
  institution =  "P.J.Saf\'{a}rik University, Dep. of Geometry and
                 Algebra",
  year =         "1992",
  address =      "Kosice, CSSR",
  pages =        "17",
}

@Article{sep:Cechlarova:92c,
  author =       "K. Cechl\'{a}rov\'{a}",
  title =        "Eigenvectors in Bottleneck Algebra",
  journal =      LINAA2,
  year =         "1992",
  pages =        "11",
}

@TechReport{sep:Cechlarova:92d,
  author =       "K. Cechl\'{a}rov\'{a}",
  title =        "Max - min Eigenvectors of a Matrix",
  institution =  "P.J.Saf\'{a}rik University, Dep. of Geometry and
                 Algebra",
  year =         "1992",
  address =      "Kosice, CSSR",
  pages =        "16",
}

@InProceedings{sep:Chalmet:83,
  author =       "Luc G. Chalmet",
  title =        "Efficiency in Minisum Rectilinear Distance Location
                 Problems",
  booktitle =    "Locational Analysis of Public Facilities",
  year =         "1983",
  editor =       "J.-F. Thisse and H. G. Zoller",
  pages =        "431--445",
  address =      "Amsterdam",
  publisher =    "North-Holland",
}

@InProceedings{sep:ChalmetLawphongpanich:81,
  author =       "Luc G. Chalmet and S. Lawphongpanich",
  title =        "Efficient Solutions for Point-Objective Discrete
                 Facility Location Problems",
  booktitle =    "Organizations: Multiple Agents with multiple
                 Criteria",
  year =         "1981",
  editor =       "J. N. Morse",
  pages =        "56--71",
  organization = "Lecture Notes in Economics and Mathematical Systems,
                 190",
  address =      "Berlin",
  publisher =    "Springer",
}

@Article{sep:ChandransekaranAnejaNair:81,
  author =       "R. Chandrasekaran and Y. P. Aneja and K. P. K. Nair",
  title =        "Polynomial Testing of the query `Is ab >= cd ?` with
                 application to finding a Min Cost Reliability Ratio
                 Spanning Tree",
  journal =      "Discrete Appl. Math.",
  year =         "1981",
  pages =        "63--60",
}

@Article{sep:Chandrasekaran:77,
  author =       "R. Chandrasekaran",
  title =        "Minimal Ratio Spanning Trees",
  journal =      "Networks",
  year =         "1977",
  volume =       "7",
  pages =        "335--342",
}

@Article{sep:ChandrasekaranKabadi:87,
  author =       "R. Chandrasekaran and S. N. Kabadi",
  title =        "Strongly Polynomial Algorithm for a Class of
                 Combinatorial {LCP}s",
  journal =      "Oper. Res. Lett.",
  year =         "1987",
  volume =       "6",
  pages =        "91--92",
}

@TechReport{sep:ChandruKochar:86a,
  author =       "V. Chandru and B. S. Kochar",
  title =        "A Class of Algorithms for Linear Programming",
  institution =  "Purdue University, School of Industrial Engineering",
  year =         "1986",
  number =       "85-14",
  address =      "West Lafayette",
  pages =        "31",
}

@TechReport{sep:ChandruKochar:86b,
  author =       "V. Chandru and B. S. Kochar",
  title =        "Exploiting Special Structures using a Variant of
                 Karmarkar's Algorithm",
  institution =  "Purdue University, School of Industrial Engineering",
  year =         "1986",
  number =       "86-10",
  address =      "West Lafayette",
  pages =        "32",
}

@TechReport{sep:CharnesSongWolfe:84,
  author =       "A. Charnes and T. Song and M. Wolfe",
  title =        "An explicit solution sequences and convergence of
                 Karmarkar's algorithm",
  institution =  "The University of Texa at Austin, College of Business
                 Administration 5.202",
  year =         "1984",
  number =       "CCS 501",
  address =      "Austin",
  pages =        "13",
}

@TechReport{sep:CharonHudry:93,
  author =       "I. Charon and O. Hudry",
  title =        "The noising method: a new method for combinatorial
                 Optimization",
  institution =  "Ecole Nationale Sup\'{e}rieure des
                 T\'{e}l\'{e}communications",
  year =         "1993",
  address =      "Paris Cedex",
  pages =        "6",
}

@Article{sep:Chen:93,
  author =       "Y. L. Chen",
  title =        "An Algorithm for Finding the $k$ Quickest Paths in a
                 Network",
  journal =      "Computers Ops Res.",
  volume =       "20",
  number =       "1",
  pages =        "59--65",
  year =         "1993",
}

@Article{sep:ChenHansen:91,
  author =       "P. C. Chen and P. Hansen",
  title =        "On-Line and Off-Line Vertex Enumeration by Adjacency
                 Lists",
  journal =      "Oper. Res. Lett.",
  year =         "1991",
  volume =       "10",
  pages =        "403--409",
}

@TechReport{sep:ChenVlietWoeginger:93a,
  author =       "Bo Chen and Andr\'e van Vliet and Gerhard J.
                 Woeginger",
  title =        "New Lower and Upper Bounds for On-Line Scheduling",
  institution =  "Institut f{\"u}r Mathematik",
  year =         "1993",
  number =       "279",
  address =      "Technische Universit{\"a}t Graz",
}

@TechReport{sep:ChenVlietWoeginger:93b,
  author =       "Bo Chen and Andr\'e van Vliet and Gerhard J.
                 Woeginger",
  title =        "Optimal Algorithms for Preemptive On-Line Scheduling",
  institution =  "Institut f{\"u}r Mathematik",
  year =         "1993",
  number =       "282",
  address =      "Technische Universit{\"a}t Graz",
}

@Article{sep:CheritonTarjan:76,
  author =       "D. Cheriton and R. E. Tarjan",
  title =        "Finding Minimum Spanning Trees",
  journal =      "SIAM J. Comput.",
  year =         "1976",
  volume =       "5",
  pages =        "724--742",
}

@TechReport{sep:CheriyanHagerupMehlhorn:89,
  author =       "J. Cheriyan and T. Hagerup and K. Mehlhorn",
  title =        "Can a Maximum Flow be Computed in o(nm) Time",
  institution =  "Univ. des Saarlandes, FB Informatik",
  year =         "1989",
  address =      "Saarbr{\"u}cken",
  pages =        "12",
}

@Article{sep:CheshankovIvanchev:85,
  author =       "B. I. Cheshankov and D. T. Ivanchev",
  title =        "The Network Model for Optimization of the Production
                 of Pieces by Certain Technologies",
  journal =      "University Annual Applied Mathematics",
  year =         "1985",
  volume =       "21",
  number =       "3",
  pages =        "235--244",
}

@Article{sep:Ching:77,
  author =       "Wai-Sin Ching",
  title =        "Linear Equations over Commutative Rings",
  journal =      LINAA2,
  year =         "1977",
  volume =       "18",
  pages =        "257--266",
}

@TechReport{sep:ChiuYe:85,
  author =       "S. S. Chiu and Y. Ye",
  title =        "Simplex Method and Karmarkar's Algorithm: {A} Unifying
                 Structure",
  institution =  "Stanford University, Engineering-Economic Systems
                 Department",
  year =         "1985",
  address =      "Stanford, California",
  pages =        "11",
}

@Misc{sep:ChoiGoldfarb:94,
  author =       "In Chan Choi and Donald Goldfarb",
  title =        "Solving Multicommodity Network Flow Problems by an
                 Interior Point Method",
  annote =       "Chapter 5",
}

@Article{sep:ChristiansenKortanek:91,
  author =       "E. Christiansen and K. O. Kortanek",
  title =        "Computation of the collapse state in limit analysis
                 using the {LP} Primal Affine Scaling Algorithm",
  year =         "1991",
  journal =      "J. Comput. Appl. Math.",
  volume =       "34",
  number =       "1",
  pages =        "47--63",
}

@Article{sep:Christofides:72,
  author =       "N. Christofides",
  title =        "Bounds for the Travelling-Salesman Problem",
  journal =      "Oper. Res.",
  year =         "1972",
  volume =       "20",
  pages =        "1044--1056",
}

@InProceedings{sep:Chvatal:75,
  author =       "V. Chv\'{a}tal",
  title =        "Some Linear Programming Aspects of Combinatorics",
  booktitle =    "Proceedings on the Conference on Algebraic Aspects of
                 Combinatorics, Toronto 1975",
  year =         "1975",
  editor =       "E. Mendelsohn",
  pages =        "2--30",
  organization = "Congressus Numerantium, 13",
  address =      "Winnepeg",
  publisher =    "Utilitas Mathematica",
}

@Article{sep:Chvatal:85,
  author =       "V. Chv\'{a}tal",
  title =        "Cutting Planes in Combinatorics",
  institution =  "Rheinische Friedrich-Wilhelms-Universit{\"a}t",
  year =         "1985",
  journal =      EURJC,
  volume =       "6",
  pages =        "217--226",
}

@TechReport{sep:ChvatalHammer:73,
  author =       "V. Chv\'{a}tal and P. L. Hammer",
  title =        "Set-Packing Problems and Threshold Graphs",
  institution =  "Dep. of Combinatorics and Optimization",
  year =         "1973",
  number =       "CORR 73-21",
  address =      "Waterloo, Ontario",
  pages =        "24",
}

@Article{sep:ChvavalCookHartmann:89,
  author =       "V. Chv\'{a}tal and W. Cook and M. Hartmann",
  title =        "On Cutting-Plane Proofs in Combinatorial
                 Optimization",
  year =         "1989",
  journal =      LINAA2,
  volume =       "114/115",
  pages =        "455--499",
}

@Article{sep:Clifford:54,
  author =       "A. H. Clifford",
  title =        "Naturally Totally Ordered Commutative Semigroups",
  journal =      "Amer. J. Math.",
  year =         "1954",
  volume =       "76",
  pages =        "631--646",
}

@Article{sep:Clifford:58a,
  author =       "A. H. Clifford",
  title =        "Totally Ordered Commutative Semigroups",
  journal =      "Bull. Amer. Math. Soc. (N.S.)",
  year =         "1958",
  volume =       "64",
  pages =        "305--306",
}

@TechReport{sep:Clifford:58b,
  author =       "A. H. Clifford",
  title =        "Ordered Commutative Semigroups of the Second Kind",
  institution =  "Johns Hopkins University",
  year =         "1958",
  address =      "Silver Spring/Maryland",
  pages =        "682--687",
}

@Article{sep:Clifford:59,
  author =       "A. H. Clifford",
  title =        "Completion of Semi-Continuous Ordered Commutative
                 Semigroups",
  journal =      "Duke Math. J.",
  year =         "1959",
  volume =       "26",
  pages =        "44--59",
}

@Article{sep:Clifford:73,
  author =       "A. H. Clifford",
  title =        "An Appreciation of his Work on the Occasion of his
                 Sixty-Fifth Birthday, {G}.{B}. Preston",
  journal =      "Semigroup Forum",
  year =         "1973",
  volume =       "6",
  pages =        "32--47",
}

@Article{sep:ColbournPulleyblank:89,
  author =       "C. J. Colbourn and W. R. Pulleyblank",
  title =        "Matroid Steiner Problems, the Tutte Polynomial and
                 Network Reliability",
  year =         "1989",
  journal =      "J. Combin. Theory Ser. B",
  volume =       "47",
  number =       "1",
  pages =        "20--31",
}

@TechReport{sep:Colding-JorgensenJensenStig-Nielsen:77,
  author =       "C. Colding-Jorgensen and O. H. Jensen and P.
                 Stig-Nielsen",
  title =        "Scheduling of Trains, An Optimization Approach",
  institution =  "The Technical University of Denmark",
  year =         "1977",
  address =      "Lyngby/Denmark",
  pages =        "1--25",
}

@TechReport{sep:ColemanConn:8,
  author =       "T. F. Coleman and A. R. Conn",
  title =        "Nonlinear Programming via an Exact Penalty Function:
                 Global Analysis",
  institution =  "University of Waterloo",
  year =         "198x",
  address =      "Waterloo",
  pages =        "1--25",
}

@TechReport{sep:ColemanLi:89,
  author =       "T. F. Coleman and Y. Li",
  title =        "A Global and Quadratic Affine Scaling Method for
                 Linear {L1} Problems",
  institution =  "Cornell University, Dep. of Computer Science",
  year =         "1989",
  number =       "89-1026",
  address =      "Ithaca, New York",
  pages =        "33",
}

@TechReport{sep:ColemanLi:90,
  author =       "T. F. Coleman and Y. Li",
  title =        "A Globally and Superlinearly Convergent Algorithm for
                 Convex Quadratic Programs with Simple Bounds",
  institution =  "Cornell University, Dep. of Computer Science",
  year =         "1990",
  number =       "90-1092",
  address =      "Ithaca, New York",
  pages =        "25",
}

@Article{sep:Conforti:87,
  author =       "M. Conforti",
  title =        "Structural Properties and Recognition of Restricted
                 and Strongly Unimodular Matrices",
  journal =      "Math. Programming",
  year =         "1987",
  volume =       "38",
  pages =        "17--27",
}

@Article{sep:ConnPietrzykowski:77,
  author =       "A. R. Conn and T. Pietrzykowski",
  title =        "A Penalty Function Method Converging Directly to a
                 Constrained Optimum",
  journal =      "SIAM J. Numer. Anal.",
  year =         "1977",
  volume =       "14",
  pages =        "348--375",
}

@Article{sep:Conrad:60,
  author =       "P. Conrad",
  title =        "Ordered Semigroups",
  journal =      "Nagoya Math. J.",
  year =         "1960",
  volume =       "16",
  pages =        "52--64",
}

@TechReport{sep:Conrad:61,
  author =       "P. Conrad",
  title =        "Regularly Ordered Groups",
  institution =  "University",
  year =         "1961",
  address =      "Tulane",
  pages =        "727--731",
}

@Article{sep:Conrad:90,
  author =       "P. Conrad",
  title =        "Complemented Lattice Ordered Groups",
  year =         "1990",
  journal =      "Indag. Math.",
  volume =       "1",
  number =       "3",
  pages =        "281--297",
}

@Article{sep:ConradHollandHarvey:63,
  author =       "P. Conrad and Holland Harvey J.",
  title =        "The Hahn Embedding Theorem for Abelian Lattice-Ordered
                 Groups",
  journal =      "Trans. Amer. Math. Soc.",
  year =         "1963",
  volume =       "108",
  pages =        "143--169",
}

@TechReport{sep:Cook:82a,
  author =       "W. Cook",
  title =        "Balanced Matrices and Min-Max Theorems for Directed
                 Graphs",
  institution =  "University",
  year =         "1982",
  number =       "CORR 82-7",
  address =      "Waterloo",
  pages =        "1--15",
}

@TechReport{sep:Cook:82b,
  author =       "W. Cook",
  title =        "Operations that Preserve Total Dual Integrality",
  institution =  "University",
  year =         "1982",
  number =       "CORR 82-34",
  address =      "Waterloo",
  pages =        "1--8",
}

@Article{sep:Cook:90,
  author =       "W. Cook",
  title =        "Cutting-Plane Proofs in Polynomial Space",
  journal =      "Math. Programming",
  year =         "1990",
  volume =       "47",
  pages =        "11--18",
}

@Article{sep:CookCoullardTuran:87,
  author =       "W. Cook and C. R. Coullard and G. Tur\'{a}n",
  title =        "On the Complexity of Cutting-Plane Proofs",
  year =         "1987",
  journal =      "Discrete Appl. Math.",
  volume =       "18",
  pages =        "25--38",
}

@TechReport{sep:CookHartmanKannanMcDiarmid:89,
  author =       "W. Cook and M. Hartman and R. Kannan and C.
                 McDiarmid",
  title =        "On Integer Points in Polyhedra",
  institution =  "The Johns Hopkins University, Dept. of Mathematical
                 Sciences",
  year =         "1989",
  number =       "89-08",
  address =      "Baltimore",
  pages =        "14",
}

@Article{sep:CornuejolsLemhauser:78,
  author =       "G. Cornu\`{e}jols and G. L. Nemhauser",
  title =        "Tight bounds for Christofides' travelling salesman
                 heuristic",
  journal =      "Math. Programming",
  year =         "1978",
  volume =       "14",
  pages =        "116--121",
}

@Article{sep:CornuejolsPulleyblank:80,
  author =       "G. Cornu\`{e}jols and W. Pulleyblank",
  title =        "A Matching Problem with Side Condition",
  journal =      "Discrete Math.",
  year =         "1980",
  volume =       "29",
  pages =        "135--159",
}

@Article{sep:CornuejolsPulleyblank:82,
  author =       "G. Cornu\'{e}jols and W. Pulleyblank",
  title =        "The Travelling Salesman Polytope and {0,2} -
                 matchings",
  year =         "1982",
  journal =      "Ann. Disc. Math.",
  volume =       "16",
  pages =        "27--55",
}

@Article{sep:CornuejolsPulleyblank:83,
  author =       "G. Cornu\`{e}jols and W. R. Pulleyblank",
  title =        "Critical Graphs, Matchings and Tours or a Hierarchy of
                 Relaxations for the Travelling Salesman Problem",
  year =         "1983",
  journal =      "Combinatorica",
  volume =       "3",
  pages =        "35--52",
}

@Article{sep:CornuejolsSridharanThizy:91,
  author =       "G. Cornu\`{e}jols and R. Sridharan and J. M. Thizy",
  title =        "Am Comparison of Heuristics and Relaxations for the
                 Capacitated Plant Location Problem",
  year =         "1991",
  journal =      "European J. Oper. Res.",
  volume =       "50",
  number =       "3",
  pages =        "280--297",
}

@TechReport{sep:CosaresHochbaum:90,
  author =       "S. Cosares and D. Hochbaum",
  title =        "Strongly Polynomial Algorithms for the Quadratic
                 Transportation Problems with a Fixed Number of
                 Sources",
  institution =  "University of California, Department of IEOR",
  year =         "1990",
  address =      "Berkeley",
  pages =        "18",
}

@TechReport{sep:Cottle:79,
  author =       "R. W. Cottle",
  title =        "Observations on a Class of Nasty Linear
                 Complementarity Problems",
  institution =  "Rheinische Friedrich-Wilhelms-Universit{\"a}t",
  year =         "1979",
  number =       "79134-OR",
  address =      "Bonn",
  pages =        "1--44",
}

@TechReport{sep:CottleRandow:79,
  author =       "R. W. Cottle and R. von Randow",
  title =        "On {Q}-Matrices, Centroids and Simplotopes",
  institution =  "Rheinische Friedrich-Wilhelms-Universit{\"a}t",
  year =         "1979",
  number =       "79138-OR",
  address =      "Bonn",
  pages =        "1--33",
}

@TechReport{sep:CottleRandowStone:81,
  author =       "R. W. Cottle and R. v. Randow and R. E. Stone",
  title =        "On Spherically Convex Sets and {Q}-Matrices",
  institution =  "Rheinische Friedrich-Wilhelms-Universit{\"a}t",
  year =         "1981",
  number =       "81181-OR",
  address =      "Bonn",
  pages =        "1--8",
}

@Article{sep:CottleVeinott:72,
  author =       "R. W. Cottle and A. F. Veinott",
  title =        "Polyhedral Sets having a least Element",
  journal =      "Math. Programming",
  year =         "1972",
  volume =       "3",
  pages =        "238--249",
}

@Article{sep:CruonHerve:65,
  author =       "R. Cruon and P. Herv\'{e}",
  title =        "Quelques Resultats Relatifs {A} Une Structure
                 Algebrique Et {A} Son Application Au Probleme Central
                 De {L}'ordonnancement",
  journal =      "Revue Francaise de Recherche Operationnelle",
  year =         "1965",
  volume =       "34",
  pages =        "3--19",
}

@Article{sep:CrystalTrotter:87,
  author =       "D. Crystal and L. E. Trotter jr.",
  title =        "On Abstract Integral Dependence",
  year =         "1987",
  journal =      "Math. Oper. Res.",
  volume =       "14",
  number =       "4",
  pages =        "626--638",
}

@Article{sep:CuiFujishige:88,
  author =       "W. Cui and S. Fujishige",
  title =        "A Primal Algorithm for the Submodular Flow Problem
                 with Minimum-Mean Cycle Selection",
  year =         "1988",
  journal =      "J. Oper. Res. Soc. Japan",
  volume =       "31",
  number =       "3",
  pages =        "431--441",
}

@TechReport{sep:Cuningham-Green:79,
  author =       "R. A. Cuninghame-Green",
  title =        "An Algorithm for the Absolute Centre of a Graph",
  institution =  "University",
  year =         "1979",
  address =      "Birmingham",
  pages =        "1--9",
}

@Article{sep:Cuningham-Green:81,
  author =       "R. A. Cuninghame-Green",
  title =        "Integer Programming by Long Division",
  journal =      "Discrete Appl. Math.",
  year =         "1981",
  volume =       "3",
  pages =        "19--26",
}

@Article{sep:Cuningham-GreenBurkard:88,
  author =       "R. A. Cuninghame-Green and R. E. Burkard",
  title =        "Saddlepoints in Group and Semigroup Minimization",
  year =         "1988",
  journal =      "Optimization",
  volume =       "19",
  number =       "4",
  pages =        "451--459",
}

@Article{sep:Cuninghame-Green:76,
  author =       "R. A. Cuninghame-Green",
  title =        "Projections in Minimax Algebra",
  journal =      "Math. Programming",
  year =         "1976",
  volume =       "10",
  pages =        "111--123",
}

@TechReport{sep:Cuninghame-Green:78,
  author =       "R. A. Cuninghame-Green",
  title =        "An Algebra for the Absolute Centre of a Graph",
  institution =  "University",
  year =         "1978",
  address =      "Birmingham",
  pages =        "1--21",
}

@Article{sep:Cuninghame-Green:84,
  author =       "R. A. Cuninghame-Green",
  title =        "Eigenfunctions and Optimal Orbits",
  journal =      "J. Comput. Appl. Math.",
  year =         "1984",
  volume =       "11",
  pages =        "83--94",
}

@TechReport{sep:Cuninghame-GreenBorawitz:78a,
  author =       "R. A. Cuninghame-Green and W. C. Borawitz",
  title =        "Some Algebraic Ideas Relevant to {OR}. {I}.: The
                 Structures {J}, {K}, {L}, {M}",
  institution =  "University",
  year =         "1978",
  address =      "Birmingham",
  pages =        "1--22",
}

@TechReport{sep:Cuninghame-GreenBorawitz:78b,
  author =       "R. A. Cuninghame-Green and W. C. Borawitz",
  title =        "Some Algebraic Ideas Relevant to {OR}. {II}.:
                 Non-Commuting {Z}-Transforms",
  institution =  "University",
  year =         "1978",
  address =      "Birmingham",
  pages =        "1--16",
}

@Article{sep:Cuninghame-GreenMeijer:80,
  author =       "R. A. Cuninghame-Green and P. F. J. Meijer",
  title =        "An Algebra For Piecewise-Linear Minimax Problems",
  journal =      "Discrete Appl. Math.",
  year =         "1980",
  volume =       "2",
  pages =        "267--294",
}

@Article{sep:Cunningham:79,
  author =       "W. H. Cunningham",
  title =        "Theoretical Properties of the Network Simplex Method",
  journal =      "Math. Oper. Res.",
  year =         "1979",
  volume =       "4",
  pages =        "196--208",
}

@TechReport{sep:Cunningham:81a,
  author =       "W. H. Cunningham",
  title =        "Polyhedra for Composed Independence Systems",
  institution =  "Rheinische Friedrich-Wilhelms-Universit{\"a}t",
  year =         "1981",
  number =       "81203-OR",
  address =      "Bonn",
  pages =        "1--15",
}

@TechReport{sep:Cunningham:81b,
  author =       "W. H. Cunningham",
  title =        "A Class of Linear Programs Convertible to Network
                 Problems",
  institution =  "Rheinische Friedrich-Wilhelms-Universit{\"a}t",
  year =         "1981",
  number =       "81204-OR",
  address =      "Bonn",
  pages =        "1--5",
}

@Article{sep:Cunningham:84,
  author =       "W. H. Cunningham",
  title =        "Testing membership in Matroid Polyhedra",
  journal =      "J. Combin. Theory Ser. B",
  year =         "1984",
  volume =       "B",
  number =       "36",
  pages =        "161--188",
}

@Article{sep:Cunningham:85a,
  author =       "W. H. Cunningham",
  title =        "Optimal Attack and Reinforcement of a Network",
  journal =      "J. Assoc. Comput. Mach.",
  year =         "1985",
  volume =       "32",
  pages =        "549--561",
}

@Article{sep:Cunningham:85b,
  author =       "W. H. Cunningham",
  title =        "Minimum Cuts, Modular Functions, and Matroid
                 Polyhedra",
  journal =      "Networks",
  year =         "1985",
  volume =       "15",
  pages =        "205--215",
}

@Article{sep:CunninghamFrank:85,
  author =       "W. H. Cunningham and A. Frank",
  title =        "A Primal-Dual Algorithm for Submodular Flows",
  journal =      "Math. Oper. Res.",
  year =         "1985",
  volume =       "10",
  number =       "2",
  pages =        "251--262",
}

@Article{sep:CunninghamMarsh:78,
  author =       "W. H. Cunningham and A. B. Marsh",
  title =        "A Primal Algrithm for Optimum Matching",
  journal =      "Math. Programming Stud.",
  year =         "1978",
  volume =       "8",
  pages =        "50--72",
}

@TechReport{sep:Dantzig:5,
  author =       "G. B. Dantzig",
  title =        "Optimal Solution of a Dynamic Leontief Model with
                 Substitution",
  institution =  "University",
  year =         "195x",
  address =      "Stanford",
  pages =        "295--302",
}

@Article{sep:Dantzig:60,
  author =       "G. B. Dantzig",
  title =        "On the shortest route through a network",
  journal =      "Management Sci.",
  year =         "1960",
  volume =       "6",
  pages =        "187--190",
}

@InProceedings{sep:Dantzig:67,
  author =       "G. B. Dantzig",
  title =        "All Shortest Routes in a Graph",
  booktitle =    "Theory of Graphs",
  year =         "1967",
  editor =       "P. Rosenstiehl",
  pages =        "91--92",
  address =      "New York",
  publisher =    "Gordon and Breach",
}

@Article{sep:Dantzig:83,
  author =       "G. B. Dantzig",
  title =        "Reminiscences about the origins of linear
                 programming",
  journal =      "Math. Programming",
  year =         "1983",
  pages =        "78--86",
}

@Article{sep:DantzigEaves:73,
  author =       "G. B. Dantzig and B. C. Eaves",
  title =        "Fourier-Motzkin Elimination and its Dual",
  journal =      "J. Combin. Theory Ser. A",
  year =         "1973",
  volume =       "14",
  pages =        "288--297",
}

@Article{sep:DantzigFulkersonJohnson:54,
  author =       "G. Dantzig and R. Fulkerson and S. Johnson",
  title =        "Solution of a Large-Scale Traveling-Salesman Problem",
  journal =      "Oper. Res.",
  year =         "1954",
  volume =       "2",
  pages =        "393--410",
}

@TechReport{sep:DantzigVeinott:77,
  author =       "G. B. Dantzig and A. F. Veinott jr.",
  title =        "Discovering hidden totally leontief substitution
                 systems",
  institution =  "University",
  year =         "1977",
  address =      "Stanford",
  pages =        "102--103",
}

@TechReport{sep:DatheGirlich:83,
  author =       "H. Dathe and E. Girlich",
  title =        "{N}{\"a}herungsverfahren zur {L}{\"o}sung diskreter
                 Optimierungsprobleme mit Polymatroiden
                 {L}{\"o}sungsbereichen",
  institution =  "Friedr.-Schiller-Universit{\"a}t",
  year =         "1983",
  number =       "N/83/10",
  address =      "Jena",
  pages =        "8",
}

@Article{sep:DatheGirlichKowaljow:82,
  author =       "H. Dathe and E. Girlich and M. M. Kowaljow",
  title =        "Nichtlineare diskrete Optimierung {\"u}ber speziellen
                 {L}{\"o}sungsbereichen",
  journal =      "Wiss. Ztschr. Friedrich-Schiller-Univ. Jena,
                 Math.-Nat. R.",
  year =         "1982",
  volume =       "31",
  pages =        "657--666",
}

@Article{sep:Davis:80,
  author =       "C. S. Davis",
  title =        "Line Search Method for Extended Penalty Function
                 Environments",
  journal =      "Intern. J. for Numerical Method in Engineering",
  year =         "1980",
  volume =       "15",
  pages =        "867--888",
}

@TechReport{sep:Day:79,
  author =       "W. H. E. Day",
  title =        "Solving Problems on Finite Lattices",
  institution =  "Memorial University of Newfoundland",
  year =         "1979",
  number =       "7902",
  address =      "St. John's/Newfoundland",
  pages =        "1--14",
}

@TechReport{sep:DeinekoRudolfWoeginger:93,
  author =       "Vladimir Deineko and R{\"u}diger Rudolf and Gerhard J.
                 Woeginger",
  title =        "A General Approach to Avoiding $2x2$ Submatrices",
  institution =  "Institut f{\"u}r Mathematik",
  year =         "1993",
  number =       "258",
  address =      "Technische Universit{\"a}t Graz",
}

@InProceedings{sep:DejonGattinger:77,
  author =       "B. Dejon and M. Gattinger",
  title =        "Bestimmung von r-Extrema in halbgeordneten Mengen",
  booktitle =    "Operations Research Verfahren XXV, Methods of
                 Operations Research",
  year =         "1977",
  editor =       "R. Henn and P. Kall and B. Korte and O. Krafft et
                 al.",
  pages =        "296--302",
  publisher =    "Meisenheim, Hain",
}

@Article{sep:Delahare:80,
  author =       "J. P. Delahare",
  title =        "Algorithmes pour suites non convergentes",
  journal =      "Numer. Math.",
  year =         "1980",
  volume =       "34",
  pages =        "333--347",
}

@Article{sep:DellAmicoFischettiToth:93,
  author =       "M. Dell'Amico and M. Fischetti and P. Toth",
  title =        "Heuristic Algorithms for the Multiple Depot Vehicle
                 Scheduling Problem",
  journal =      "Management Science",
  volume =       "39",
  number =       "1",
  pages =        "115--125",
  year =         "1993",
}

@TechReport{sep:DenHertogRoosKaliskiTerlaky:93,
  author =       "D. den Hertog and C. Roos and J. Kaliski and T.
                 Terlaky",
  title =        "A Note on Central Cutting Plane Methods for Convex
                 Programming",
  institution =  "Delft University of Technology, Faculty of Techn.
                 Mathematics and Informatics",
  year =         "1993",
  number =       "93-44",
  address =      "Delft",
  pages =        "7",
}

@TechReport{sep:DenHertogRoosTerlaky:90,
  author =       "D. den Hertog and C. Roos and T. Terlaky",
  title =        "On the Classical Logarithmic Barrier Function Method
                 for a Class of Smooth Convex Programming Problems",
  institution =  "University of Technology, Faculty of Technical
                 Mathematics and Informatics",
  year =         "1990",
  number =       "90-28",
  address =      "Delft",
  pages =        "23",
}

@Article{sep:DenHertogRoosTerlaky:91a,
  author =       "D. den Hertog and C. Roos and R. Terlaky",
  title =        "A Polynomial Method of Weighted Centers for Convex
                 Quadratic Programming",
  year =         "1991",
  journal =      "J. Inform. Optim. Sci.",
  volume =       "12",
  number =       "2",
  pages =        "187--205",
}

@Article{sep:DenHertogRoosTerlaky:91b,
  author =       "D. den Hertog and C. Roos and T. Terlaky",
  title =        "A Potential Reduction Method for a Class of Smooth
                 Convex Programming Problems",
  year =         "1991",
  journal =      LINAA2,
  volume =       "152",
  pages =        "43--68",
}

@TechReport{sep:DenHertogRoosTerlaky:91c,
  author =       "D. den Hertog and C. Roos and T. Terlaky",
  title =        "Inverse Barrier Methods of Linear Programming",
  institution =  "Delft University of Technology",
  year =         "1991",
  number =       "91-27",
  address =      "Delft",
  pages =        "24",
}

@TechReport{sep:DenHertogRoosTerlaky:91d,
  author =       "D. den Hertog and C. Roos and T. Terlaky",
  title =        "A Build-up Variant of the Path-Following Method of
                 {LP}",
  institution =  "Delft University of Technology",
  year =         "1991",
  number =       "91-47",
  address =      "Delft",
  pages =        "10",
}

@TechReport{sep:DenHertogRoosVial:89,
  author =       "D. den Hertog and C. Roos and J.-Ph. Vial",
  title =        "An 0( n) Complexity Reduction for the Long-Step
                 Path-Following Algorithm for Linear Programming",
  institution =  "Delft University of Technology",
  year =         "1989",
  number =       "89-85",
  address =      "Delft",
  pages =        "14",
}

@TechReport{sep:DenHertogRoosVial:91,
  author =       "D. den Hertog and C. Roos and J.-Ph. Vial",
  title =        "A Complexity Reduction for the Long-Step
                 Path-Following Algorithms for Linear Programming",
  institution =  "Delft University of Technology",
  year =         "1991",
  address =      "Delft",
  pages =        "19",
}

@Article{sep:DennisMorshediTurner:87,
  author =       "J. E. Dennis and A. M. Morshedi and K. Turner",
  title =        "A Variable-metric Variant of the Karmarkar Algorithm
                 for Linear Programming",
  journal =      "Math. Programming",
  year =         "1987",
  volume =       "39",
  pages =        "1--20",
}

@Article{sep:DeoChi-yin:84,
  author =       "N. Deo and P. Chi-yin",
  title =        "Shortest Path Algorithms: Taxonomy and Annotation",
  year =         "1984",
  journal =      "Networks",
  volume =       "14",
  pages =        "275--323",
}

@InProceedings{sep:Derigs:76a,
  author =       "U. Derigs",
  title =        "Rangzuordnungsprobleme und das Stable Marriage
                 Problem",
  booktitle =    "Operations Research Verfahren XXV",
  year =         "1976",
  pages =        "147--155",
  address =      "Meisenheim am Glan",
  publisher =    "Verlag Anton Hain",
}

@InProceedings{sep:Derigs:76b,
  author =       "U. Derigs",
  title =        "Rangzuordnungsprobleme und das Stable Marriage
                 Problem",
  booktitle =    "Operations Research Verfahren XXV",
  year =         "1976",
  pages =        "147--155",
  address =      "Meisenheim am Glan",
  publisher =    "Anton Hain",
}

@Article{sep:Derigs:77,
  author =       "U. Derigs",
  title =        "Rangzuordnungsprobleme",
  journal =      "Zeitschrift f{\"u}r OR",
  year =         "1977",
  volume =       "21",
  pages =        "75--83",
}

@Article{sep:Derigs:78a,
  author =       "U. Derigs",
  title =        "Duality and the Algebraic Matching Problem",
  journal =      "Opeations Research Verfahren",
  year =         "1978",
  volume =       "28",
  pages =        "253--264",
}

@PhdThesis{sep:Derigs:78b,
  author =       "U. Derigs",
  title =        "Algebraische Matchingprobleme",
  school =       "Mathematisches Institut der Universit{\"a}t",
  year =         "1978",
  address =      "K{\"o}ln",
  pages =        "1--155",
}

@InProceedings{sep:Derigs:78c,
  author =       "U. Derigs",
  title =        "On Solving Symmetric Assignment and Perfect Matching
                 Problems with Algebraic Objectives",
  booktitle =    "Optimization and Operations Research",
  year =         "1978",
  editor =       "R. Henn and B. Korte and W. Oettli",
  pages =        "79--86",
  address =      "Berlin",
  publisher =    "Springer",
}

@Article{sep:Derigs:79a,
  author =       "U. Derigs",
  title =        "Duality and admissible transformations in
                 combinatorial optimization",
  journal =      "Z. Oper. Res. Ser. A-B",
  year =         "1979",
  volume =       "23",
  number =       "Ser. A",
  pages =        "251--267",
}

@Article{sep:Derigs:79b,
  author =       "U. Derigs",
  title =        "A generalized Hungarian method for solving minimum
                 weight perfect matching problems with algebraic
                 objektive",
  journal =      "Discrete Appl. Math.",
  year =         "1979",
  volume =       "1",
  pages =        "167--180",
}

@Article{sep:Derigs:81,
  author =       "U. Derigs",
  title =        "A Shortest Augmenting Path Method for Solving Minimal
                 Perfect Matching Problems",
  journal =      "Networks",
  year =         "1981",
  volume =       "11",
  pages =        "379--390",
}

@Article{sep:Derigs:82a,
  author =       "U. Derigs",
  title =        "Efficiency and Time-Cost-Tradeoffs in Transportation
                 Problems",
  journal =      "OR Spektrum",
  year =         "1982",
  volume =       "4",
  pages =        "195--212",
}

@Article{sep:Derigs:82b,
  author =       "U. Derigs",
  title =        "On Three Basic Methods for Solving Bottleneck
                 Transportation Problems",
  journal =      "Naval Research Logistics Quarterly",
  year =         "1982",
  volume =       "29",
  pages =        "505--516",
}

@InProceedings{sep:Derigs:85,
  author =       "U. Derigs",
  title =        "Exchange properties and {K}-best strategies in
                 combinatorial op timazation",
  pages =        "393--406",
  booktitle =    "Operational research '84, Proc. 10th IFORS Int. Conf.
                 1984",
  year =         "1985",
}

@Article{sep:DerigsGoeckeSchrader:86,
  author =       "U. Derigs and O. Goecke and R. Schrader",
  title =        "Monge Sequences and a Simple Assignment Algorithm",
  year =         "1986",
  journal =      "Discrete Appl. Math.",
  volume =       "15",
  pages =        "241--248",
}

@Article{sep:DerigsHeske:80,
  author =       "U. Derigs and A. Heske",
  title =        "A Computational Study on Some Methods for Solving the
                 Cardinality Matching Problem",
  journal =      "Angewandte Informatik",
  year =         "1980",
  volume =       "4",
  pages =        "149--154",
}

@TechReport{sep:DerigsHuenten:83,
  author =       "U. Derigs and B. H{\"u}nten",
  title =        "Magic Graphs- {A} New Characterisation",
  institution =  "Rheinische Friedrich-Wilhelms-Universit{\"a}t",
  year =         "1983",
  number =       "83265-OR",
  address =      "Bonn",
  pages =        "1--7",
}

@TechReport{sep:DerigsKazakidis:79,
  author =       "U. Derigs and G. Kazakidis",
  title =        "On two Methods for Solving Minimal Perfect Matching
                 Problems",
  institution =  "Industrieseminar der Universit{\"a}t",
  year =         "1979",
  address =      "K{\"o}ln",
  pages =        "1--15",
}

@Article{sep:DerigsMetz:86a,
  author =       "U. Derigs and A. Metz",
  title =        "On the use of optimal fractional matchings for solving
                 the (integer) Matching Problem",
  journal =      "Computing",
  year =         "1986",
  volume =       "36",
  pages =        "263--270",
}

@Article{sep:DerigsMetz:86b,
  author =       "U. Derigs and A. Metz",
  title =        "An In-Core/Out-of-Core Method for Solving Large Scale
                 Assignment Problems",
  year =         "1986",
  journal =      "Z. Oper. Res. Ser. A-B",
  volume =       "30",
  pages =        "181--195",
}

@Article{sep:DerigsMetz:86c,
  author =       "U. Derigs and A. Metz",
  title =        "An Efficient Labeling Technique for Solving Sparse
                 Assignment Problems",
  year =         "1986",
  journal =      "Computing",
  volume =       "36",
  pages =        "301--311",
}

@TechReport{sep:DerigsZimmermann:78a,
  author =       "U. Derigs and U. Zimmermann",
  title =        "Duality Principles in Algebraic Linear Programming",
  institution =  "Mathematisches Institut der Universit{\"a}t",
  year =         "1978",
  number =       "78-6",
  address =      "K{\"o}ln",
  pages =        "1--20",
}

@Article{sep:DerigsZimmermann:78b,
  author =       "U. Derigs and U. Zimmermann",
  title =        "An Augmenting Path Method for Solving Linear
                 Bottleneck Assignment Problems",
  journal =      "Computing",
  year =         "1978",
  volume =       "19",
  pages =        "285--295",
}

@Article{sep:DerigsZimmermann:79,
  author =       "U. Derigs and U. Zimmermann",
  title =        "An Augmenting Path Method for Solving Linear
                 Bottleneck Transportations Problems",
  journal =      "Computing",
  year =         "1979",
  volume =       "22",
  pages =        "1--15",
}

@Article{sep:Derniame:71,
  author =       "P. Derniame",
  title =        "Transformation Par Homomorphisme {D}'un Algorithme De
                 Recherche De Chemins",
  journal =      "Report",
  year =         "1971",
  pages =        "6--17",
}

@TechReport{sep:Desrochers:86,
  author =       "M. Desrochers",
  title =        "An Algorithm for the Shortest Path Problem with
                 Resource Constraints",
  institution =  "Centre de Recherche sur les Transports, Universit\'{e}
                 de Montr\'{e}al",
  year =         "1986",
  address =      "Montr\'{e}al",
  pages =        "31",
}

@Article{sep:Desrochers:88,
  author =       "M. Desrochers",
  title =        "A Reoptimization Algorithm for the Shortest Path
                 Problem with Time Windows",
  journal =      "European J. Oper. Res.",
  year =         "1988",
  number =       "2",
  volume =       "35",
  pages =        "242--254",
}

@Article{sep:DesrochersSoumis:88,
  author =       "M. Desrochers and F. Soumis",
  title =        "A Generalized Permanent Labelling Algorithm for the
                 Shortest Path Problem with Time Windows",
  journal =      "Infor",
  volume =       "26",
  year =         "1988",
  number =       "3",
  pages =        "191--212",
}

@TechReport{sep:Deuflhard:78a,
  author =       "P. Deuflhard",
  title =        "Kepler Discretization in Regular Celestial Mechanics",
  institution =  "Universit{\"a}t",
  year =         "1978",
  number =       "2",
  address =      "Heidelberg",
  pages =        "19",
}

@TechReport{sep:Deuflhard:78b,
  author =       "P. Deuflhard",
  title =        "A study of extrapolation method based on multisteip
                 schemes without parasitic solutions",
  institution =  "Universit{\"a}t",
  year =         "1978",
  number =       "1",
  address =      "Heidelberg",
  pages =        "19",
}

@Article{sep:Deuflhard:85,
  author =       "P. Deuflhard",
  title =        "Recent Progress in Extrapolation Methods for Ordinary
                 Differential Equations",
  journal =      "SIAM Rev.",
  year =         "1985",
  volume =       "27",
  pages =        "505--535",
}

@TechReport{sep:DeuflhardSautter:82,
  author =       "P. Deuflhard and W. Sautter",
  title =        "On Rank-Deficient Pseudo-Inverses",
  institution =  "Universit{\"a}t",
  year =         "1982",
  address =      "Heidelberg",
  pages =        "24",
}

@TechReport{sep:DezaGrishukhinLaurent:90,
  author =       "M. Deza and V. P. Grishukhin and M. Laurent",
  title =        "Extreme Hypermetrics and {L}-Poltopes",
  institution =  "Institut f{\"u}r {\"O}konomie und Oper. Res.",
  year =         "1990",
  number =       "90668-OR",
  address =      "Bonn",
  pages =        "1",
}

@TechReport{sep:DezaGrishukhinLaurent:91,
  author =       "M. Deza and V. P. Grishukhin and M. Laurent",
  title =        "Hypermetrics and {L}-Poltopes",
  institution =  "IASI-CNR-Roma",
  year =         "1991",
  number =       "286",
  address =      "Rom",
  pages =        "3",
}

@TechReport{sep:DezaLaurent:91a,
  author =       "M. Deza and M. Laurent",
  title =        "The cut cone : simplicial faces and variety of
                 realizations",
  institution =  "Institut f{\"u}r {\"O}konometrie und Oper. Res.",
  year =         "1991",
  number =       "90671-OR",
  address =      "Bonn",
  pages =        "1",
}

@Article{sep:DezaLaurent:91c,
  author =       "M. Deza and M. Laurent",
  title =        "Facets for the cut cone {II}: Clique-Web
                 Inequalities",
  journal =      "Math. Programming",
  year =         "1991",
  pages =        "4",
}

@TechReport{sep:DezaLaurentPoljak:90,
  author =       "M. Deza and M. Laurent and S. Poljak",
  title =        "The Cut Cone {III}: On the Role of Triangle Facets",
  institution =  "Institut f{\"u}r {\"O}konometrie und Oper. Res.",
  year =         "1990",
  number =       "90655-OR",
  address =      "Bonn",
  pages =        "25",
}

@Article{sep:Dikin:67,
  author =       "I. I. Dikin",
  title =        "Iterative Solution of Problems of Linear and Quadratic
                 Programming",
  journal =      "Soviet Math. Dokl.",
  year =         "1967",
  volume =       "8",
  number =       "3",
  pages =        "674--675",
}

@Article{sep:Dikin:74,
  author =       "I. I. Dikin",
  title =        "About the Convergence of an Interactive Process",
  journal =      "Controlable Systems IM",
  year =         "1974",
  volume =       "12",
  number =       "IK SO AN SSSR",
  pages =        "54--60",
}

@Article{sep:Dinic:70,
  author =       "E. A. Dinic",
  title =        "Algorithm for Solution of a Problem of Maximum Flow in
                 a Network with Power Estimation",
  journal =      "Soviet Math. Dokl.",
  year =         "1970",
  volume =       "11",
  pages =        "1277--1280",
}

@Article{sep:DinicKronrod:69,
  author =       "E. A. Dinic and M. A. Kronrod",
  title =        "An Algorithm for the Solution of the Assignment
                 Problem",
  journal =      "Soviet Math. Dokl.",
  year =         "1969",
  volume =       "10",
  pages =        "1324--1326",
}

@Article{sep:DoerflerMuehlbacher:71a,
  author =       "W. D{\"o}rfler and J. M{\"u}hlbacher",
  title =        "Algorithmus 23. Ein verbesserter Matchingalgorithmus",
  journal =      "Computing",
  year =         "1971",
  volume =       "13",
  pages =        "389--397",
}

@Article{sep:DoerflerMuehlbacher:71b,
  author =       "W. D{\"o}rfler and J. M{\"u}hlbacher",
  title =        "Bestimmung eines maximalen Matching in beliebigen
                 Graphen",
  journal =      "Computing",
  year =         "1971",
  volume =       "9",
  pages =        "251--257",
}

@TechReport{sep:Dolecki:81,
  author =       "S. Dolecki",
  title =        "Hypertangent cones for a special class of sets",
  institution =  "Polish Academy of Sciences",
  year =         "1981",
  address =      "Aldeno/Italy",
  pages =        "10",
}

@Article{sep:DomichKannanTrotter:87,
  author =       "P. D. Domich and R. Kannan and Jr. Trotter",
  title =        "Hermite Normal form Computation Using Modulo
                 Determinant Arithmetic",
  journal =      "Math. Oper. Res.",
  volume =       "12",
  year =         "1987",
  pages =        "50--59",
}

@Book{sep:Domschke:72a,
  author =       "W. Domschke",
  title =        "{K}{\"u}rzeste Wege in Graphen",
  publisher =    "Anton Hain Verlag.",
  year =         "1972",
  address =      "Meisenheim/Glan",
}

@Article{sep:Domschke:72b,
  author =       "W. Domschke",
  title =        "Zwei Verfahren zur Suche negativer Zyklen in
                 bewerteten Digraphen",
  journal =      "Computing",
  year =         "1972",
  volume =       "11",
  pages =        "125--136",
}

@Article{sep:Domschke:73,
  author =       "W. Domschke",
  title =        "Two new Algorithms for Minimal Cost Flows Problems",
  journal =      "Computing",
  year =         "1973",
  volume =       "11",
  pages =        "275--285",
}

@Article{sep:DomschkeWeuthen:74,
  author =       "W. Domschke and H. K. Weuthen",
  title =        "Ein effizientes Verfahren zur {L}{\"o}sung des
                 Zuordnungsproblems",
  journal =      "Operations Research-Verfahren",
  year =         "1974",
  volume =       "19/20",
  pages =        "17",
}

@TechReport{sep:Dorhout:73,
  author =       "B. Dorhout",
  title =        "Het Lineaire Toewijzingsprobleem: Vergelijking van
                 Algorithmen",
  institution =  "Stichting Mathematisch Centrum",
  year =         "1973",
  number =       "BU 21/73",
  address =      "Amsterdam",
  pages =        "19",
}

@TechReport{sep:Dowling:89,
  author =       "Michael L. Dowling",
  title =        "Comparing Affine and Projective Vector Fields",
  institution =  "Technische Universit{\"a}t",
  month =        may,
  year =         "1989",
  address =      "Braunschweig,Germany",
}

@TechReport{sep:Dowling:91,
  author =       "Michael L. Dowling",
  title =        "Degeneracy and Affine Rescaling",
  institution =  "Technische Universit{\"a}t",
  month =        jun,
  year =         "1991",
  address =      "Braunschweig,Germany",
}

@TechReport{sep:Dowling:94,
  author =       "Michael L. Dowling",
  title =        "An Affine Rescaling Algorithm for Quadratic
                 Programming",
  institution =  "Technische Universit{\"a}t",
  year =         "1994",
  address =      "Braunschweig,Germany",
}

@Article{sep:Downey:87,
  author =       "P. J. Downey",
  title =        "(Probably) The Minimum Sum of Quares",
  journal =      "Commun. Statist.-Stochastic Models",
  year =         "1987",
  volume =       "3",
  pages =        "457--465",
}

@Article{sep:Dress:86,
  author =       "A. W. M. Dress",
  title =        "Duality Theory for Finite and Infinite Matroids with
                 Coefficients",
  journal =      "Adv. in Math.",
  year =         "1986",
  volume =       "59",
  pages =        "97--123",
}

@Article{sep:DressHavel:86,
  author =       "A. Dress and T. Havel",
  title =        "Some Combinatorial Properties of Discriminants in
                 Metric Vector Spaces",
  journal =      "Adv. in Math.",
  year =         "1986",
  volume =       "62",
  pages =        "285--312",
}

@TechReport{sep:Drezner:84,
  author =       "Z. Drezner",
  title =        "Lower Bounds for the Quadratic Assignment Probelem",
  institution =  "University of Michigan-Dearborn",
  year =         "1984",
  address =      "Dearborn",
  pages =        "13",
}

@Article{sep:DreznerWesolowsky:78,
  author =       "Z. Drezner and G. O. Wesolowsky",
  title =        "A New Method for the Multifacility Minimax Location
                 Problem",
  journal =      "J. Oper. Res. Soc. Japan",
  year =         "1978",
  volume =       "29",
  pages =        "1095--1101",
}

@InProceedings{sep:DriscollSuymoto:66,
  author =       "L. C. Driscoll and L. Suyemoto",
  title =        "Heuristics for Resolution of Logical Scheduling
                 Conflicts",
  booktitle =    "Pre-Prints of the Proceedings of the fourth
                 International Conference on Operations Research,
                 Booklet F-I",
  year =         "1966",
  pages =        "93--129",
  address =      "Boston",
  publisher =    "IFORS",
}

@Article{sep:DuLeung:89,
  author =       "J. Du and Y.-T. Leung",
  title =        "Scheduling Tree-Structured Tasks on two Processors to
                 Minimize Schedule Length",
  journal =      "SIAM J. Disc. Math.",
  year =         "1989",
  volume =       "2",
  pages =        "176--196",
}

@Article{sep:DuLeungh:89,
  author =       "J. Du. and Y.-T. Leungh",
  title =        "Complexity of Scheduling Parallel Task Systems",
  journal =      "SIAM J. Disc. Math.",
  year =         "1989",
  volume =       "2",
  pages =        "473--487",
}

@Article{sep:Duff:81,
  author =       "I. S. Duff",
  title =        "On Algorithms for Obtaining a Maximum Transversal",
  journal =      "ACM Trans. Math. Software",
  year =         "1981",
  volume =       "7",
  pages =        "315--330",
}

@Article{sep:DuffReid:78,
  author =       "I. S. Duff and J. K. Reid",
  title =        "An Implementation of Tarjan's Algorithm for the Block
                 Triangularization of a Matrix",
  journal =      "ACM Trans. Math. Software",
  year =         "1978",
  volume =       "4",
  pages =        "137--147",
}

@Article{sep:Dunstan:73,
  author =       "F. D. J. Dunstan",
  title =        "A Greedy Algorithm for Solving a Certain Class of
                 Linear Programmes",
  journal =      "Math. Programming",
  year =         "1973",
  volume =       "5",
  pages =        "338--353",
}

@TechReport{sep:Dunstan:75,
  author =       "F. D. J. Dunstan",
  title =        "Greedy Algorithms for Optimisation Problems",
  institution =  "University College",
  year =         "1975",
  address =      "Cardiff",
  pages =        "6",
}

@Article{sep:DyeraFriezeKannan:91,
  author =       "M. Dyer and A.- Frieze and R. Kannan",
  title =        "A Random Polynomial-Time Algorithms for Approximating
                 the Volume of Convex Bodies",
  journal =      "J. Assoc. Comput. Mach.",
  year =         "1991",
  volume =       "38",
  pages =        "1--17",
}

@Article{sep:EavesRothblum:89,
  author =       "B. C. Eaves and U. G. Rothblum",
  title =        "A Theory on Extending Algorithms for Parametric
                 Problems",
  journal =      "Math. Oper. Res.",
  volume =       "14",
  number =       "3",
  year =         "1989",
  pages =        "502--533",
}

@Article{sep:EberleinMudholkar:68,
  author =       "P. J. Eberlein and G. S. Mudholkar",
  title =        "Some Remarks on the van der Waerden Conjecture",
  journal =      "J. Combin. Theory Ser. A",
  year =         "1968",
  volume =       "5",
  pages =        "386--396",
}

@Article{sep:EckerHegner:78,
  author =       "J. G. Ecker and N. S. Hegner",
  title =        "On Computing an Initial Efficient Extreme Point",
  journal =      "J. Opl. Res. Soc.",
  year =         "1978",
  volume =       "29",
  pages =        "1005--1007",
}

@Article{sep:EdelsbrunnerRoteWelzl:90,
  author =       "H. Edelsbrunner and G. Rote and E. Welzl",
  title =        "Testing the Necklage Condition for Shortest Tours and
                 Optimal Factors in the Plane",
  journal =      "Theoret. Comput. Sci.",
  year =         "1990",
  volume =       "2",
  pages =        "157--180",
}

@Article{sep:Edmonds:,
  author =       "J. Edmonds",
  title =        "Matroids and the Greedy Algorithm",
  journal =      "Math. Programming",
  year =         "1971",
  volume =       "1",
  pages =        "127--136",
}

@Article{sep:Edmonds:65,
  author =       "J. Edmonds",
  title =        "Minimum Partition of a Matroid Into Independent
                 Subsets",
  journal =      "J. Res. Nat. Bur. Standards",
  year =         "1965",
  volume =       "69B",
  pages =        "67--72",
}

@Article{sep:Edmonds:66,
  author =       "J. Edmonds",
  title =        "Systems of Distinct Representatives and Linear
                 Algebra",
  journal =      "J. Res. Nat. Bur. Standards",
  year =         "1966",
  volume =       "71B",
  pages =        "241--245",
}

@Article{sep:Edmonds:67,
  author =       "J. Edmonds",
  title =        "Optimum Branchings",
  journal =      "J. Res. Nat. Bur. Standards",
  year =         "1967",
  volume =       "71B",
  pages =        "346--361",
}

@InProceedings{sep:Edmonds:68,
  author =       "J. Edmonds",
  title =        "Matroid Partition",
  booktitle =    "Mathematics of the Decision Sciences, Part 1",
  year =         "1968",
  editor =       "G. B. Dantzig and A. F. Veinott",
  pages =        "335--345",
  address =      "Providence",
  publisher =    "American Mathematical Society",
}

@InProceedings{sep:Edmonds:70,
  author =       "J. Edmonds",
  title =        "Submodular Functions, Matroids, and Certain
                 Polyhedra",
  booktitle =    "Combinatorial structures and their applications",
  year =         "1970",
  editor =       "R. Guy and H. Hanam and J. Schonheim",
  pages =        "69--85",
  address =      "New York",
  publisher =    "Gordon and Breach",
}

@InProceedings{sep:Edmonds:79,
  author =       "J. Edmonds",
  title =        "Matroid Intersection",
  booktitle =    "Discrete Optimization 1",
  year =         "1979",
  editor =       "P. L. Hammer and E. L. Johnson and B. H. Korte",
  pages =        "39--49",
  organization = "Annals of Discrete Mathematics, 4",
  address =      "Amsterdam",
  publisher =    "North-Holland",
}

@Article{sep:EdmondsFulkerson:65,
  author =       "J. Edmonds and D. R. Fulkerson",
  title =        "Transversals and Matroid Partition",
  journal =      "J. Res. Nat. Bur. Standards",
  year =         "1965",
  volume =       "69B",
  pages =        "147--153",
}

@Article{sep:EdmondsFulkerson:70,
  author =       "J. Edmonds and D. R. Fulkerson",
  title =        "Bottleneck Extrema",
  journal =      "J. Combin. Theory Ser. A",
  year =         "1970",
  volume =       "8",
  pages =        "229--306",
}

@TechReport{sep:EdmondsJohnson:x0,
  author =       "J. Edmonds and E. L. Johnson",
  title =        "?",
  institution =  "National Bureau of Standards",
  year =         "19x0",
  address =      "Washington",
  pages =        "89--92",
}

@Article{sep:EdmondsKarp:72,
  author =       "J. Edmonds and R. M. Karp",
  title =        "Theoretical Improvements in Algorithmic Efficiency for
                 Network Flow Problems",
  journal =      "J. of the ACM",
  year =         "1972",
  volume =       "19",
  pages =        "248--264",
}

@TechReport{sep:EdmondsLubiw:85,
  author =       "J. Edmonds and A. Lubiw",
  title =        "Bipartition Systems and how to Partition Polygons",
  institution =  "Institut f{\"u}r {\"O}konometrie und Operations
                 Research, Universit{\"a}t Bonn",
  year =         "1985",
  number =       "85406-OR",
  address =      "Bonn",
  pages =        "10",
}

@InProceedings{sep:EdmondsPulleyblank:74,
  author =       "J. Edmonds and W. R. Pulleyblank",
  title =        "The Matching Problem and the Blossom Algorithm",
  booktitle =    "Hypergraph Seminar - Ohio State University",
  year =         "1974",
  editor =       "C. Berge and D. Ray-Chandur I",
  pages =        "214--242",
  address =      "Berlin, Heidelberg,New York",
  publisher =    "Springer",
}

@TechReport{sep:Ehlich:89,
  author =       "H. Ehlich",
  title =        "Arbeitsberichte des Rechenzentrums (22.
                 Jahresbericht)",
  institution =  "Ruhr-Universit{\"a}t, Rechenzentrum",
  year =         "1989",
  number =       "9001",
  address =      "Bochum",
  pages =        "164",
}

@TechReport{sep:EichenauerHerrmann:91a,
  author =       "J. Eichenauer-Herrmann",
  title =        "Construction of Inversive Congruential Pseudorandom
                 Number Generators with Maximal Period Lentgth",
  institution =  "Techn. Hochschule Darmstadt, FB Mathematik",
  year =         "1991",
  number =       "1363",
  address =      "Darmstadt",
  pages =        "10",
}

@TechReport{sep:EichenauerHerrmann:91b,
  author =       "J. Eichenauer-Herrmann",
  title =        "On the Autocorrelation Structure of Inversive
                 Congruential Pseudorandom Number Sequences",
  institution =  "Techn. Hochschule Darmstadt, FB Mathematik",
  year =         "1991",
  number =       "1384",
  address =      "Darmstadt",
  pages =        "9",
}

@TechReport{sep:EichenauerHerrmann:91c,
  author =       "J. Eichenauer-Herrmann",
  title =        "Cubic Congruential Pseudorandom Numbers for
                 Simulation",
  institution =  "Techn. Hochschule Darmstadt, FB Mathematik",
  year =         "1991",
  number =       "1399",
  address =      "Darmstadt",
  pages =        "13",
}

@Article{sep:EichenauerHerrmann:91d,
  author =       "J. Eichenauer-Herrmann",
  title =        "On the Discrepancy of Inversive Congruential
                 Pseudorandom Numbers with Prime Power Modulus",
  journal =      "Manuscripta mathematica",
  year =         "1991",
  volume =       "71",
  pages =        "153--161",
}

@TechReport{sep:EichenauerHerrmannGrothe:91,
  author =       "J. Eichenauer-Herrmann and H. Grothe",
  title =        "A new Inversive Congruential Pseudorandom Number
                 Generator with Power of two Modulus",
  institution =  "Techn. Hochschule Darmstadt, FB Mathematik",
  year =         "1991",
  number =       "1392",
  address =      "Darmstadt",
  pages =        "13",
}

@TechReport{sep:EichenhauerHerrmann:91,
  author =       "J. Eichenauer-Herrmann",
  title =        "Inversive Congruential Pseudorandom Numbers: {A}
                 Tutorial",
  institution =  "Techn. Hochschule Darmstadt, FB Mathematik",
  year =         "1991",
  number =       "1405",
  address =      "Darmstadt",
  pages =        "21",
}

@Booklet{sep:EichhornFunkeGleissner:85,
  author =       "W. Eichhorn and H. Funke and W. Glei\ss{sep:}ner",
  title =        "Axiomatik f{\"u}r die Einkommensteuer",
  howpublished = "Jahrbuch {\"U}berblicke Mathematik",
  year =         "1985",
  note =         "29 -- 37 p.",
}

@Article{sep:EichhornGleissner:85,
  author =       "W. Eichhorn and W. Glei\ss{}ner",
  title =        "On a functional differential equation arising in the
                 theory of the distribution on wealth",
  journal =      "Aequationes Math.",
  year =         "1985",
  volume =       "28",
  pages =        "190--198",
}

@Article{sep:EichhornRichter:84,
  author =       "W. Eichhorn and W. Richter",
  title =        "Tax Progression an inequality of income Distribution",
  journal =      "J. Math. Econom.",
  year =         "1984",
  volume =       "13",
  pages =        "127--131",
}

@TechReport{sep:Eiselt:81a,
  author =       "H. A. Eiselt",
  title =        "Minimax Locations in Trees",
  institution =  "Concordia University, Department of Quantitative
                 Methods",
  year =         "1981",
  number =       "83-11",
  address =      "Montreal",
  pages =        "10",
}

@TechReport{sep:Eiselt:81b,
  author =       "H. A. Eiselt",
  title =        "Minimal Capacities in Networks",
  institution =  "Concordia University, Department of Quantitative
                 Methods",
  year =         "1981",
  number =       "82-5",
  address =      "Montreal",
  pages =        "18",
}

@TechReport{sep:EiseltBrenelli:82,
  author =       "H. A. Eiselt and P. Brenelli",
  title =        "Flow Distribution with Min-Max Objective",
  institution =  "Concordia University, Department of Quantitative
                 Methods",
  year =         "1982",
  number =       "82-5",
  address =      "Montreal",
  pages =        "14",
}

@TechReport{sep:EiseltBurkard:90,
  author =       "H. A. Eiselt and R. E. Burkard",
  title =        "Resphipments and Overshipments in Transportation
                 Problems with Minmax Objective",
  institution =  "Technische Universit{\"a}t Graz, Institut f{\"u}r
                 Mathematik",
  year =         "1990",
  number =       "165",
  address =      "Graz",
  pages =        "19",
}

@Booklet{sep:Ellinger:7a,
  author =       "T. Ellinger",
  title =        "Reihenfolgeplanung",
  howpublished = "Sonderdruck, Handw{\"o}rterbuch der
                 Betriebswirtschaft",
  year =         "197x",
  note =         "3411 -- 3420 p.",
}

@Booklet{sep:Ellinger:7b,
  author =       "T. Ellinger",
  title =        "Terminplanung",
  howpublished = "Sonderdruck, Handw{\"o}rterbuch der
                 Betriebswirtschaft",
  year =         "197x",
  note =         "3877 -- 3889 p.",
}

@TechReport{sep:Elster:89,
  author =       "K.-H. Elster (Tagungsleiter)",
  title =        "Mathematische Optimierung - Theorie und Anwendungen",
  institution =  "Technische Hochschule Ilmenau",
  year =         "1989",
  type =         "Vortragsausz{\"u}ge (Internationalen Tagung, Eisenach
                 11-15.12.1989)",
  address =      "Ilmenau, DDR",
  pages =        "336",
}

@TechReport{sep:EmelichevGirlichKravcov:92,
  author =       "V. A. Emelichev and E. Girlich and M. K. Kravcov",
  title =        "Diskrete multikriterielle Optimierungsproblme {\"u}ber
                 Teilmengensystemen mit {MINMAX}- und
                 {MINSUM}-Kriterien",
  institution =  "Universit{\"a}t Minsk, Fakult{\"a}t f{\"u}r Mechanik
                 und Mathematik",
  year =         "1992",
  address =      "Minsk",
  pages =        "8",
}

@Article{sep:EmelichevKovalev:83,
  author =       "V. A. Emelichev and M. M. Kovalev",
  title =        "Polyhedral Aspects of discrete Optimization",
  journal =      "Plenum Publ. Corporation",
  year =         "1983",
  pages =        "765--777",
}

@Article{sep:EmelichevKravcovKrackovskij:78,
  author =       "V. A. Emelichev and M. K. Kravcov and A. P.
                 Krackovskij",
  title =        "On some classes of Transportation Polytopes",
  journal =      "Soviet Math. Dokl.",
  year =         "1978",
  volume =       "19",
  pages =        "889--893",
}

@Article{sep:Emmons:69,
  author =       "H. Emmons",
  title =        "One-Machine Sequencing to Minimize Certain Functions
                 of Job Tardiness",
  journal =      "Oper. Res.",
  year =         "1969",
  volume =       "17",
  pages =        "701--715",
}

@Article{sep:EngelGronau:88,
  author =       "K. Engel and H.-D. O. F. Gronau",
  title =        "On 2-(6,2, ) designs",
  journal =      "Rostock. Math. Kolloq.",
  year =         "1988",
  volume =       "34",
  pages =        "37--46",
}

@Article{sep:Epelman:79,
  author =       "M. S. Epelman",
  title =        "On a Property of Polyhedral Sets",
  journal =      "Math. Programming",
  year =         "1979",
  volume =       "16",
  pages =        "371--373",
}

@TechReport{sep:Eriksson:81,
  author =       "J. R. Eriksson",
  title =        "Algorithms for Entropy and Mathematical Programming",
  institution =  "Link{\"o}ping University, Dep. of Mathematics",
  year =         "1981",
  number =       "63",
  address =      "Link{\"o}ping",
  pages =        "152",
}

@TechReport{sep:Eriksson:85,
  author =       "J. R. Eriksson",
  title =        "An Iterative Primal-Dual Algorithm for Linear
                 Programming",
  institution =  "Link{\"o}ping University, Dep. of Mathematics",
  year =         "1985",
  number =       "LiTH-MAT-R-1985-10",
  address =      "Link{\"o}ping",
  pages =        "16",
}

@TechReport{sep:ErvolinaMcCormick:90a,
  author =       "T. R. Ervolina and S. T. McCormick",
  title =        "A Strongly Polynomial Dual Cancel and Tighten
                 Algorithm for Minimum Cost Network Flow",
  institution =  "IBM Poughkeepsie",
  year =         "1990",
  number =       "90-MSC.010",
  address =      "Poughkeepsie",
  pages =        "24",
}

@TechReport{sep:ErvolinaMcCormick:90b,
  author =       "T. R. Ervolina and S. T. McCormick",
  title =        "A Strongly Polynomial Maximum Mean Cut Cancelling
                 Algorithm for Minimum Cost Network Flow",
  institution =  "University of British Columbia",
  year =         "1990",
  number =       "90-MSC.009",
  address =      "Vancouver,Canada",
  pages =        "26",
}

@TechReport{sep:Euler:78,
  author =       "R. Euler",
  title =        "On rank functions of general independence systems",
  institution =  "Rheinische Friedrich-Wilhelms-Universit{\"a}t",
  year =         "1978",
  number =       "7893-OR",
  address =      "Bonn",
  pages =        "8",
}

@Article{sep:Euler:80a,
  author =       "R. Euler",
  title =        "On a Classification of Independence Systems",
  journal =      "Discrete Appl. Math.",
  year =         "1980",
  volume =       "2",
  pages =        "357--360",
}

@TechReport{sep:Euler:80b,
  author =       "R. Euler",
  title =        "Augmenting Paths and a Class of Independence Systems",
  institution =  "Mathematisches Institut der Universit{\"a}t",
  year =         "1980",
  number =       "16/80",
  address =      "K{\"o}ln",
  pages =        "14",
}

@TechReport{sep:Euler:81,
  author =       "R. Euler",
  title =        "Perfect Independence Systems",
  institution =  "Univ. K{\"o}ln, Mathematisches Institut",
  year =         "1981",
  number =       "81-19",
  address =      "K{\"o}ln",
  pages =        "32",
}

@Article{sep:Euler:82,
  author =       "R. Euler",
  title =        "Regular (2,2)-Systems",
  journal =      "Math. Programming",
  year =         "1982",
  volume =       "24",
  pages =        "269--283",
}

@TechReport{sep:Euler:83,
  author =       "R. Euler",
  title =        "Generalizations of cliques odd cycles and anticycles
                 and their relation to independence system polyhedra",
  institution =  "Univ. K{\"o}ln, Mathematisches Institut",
  year =         "1983",
  number =       "6/83",
  address =      "K{\"o}ln",
  pages =        "21",
}

@TechReport{sep:Euler:85,
  author =       "R. Euler",
  title =        "On Simplicial Decomposition in Combinatorial
                 Structures",
  institution =  "Institut f{\"u}r {\"O}konometrie und Operations
                 Research, Universit{\"a}t Bonn",
  year =         "1985",
  number =       "84349",
  address =      "Bonn",
  pages =        "15",
}

@Article{sep:Euler:89,
  author =       "R. Euler",
  title =        "Rank-Axiomatic Characterizations on Independence
                 Systems",
  journal =      "Discrete Math.",
  year =         "1989",
  volume =       "32",
  pages =        "9--17",
}

@TechReport{sep:EulerVerge:92,
  author =       "R. Euler and H. Le Verge",
  title =        "A Complete and Irredundant Linear Description of the
                 Asymmetric Traveling Salesman Polytope on 6 nodes",
  institution =  "Universit\'e de Bretagne Occidentale",
  year =         "1992",
  address =      "Brest Cedex/France",
}

@Article{sep:EvenItaiShamir:76,
  author =       "S. Even and A. Itai and A. Shamir",
  title =        "On the Complexity of Timetable and Multicommodity Flow
                 Problems",
  journal =      "SIAM J. Comput.",
  year =         "1976",
  volume =       "5",
  pages =        "691--703",
}

@Article{sep:EvenVanMaaren:85,
  author =       "J. J. M Evers and Hans van Maaren",
  title =        "Duality Principles in Mathematics and their Relations
                 to Conjugate Functions",
  journal =      "Nieuw Arch. Wisk. (4)",
  volume =       "4",
  year =         "1985",
  number =       "3",
  pages =        "23--68",
}

@Article{sep:ExooHarborthMengersen:88,
  author =       "G. Exoo and H. Harborth and I. Mengersen",
  title =        "The Ramsey Number of {K4} Versus {K5}-e",
  journal =      "Ars Combin.",
  year =         "1988",
  volume =       "25 A",
  pages =        "277--286",
}

@TechReport{sep:Faigle:81,
  author =       "U. Faigle",
  title =        "Verfahren zur {L}{\"o}sung von Matchingsproblemen",
  institution =  "Univ. K{\"o}ln, Mathematisches Institut",
  year =         "1981",
  address =      "K{\"o}ln",
  pages =        "120",
}

@TechReport{sep:Faigle:83,
  author =       "U. Faigle",
  title =        "Integral Matroids and the Greedy Algorithm for
                 Discrete Optimization Problems",
  institution =  "Univ. Bonn, Institut f{\"u}r {\"O}konometrie und
                 Operations Research",
  year =         "1983",
  number =       "83260-OR",
  address =      "Bonn",
  pages =        "28",
}

@Article{sep:Faigle:84a,
  author =       "U. Faigle",
  title =        "Matroids on Ordered Sets and the Greedy Algorithm",
  journal =      "Ann. Disc. Math.",
  year =         "1984",
  volume =       "19",
  pages =        "115--128",
}

@Article{sep:Faigle:84b,
  author =       "U. Faigle",
  title =        "A Vector Exchange Property of Submodular Systems",
  journal =      "Discrete Appl. Math.",
  year =         "1983",
  volume =       "9",
  pages =        "209--211",
}

@Article{sep:Faigle:85,
  author =       "U. Faigle",
  title =        "Orthogonal Sets, Matroids, and Theorems of the
                 Alternative",
  journal =      "Boll. Un. Mat. Ital. B (6)",
  year =         "1985",
  number =       "6",
  volume =       "4",
  pages =        "139--153",
}

@Article{sep:Faigle:86,
  author =       "U. Faigle",
  title =        "Exchange Properties of Combinatorial Closure Spaces",
  journal =      "Discrete Appl. Math.",
  year =         "1986",
  volume =       "15",
  pages =        "249--260",
}

@TechReport{sep:FaigleGoeckeSchrader:85,
  author =       "U. Faigle and O. Goecke and R. Schrader",
  title =        "On Simplicial Decomposition in Combinatorial
                 Structures",
  institution =  "Univ. Bonn, Institut f{\"u}r {\"O}konometrie und
                 Operations Research",
  year =         "1985",
  number =       "84349",
  address =      "Bonn",
  pages =        "15",
}

@Article{sep:FaigleSchrader:73,
  author =       "U. Faigle and R. Schrader",
  title =        "On the Computational Complexity {B}.{L}.: Calculating
                 kth Shortest Paths",
  journal =      "Infor",
  year =         "1973",
  volume =       "11",
  pages =        "66--70",
}

@TechReport{sep:FaigleSchrader:85a,
  author =       "U. Faigle and R. Schrader",
  title =        "Setup Minimization Techniques for Comparability
                 Graphs",
  institution =  "Univ. Bonn, Institut f{\"u}r {\"O}konometrie und
                 Operations Research",
  year =         "1985",
  number =       "85380",
  address =      "Bonn",
  pages =        "17",
}

@TechReport{sep:FaigleSchrader:85b,
  author =       "U. Faigle and R. Schrader",
  title =        "Interval Orders without Odd Crowns are Defect
                 Optimal",
  institution =  "Univ. Bonn, Institut f{\"u}r {\"O}konometrie und
                 Operations Research",
  year =         "1985",
  number =       "85382",
  address =      "Bonn",
  pages =        "9",
}

@Article{sep:FaigleSchrader:86,
  author =       "U. Faigle and R. Schrader",
  title =        "On the Computational Complexity of the Order
                 Polynomial",
  journal =      "Discrete Appl. Math.",
  year =         "1986",
  volume =       "15",
  pages =        "261--269",
}

@Article{sep:FaigleTuran:87,
  author =       "U. Faigle and Gy. Tur\`{a}n",
  title =        "On the Complexity of Interval Orders and Semiorders",
  journal =      "Discrete Math.",
  year =         "1986",
  volume =       "63",
  pages =        "131--141",
}

@TechReport{sep:FalknerRendlWolkowicz:92,
  author =       "J. Falkner and F. Rendl and H. Wolkowicz",
  title =        "A Computational Study of Graph Partitioning",
  institution =  "Technische Universit{\"a}t Graz",
  year =         "1992",
  number =       "228",
  address =      "Graz",
}

@Article{sep:FedergruenGroenevelt:86,
  author =       "A. Federgruen and H. Groenevelt",
  title =        "Preemptive Scheduling of Uniform Machines by Ordinary
                 Network Flow Techniques",
  journal =      "Management Sci.",
  year =         "1986",
  volume =       "32",
  pages =        "341--349",
}

@InBook{sep:Fichs:6,
  author =       "L. Fuchs",
  title =        "Angeordnete Gruppen",
  publisher =    "?",
  year =         "196x",
  pages =        "73--223",
}

@Article{sep:FiedlerPtak:62,
  author =       "M. Fiedler and V. Pt\'{a}k",
  title =        "On Matrices with Non-Positive Off-Diagonal Elements
                 and Positive Principal Minors",
  journal =      "?",
  year =         "1962",
  pages =        "382--400",
}

@Article{sep:Filus:75,
  author =       "L. Filus",
  title =        "A Combinatorial Lemma for Fixed Point Algrithms",
  journal =      "Nonlinear Programming",
  year =         "1975",
  volume =       "3",
  pages =        "407--427",
}

@Article{sep:FinkeAhrens:78,
  author =       "G. Finke and J. H. Ahrens",
  title =        "A Variant of the primal Transportation Algorithm",
  journal =      "Infor",
  year =         "1978",
  volume =       "16",
  pages =        "35--46",
}

@InProceedings{sep:FinkeRoeck:82,
  author =       "G. Finke and H. R{\"o}ck",
  title =        "A primal Algorithm for a Class of Minimax Network Flow
                 Problems",
  booktitle =    "Methods of Operations Research 45",
  year =         "1982",
  editor =       "R. Henn et al.",
  pages =        "221--232",
  address =      "K{\"o}nigstein/Ts.",
  publisher =    "Athen{\"a}um",
}

@TechReport{sep:FinkeSmith:,
  author =       "G. Finke and P. A. Smith",
  title =        "Primal Equivalentes to the Threshold Algorithm",
  institution =  "Dept. of Applied Mathematics, Nova Scotia Technical
                 College",
  year =         "19xx",
  address =      "Halifax/Canada",
  pages =        "185--198",
}

@Article{sep:FischettiToth:89,
  author =       "Matteo Fischetti and Paolo Toth",
  title =        "An Additive Bounding Procedure for Combinatorial
                 Optimization Problems",
  journal =      "Operations Research",
  volume =       "37",
  number =       "2",
  pages =        "319--328",
  year =         "1989",
}

@Article{sep:FisherNorthupSharpiro:75,
  author =       "M. L. Fisher and W. D. Northup and J. F. Shapiro",
  title =        "Using Duality to Solve Discrete Optimization Problems:
                 Theory and Computational Experience",
  journal =      "Math. Programming Stud.",
  year =         "1975",
  volume =       "3",
  pages =        "56--94",
}

@Article{sep:FisherShapiro:74,
  author =       "M. L. Fisher and J. F. Shapiro",
  title =        "Constructive Duality in Integer Programming",
  journal =      "SIAM J. Appl. Math.",
  year =         "1974",
  volume =       "27",
  pages =        "31--52",
}

@TechReport{sep:FleischnerFrank:88,
  author =       "H. Fleischner and A. Frank",
  title =        "On Circuit Decomposition of Planar Eulerian Graphs",
  institution =  "Universit{\"a}t Bonn, Institut f{\"u}r {\"O}konometrie
                 und OR",
  year =         "1988",
  number =       "88513-OR",
  address =      "Bonn",
  pages =        "9",
}

@Article{sep:Fletcher:,
  author =       "R. Fletcher",
  title =        "Generalized inverse methods for the best least squares
                 solution of systems of non-linear equations",
  journal =      "?",
  year =         "xxxx",
  pages =        "392--399",
}

@TechReport{sep:FlippoJansen:92,
  author =       "O. E. Filippo and B. Jansen",
  title =        "Duality and Sensitivity in Quadratic Optimization over
                 a Sphere",
  institution =  "Delft University of Technology",
  year =         "1992",
  number =       "92-65",
  address =      "Delft",
}

@Article{sep:Fortet:60,
  author =       "R. Fortet",
  title =        "Applications de {L}'Algebre de Boole en Recherche
                 Operationelle",
  journal =      "Revue Francaise De Recherche Operationelle",
  year =         "1960",
  volume =       "4",
  pages =        "17--25",
}

@Article{sep:Fox:73,
  author =       "B. L. Fox",
  title =        "Calculating kth Shortest Paths",
  journal =      "Infor",
  year =         "1973",
  volume =       "11",
  number =       "1",
  pages =        "66--70",
}

@Article{sep:Fraley:90,
  author =       "C. Fraley",
  title =        "Linear Updates for a Single-Phase Projective Mathod",
  journal =      "Oper. Res. Lett.",
  year =         "1990",
  volume =       "9",
  pages =        "13",
}

@TechReport{sep:FraleyVial:90,
  author =       "C. Fraley and J.-P. Vial",
  title =        "Single-Phase versus Multi-Phase Projective Methods for
                 Linear Programming",
  institution =  "University of Geneva COMIN",
  year =         "1990",
  address =      "Geneva/Schweiz",
  pages =        "24",
}

@Article{sep:Frank:78,
  author =       "A. Frank",
  title =        "On Chain and Antichain Families fo a Partially Ordered
                 Set",
  journal =      "J. Combin. Theory Ser. B",
  year =         "1978",
  volume =       "29",
  number =       "Series B",
  pages =        "176--184",
}

@Article{sep:Frank:79a,
  author =       "A. Frank",
  title =        "Covering branchings",
  journal =      "Acta Sci. Math. (Szeged)",
  year =         "1979",
  volume =       "41",
  pages =        "77--81",
}

@Article{sep:Frank:79b,
  author =       "A. Frank",
  title =        "Kernel systems of directed graphs",
  journal =      "Acta Sci. Math. (Szeged)",
  year =         "1979",
  volume =       "41",
  pages =        "63--76",
}

@Article{sep:Frank:80,
  author =       "A. Frank",
  title =        "On the Orientation of Graphs",
  journal =      "J. Combin. Theory Ser. B",
  year =         "1980",
  volume =       "28",
  number =       "Series B",
  pages =        "251--261",
}

@Article{sep:Frank:81a,
  author =       "A. Frank",
  title =        "A weighted matroid intersection algorithm",
  journal =      "J. Comput. Math.",
  year =         "1981",
  volume =       "10",
  pages =        "35--41",
}

@Article{sep:Frank:81b,
  author =       "A. Frank",
  title =        "How to make a Digraph Strongly Connected",
  journal =      "Combinatorica",
  year =         "1981",
  volume =       "1",
  pages =        "145--153",
}

@InProceedings{sep:Frank:81c,
  author =       "A. Frank",
  title =        "On Disjoint Trees and Arborescences",
  booktitle =    "Algebraic Methods in Graph Theory, Vol. I",
  year =         "1981",
  editor =       "L. Lov\`asz and V. T. Sos",
  pages =        "159--170",
  organization = "Colloquia Mathematica Societatis Janos Bolyai 25",
  address =      "Amsterdam",
  publisher =    "North-Holland",
}

@Article{sep:Frank:82,
  author =       "A. Frank",
  title =        "Disjoint Paths in a Rectilinear Grid",
  journal =      "Combinatorica",
  year =         "1982",
  volume =       "2",
  pages =        "361--372",
}

@TechReport{sep:Frank:84a,
  author =       "A. Frank",
  title =        "Generalized Polymatroids",
  journal =      "Colloq.Math.Soc.",
  year =         "1981",
  number =       "1",
  volume =       "37",
  pages =        "285--294",
}

@Article{sep:Frank:84b,
  author =       "A. Frank",
  title =        "Finding Feasible Vectors of Edmonds-Giles Polyhedra",
  journal =      "J. Combin. Theory Ser. B",
  year =         "1984",
  volume =       "36",
  pages =        "221--239",
}

@InProceedings{sep:Frank:84c,
  author =       "A. Frank",
  title =        "Submodular Flows",
  booktitle =    "Progress in Combinatorial Optimization",
  year =         "1984",
  editor =       "W. R. Pulleyblank",
  pages =        "147--166",
  address =      "New York",
  publisher =    "Academic Press",
}

@TechReport{sep:Frank:87,
  author =       "A. Frank",
  title =        "Graph Connectivity and Network Flows",
  institution =  "Universit{\"a}t Bonn, Institut f{\"u}r {\"O}konometrie
                 und OR",
  year =         "1987",
  number =       "87473-OR",
  address =      "Bonn",
  pages =        "72",
}

@TechReport{sep:Frank:88,
  author =       "A. Frank",
  title =        "Packing Paths, Circuits and Cuts a Survey",
  institution =  "Rhein. Friedr.-Wilhelms-Universit{\"a}t, Inst. f{\"u}r
                 {\"O}konometrie und OR",
  year =         "1988",
  number =       "88532-OR",
  address =      "Bonn",
  pages =        "57",
}

@Article{sep:Frank:89,
  author =       "A. Frank",
  title =        "On Connectivity Properties of Eulerian Digraphs",
  journal =      "Ann. Disc. Math.",
  year =         "1989",
  volume =       "41",
  pages =        "179--194",
}

@Article{sep:Frank:90a,
  author =       "A. Frank",
  title =        "On Disjoint Homotopic Paths in the Plane",
  journal =      "Comput. Sci. 1; Ser. Discrete Math. Theory",
  year =         "1990",
  volume =       "1",
  pages =        "163--170",
}

@TechReport{sep:Frank:90b,
  author =       "A. Frank",
  title =        "Submodular Functions in Graph Theory",
  institution =  "Rhein. Friedr.-Wilhelms-Universit{\"a}t, Inst. f{\"u}r
                 {\"O}konometrie und OR",
  year =         "1990",
  number =       "90660-OR",
  address =      "Bonn",
  pages =        "16",
}

@TechReport{sep:Frank:90c,
  author =       "A. Frank",
  title =        "On a Theorem of Mader",
  institution =  "Rhein. Friedr.-Wilhelms-Universit{\"a}t, Inst. f{\"u}r
                 {\"O}konometrie und OR",
  year =         "1990",
  number =       "90672-OR",
  address =      "Bonn",
  pages =        "11",
}

@TechReport{sep:Frank:91,
  author =       "A. Frank",
  title =        "On Sparse Subgraphs Preserving Connectivity
                 Properties.",
  institution =  "Rhein. Friedr.-Wilhelms-Universit{\"a}t, Inst. f{\"u}r
                 {\"O}konometrie und OR",
  year =         "1991",
  number =       "91684-OR",
  address =      "Bonn",
  pages =        "7",
}

@Article{sep:FrankSebo:84,
  author =       "A. Frank and A. Sebo",
  title =        "Covering Directed and odd Cuts",
  journal =      "Math. Programming Stud.",
  year =         "1984",
  volume =       "22",
  pages =        "99--112",
}

@InProceedings{sep:FrankTardos:84,
  author =       "A. Frank and E. Tardos",
  title =        "Matroids from Crossing Families",
  booktitle =    "Finite and Infinite Sets",
  year =         "1984",
  editor =       "A. Hajna",
}

@Article{sep:FrankTardos:87,
  author =       "A. Frank and E. Tardos",
  title =        "An Application of the Simultaneous Approximation in
                 Combinatorial Optimization",
  journal =      "Combinatorica",
  year =         "1987",
  volume =       "7",
  pages =        "49--65",
}

@Article{sep:FrankTardos:88,
  author =       "A. Frank and E. Tardos",
  title =        "Generalized Polymatroids and Submodular Flows",
  journal =      "Math. Programming",
  year =         "1988",
  volume =       "42",
  number =       "3",
  pages =        "489--563",
}

@Article{sep:FrankTardos:89,
  author =       "A. Frank and E. Tardos",
  title =        "An Application of Submodular Flows",
  journal =      LINAA2,
  year =         "1989",
  volume =       "114/115",
  pages =        "329--348",
}

@Article{sep:FrattaMontanari:75,
  author =       "L. Fratta and U. Montanari",
  title =        "A Vertex Elimination Algorithm for Enumeratin all
                 Simple Paths in a Graph",
  journal =      "Networks",
  year =         "1975",
  volume =       "5",
  pages =        "151--177",
}

@Article{sep:Fredman:76,
  author =       "F. L. Fredman",
  title =        "New Bounds on the Complexity of the shortest Path
                 Problem",
  journal =      "SIAM J. Comput.",
  year =         "1976",
  volume =       "5",
  pages =        "83--89",
}

@Article{sep:FredmanTarjan:87,
  author =       "M. L. Fredman and R. E. Tarjan",
  title =        "Fibonacci Heaps and their uses in Improved Network
                 Optimization Algorithms",
  journal =      "J. Assoc. Comput. Mach.",
  year =         "1987",
  volume =       "34",
  pages =        "596--615 p.",
}

@TechReport{sep:Freund:88a,
  author =       "R. M. Freund",
  title =        "Projective Transformations for Interior Point Methods,
                 Part {I}: Basic Theory and Linear Programming",
  institution =  "Massachusetts Institute of Technology, OR Center",
  year =         "1988",
  number =       "179-88",
  address =      "Cambridge, MA",
  pages =        "51",
}

@TechReport{sep:Freund:88b,
  author =       "R. M. Freund",
  title =        "Projective Transformations for Interior Point Methods,
                 Part {II}: Analysis of An Algorithm for finding the
                 Weighted Center of a Polyhedral System",
  institution =  "Massachusetts Institute of Technology, OR Center",
  year =         "1988",
  number =       "180-88",
  address =      "Cambridge, MA",
  pages =        "31",
}

@Article{sep:Freund:88c,
  author =       "R. M. Freund",
  title =        "An Analgog of Karmarkar's Algorithm for Inequality
                 Constrained Linear Programs, with a {"}New{"} Class of
                 Projective Transformations for Centering a Polytope",
  journal =      "Oper. Res. Lett.",
  year =         "1988",
  volume =       "7",
  pages =        "9--13",
}

@TechReport{sep:Freund:88d,
  author =       "R. M. Freund",
  title =        "Polynomial-Time Algorithms for Linear Programming
                 Based Only on Primal Scaling and Projected Gradients of
                 a Potential Function",
  institution =  "Massachusetts Institute of Technlology, OR Center",
  year =         "1988",
  number =       "182-88",
  address =      "Cambridge, MA",
  pages =        "28",
}

@TechReport{sep:FreundTodd:92,
  author =       "Robert M. Freund and Michael J. Todd",
  title =        "Barrier Functions and Interior-Point Algorithms for
                 Linear Programming with Zero-, One-, or Two-Sides
                 Bounds on the Variables",
  institution =  "Cornell University",
  month =        jul,
  year =         "1992",
  number =       "1016",
  address =      "Ithaca,NY",
  annote =       "Technical Report",
}

@Article{sep:FridenHertzDeWerra:89,
  author =       "C. Friden and A. Hertz and D. de Werra",
  title =        "{STABULUS}: {A} Technique for Finding Stable Sets in
                 Large Graphs with Tabu Search",
  journal =      "Computing",
  year =         "1989",
  volume =       "42",
  pages =        "35--44",
}

@Book{sep:Fridman:76,
  author =       "A. A. Fridman",
  title =        "Discrete Optimization",
  publisher =    "NAUKA-Verlag",
  year =         "1976",
  address =      "Moskau",
  pages =        "327--332",
}

@TechReport{sep:Friedland:78,
  author =       "S. Friedland",
  title =        "A Lower Bound for the Permanent of a Doubly Stochastic
                 Matrix",
  institution =  "The Hebrew University",
  year =         "1978",
  number =       "1882",
  address =      "Jerusalem",
  pages =        "15",
}

@Article{sep:FriesdorfHamacher:81,
  author =       "H. Friesdorf and H. Hamacher",
  title =        "A Note on Weighted Minimal Cost Flows",
  journal =      "Z. Oper. Res. Ser. A-B",
  year =         "1981",
  volume =       "25",
  pages =        "45--47",
}

@Article{sep:FriesdorfHamacher:82a,
  author =       "H. Friesdorf and H. Hamacher",
  title =        "Weighted Min Cost Flows",
  journal =      "European J. Oper. Res.",
  year =         "1982",
  volume =       "11",
  pages =        "181--192",
}

@InProceedings{sep:FriesdorfHamacher:82b,
  author =       "H. Friesdorf and H. Hamacher",
  title =        "A negative circuit algorithm for weighted min cost
                 flows",
  booktitle =    "Proceedings of the 7th Confrence on Graphtheoretic
                 Concepts in Computer Science (WG 81), June 1981, Linz",
  year =         "1982",
  editor =       "J. R. M{\"u}hlbacher",
  pages =        "115--126",
  address =      "M{\"u}nchen",
  publisher =    "Hanser",
}

@Article{sep:Frieze:75,
  author =       "A. M. Frieze",
  title =        "Bottleneck Linear Programming",
  journal =      "Operational Research Quarterly",
  year =         "1975",
  volume =       "26",
  pages =        "871--874",
}

@TechReport{sep:Frieze:78,
  author =       "A. M. Frieze",
  title =        "Algebraic Linear Programming",
  institution =  "Queen Mary College (University)",
  year =         "1978",
  address =      "London",
  pages =        "17",
}

@Article{sep:Frieze:79a,
  author =       "A. M. Frieze",
  title =        "An Algorithm for Algebraic Assignment Problems",
  journal =      "Discrete Appl. Math.",
  year =         "1979",
  volume =       "1",
  pages =        "253--259",
}

@TechReport{sep:Frieze:79b,
  author =       "A. M. Frieze",
  title =        "Algebraic Linear Programming",
  institution =  "Queen Mary College (University)",
  year =         "1979",
  address =      "London",
  pages =        "21",
}

@TechReport{sep:Froehlich:7,
  author =       "K. Fr{\"o}hlich",
  title =        "Subgradientenverfahren zur {L}{\"o}sung
                 dreidimensionaler Zuordnungsprobleme",
  institution =  "Mathematisches Institut der Universit{\"a}t zu
                 K{\"o}ln.",
  year =         "197x",
  address =      "K{\"o}ln",
}

@TechReport{sep:FroleyksKorteProemel:89,
  author =       "B. Froleyks and B. Korte and H. J. Pr{\"o}mel",
  title =        "Routing in {VLSI}-Layout",
  institution =  "Rheinische Friedr.-Wilhelms-Universit{\"a}t, Inst.
                 f{\"u}r {\"O}konometrie und OR",
  year =         "1989",
  number =       "87494-OR",
  address =      "Bonn",
  pages =        "20",
}

@Article{sep:FruhwirthBurkardRote:89,
  author =       "B. Fruhwirth and R. E. Burkard and G. Rote",
  title =        "Approximation of Convex Curves with Applications to
                 the Bicriterial Minimum Cost Flow Problem",
  journal =      "European J. Oper. Res.",
  year =         "1989",
  number =       "3",
  volume =       "42",
  pages =        "326--338",
}

@InBook{sep:Fuchs:6,
  author =       "L. Fuchs",
  title =        "Angeordnete Halbgruppen",
  publisher =    "?",
  year =         "196x",
  pages =        "225--250",
}

@TechReport{sep:Fuchs:66,
  author =       "L. Fuchs",
  title =        "Teilweise geordnete algebraische Strukturen",
  institution =  "Vandenhoek und Ruprecht",
  year =         "1966",
  type =         "Bibliographie",
  address =      "G{\"o}ttingen",
}

@Manual{sep:Fuchs:7,
  author =       "L. Fuchs",
  title =        "Hahn's Theorem",
  year =         "197x",
  note =         "10 p.",
}

@Article{sep:Fujishige:77a,
  author =       "S. Fujishige",
  title =        "A Primal Approach to the Independent Assignment
                 Problem",
  journal =      "J. Oper. Res. Soc. Japan",
  year =         "1977",
  volume =       "20",
  pages =        "1--15",
}

@Article{sep:Fujishige:77b,
  author =       "S. Fujishige",
  title =        "An Algorithm for finding an Optimal Independent
                 Linkage",
  journal =      "J. Oper. Res. Soc. Japan",
  year =         "1977",
  volume =       "20",
  pages =        "59--75",
}

@Article{sep:Fujishige:78a,
  author =       "S. Fujishige",
  title =        "Algorithms for Solving the Independent-Flow Problems",
  journal =      "J. Oper. Res. Soc. Japan",
  year =         "1978",
  volume =       "21",
  pages =        "189--203",
}

@TechReport{sep:Fujishige:78b,
  author =       "S. Fujishige",
  title =        "Polymatroidal Dependence Structure of a Set of Random
                 Variables",
  institution =  "University of Tokio",
  year =         "1978",
  address =      "Tokio",
  pages =        "55--72",
}

@TechReport{sep:Fujishige:79,
  author =       "S. Fujishige",
  title =        "An Efficient {PQ}-Graph Algorithm for Solving the
                 Graph-Realization Problem",
  institution =  "University of Tsukuba",
  year =         "1979",
  number =       "79-3",
  address =      "Sakura",
  pages =        "63--86",
}

@Article{sep:Fujishige:80a,
  author =       "S. Fujishige",
  title =        "Principal Structures of Submodular Systems",
  journal =      "Discrete Appl. Math.",
  year =         "1980",
  volume =       "2",
  pages =        "77--80",
}

@Article{sep:Fujishige:80b,
  author =       "S. Fujishige",
  title =        "Lexicographically Optimal Base of a Polymatroid with
                 Respect to a Weight Vektor",
  journal =      "Math. Oper. Res.",
  year =         "1980",
  volume =       "5",
  pages =        "186--196",
}

@InProceedings{sep:Fujishige:81,
  author =       "S. Fujishige",
  title =        "Canonical Decompositions of Symmetric Submodular
                 Systems",
  booktitle =    "Graph Theory and Algorithms",
  year =         "1981",
  editor =       "N. Saito and T. Nishizeki",
  pages =        "53--64",
  organization = "Lecture Notes in Computer Science 108",
  address =      "Berlin",
  publisher =    "Springer",
}

@TechReport{sep:Fujishige:82a,
  author =       "S. Fujishige",
  title =        "Characterization of Subdifferentials of submodular
                 functions and its relation to lovasz`s extension of
                 submodular functions",
  institution =  "Rhein. Friedr.-Wilhelm-Universitaet, Bonn",
  year =         "1982",
  number =       "82241-OR",
}

@TechReport{sep:Fujishige:82b,
  author =       "S. Fujishige",
  title =        "An Algorithms for finding a Minimum-Cost Strongly
                 Connected Reorientation of a Directed Graph",
  institution =  "Rheinische Friedr.-Wilhelm-Universit{\"a}t",
  year =         "1982",
  address =      "Bonn",
  pages =        "23",
}

@Article{sep:Fujishige:84a,
  author =       "S. Fujishige",
  title =        "A System of Linear Inequalities with a Submodular
                 Function",
  journal =      LINAA2,
  year =         "1984",
  volume =       "63",
  pages =        "253--266",
}

@Article{sep:Fujishige:84b,
  author =       "S. Fujishige",
  title =        "On the Subdifferential of a Submodular Function",
  journal =      "Math. Programming",
  year =         "1984",
  volume =       "29",
  pages =        "348--360",
}

@Article{sep:Fujishige:84c,
  author =       "S. Fujishige",
  title =        "Submodular Systems and Related Topics",
  journal =      "Math. Programming Stud.",
  year =         "1984",
  volume =       "22",
  pages =        "113--131",
}

@Article{sep:Fujishige:84d,
  author =       "S. Fujishige",
  title =        "A Note on Frank's Generalized Polymatroids",
  journal =      "Discrete Appl. Math.",
  year =         "1984",
  volume =       "7",
  pages =        "105--109",
}

@Article{sep:Fujishige:84e,
  author =       "S. Fujishige",
  title =        "Theory of Submodular Programs: {A} Fenchel-Type
                 Min-Max Theorem and Subgradients of Submodular
                 Functions",
  journal =      "Math. Programming",
  year =         "1984",
  volume =       "29",
  pages =        "142--155",
}

@Article{sep:Fujishige:84f,
  author =       "S. Fujishige",
  title =        "Structures of Polyhedra Determined by Submodular
                 Functions on Crossing Families",
  journal =      "Math. Programming",
  year =         "1984",
  volume =       "29",
  pages =        "125--141",
}

@Article{sep:Fujishige:84g,
  author =       "S. Fujishige",
  title =        "Combinatorial Optimization Problems Described by
                 Submodular Functions",
  journal =      "Operational Research '84",
  year =         "1984",
  pages =        "379--392",
}

@InProceedings{sep:Fujishige:84h,
  author =       "S. Fujishige",
  title =        "Combinatorial Optimization Problems Described by
                 Submodular Functions",
  booktitle =    "Operational Research 1984",
  year =         "1984",
  editor =       "J. B. Brans",
  pages =        "379--391",
  organization = "CIFORS",
  address =      "Amsterdam",
  publisher =    "Elsevier Science Publishers B.V. (North-Holland)",
}

@Article{sep:Fujishige:84i,
  author =       "S. Fujishige",
  title =        "A Characterization of Faces of the Base Polyhedron
                 Associated with a Submodular System",
  journal =      "J. Oper. Res. Soc. Japan",
  year =         "1984",
  volume =       "27",
  pages =        "112--129",
}

@TechReport{sep:Fujishige:85b,
  author =       "S. Fujishige",
  title =        "A simple proof of the validity of Bland's anticycling
                 rule for the simplex method",
  institution =  "University of Tsukuba",
  year =         "1985",
  number =       "268",
  address =      "Sakura,Ibaraki",
  pages =        "8",
}

@Article{sep:Fujishige:86,
  author =       "S. Fujishige",
  title =        "A Capacity-Rounding Algorithm for the Minimum-Cost
                 Circulation Problem: {A} Dual Framework of the Tardos
                 Algorithm",
  journal =      "Math. Programming",
  year =         "1986",
  volume =       "35",
  pages =        "298--308",
}

@Article{sep:Fujishige:87,
  author =       "S. Fujishige",
  title =        "An Out-Of-Kilter Method for Submodular Flows",
  journal =      "Discrete Appl. Math.",
  year =         "1987",
  volume =       "17",
  pages =        "3--16",
}

@Article{sep:Fujishige:88,
  author =       "S. Fujishige",
  title =        "Optimization over the Polyhedron Determined by a
                 Submodular Function on a Co-Intersecting Family",
  journal =      "Math. Programming",
  year =         "1988",
  volume =       "42",
  number =       "3",
  pages =        "565--577",
}

@InProceedings{sep:Fujishige:89,
  author =       "S. Fujishige",
  title =        "Linear and nonlinear problems with submodular
                 constraints",
  pages =        "203--225",
  booktitle =    "Proc. Mathematical programming; Math. Appl., Japan
                 Ser. 6",
  year =         "1989",
}

@Article{sep:Fujishige:91,
  author =       "S. Fujishige",
  title =        "Submodular Functions and Optimization",
  journal =      "Ann. Disc. Math.",
  year =         "1991",
  volume =       "47",
  pages =        "270",
}

@Article{sep:FujishigeKatohIchimori:88,
  author =       "S. Fujishige and N. Katoh and T. Ichimori",
  title =        "The Fair Resource Allocation Problem with Submodular
                 Constraints",
  journal =      "Math. Oper. Res.",
  year =         "1988",
  volume =       "13",
  pages =        "164--173",
}

@Article{sep:FujishigeNakayamaCui:86,
  author =       "A. Fujishige and A. Nakayama and W. T. Cui",
  title =        "On the Equivalence of the Maximum Balanced Flow
                 Problem and the Weighted Minimax Flow Problem",
  journal =      "Oper. Res. Lett.",
  year =         "1986",
  volume =       "5",
  pages =        "207--209",
}

@PhdThesis{sep:Fukuda:81,
  author =       "K. Fukuda",
  title =        "Oriented Matroid Programming",
  school =       "University of Waterloo",
  year =         "1981",
  address =      "Waterloo",
  pages =        "74",
}

@TechReport{sep:Fulkerson:63,
  author =       "D. R. Fulkerson",
  title =        "The Maximum Number of Disjoint Permutations Contained
                 in a Matrix of Zeros and Ones",
  institution =  "Rand Corporation",
  year =         "1963",
  address =      "Santa Monica",
  pages =        "729--735",
}

@Article{sep:Fulkerson:66,
  author =       "D. R. Fulkerson",
  title =        "Flow Networks and Combinatorial Operations Research",
  journal =      "American Mathematical Monthly",
  year =         "1966",
  volume =       "73",
  pages =        "115--138",
}

@InProceedings{sep:Fulkerson:68,
  author =       "D. R. Fulkerson",
  title =        "Networks, Frames, Blocking Systems",
  booktitle =    "Mathematics of the Decision Sciences, Part 1",
  year =         "1968",
  editor =       "G. B. Dantzig and A. F. Veinott",
  pages =        "303--334",
  address =      "Prividence",
  publisher =    "American Mathematical Society",
}

@Article{sep:Fulkerson:71,
  author =       "D. R. Fulkerson",
  title =        "Blocking and Anti-Blocking Pairs of Polyhedra",
  journal =      "Math. Programming",
  year =         "1971",
  volume =       "1",
  pages =        "168--194",
}

@InCollection{sep:Fulkerson:72,
  author =       "D. R. Fulkerson",
  title =        "Flow Networks and Combinatorial Operations Research",
  booktitle =    "Perspectives on Optimization : A Collection of
                 Expository Articles",
  year =         "1972",
  editor =       "A. M. Geoffrion",
  pages =        "197--220 p.",
  publisher =    "Addison-Wesley",
}

@Article{sep:Fulkerson:74,
  author =       "D. R. Fulkerson",
  title =        "On Balanced Matrices",
  journal =      "Math. Programming Stud.",
  year =         "1974",
  volume =       "1",
  pages =        "120--132",
}

@Article{sep:Furman:70,
  author =       "M. E. Furman",
  title =        "Application of a Method of Fast Multiplication of
                 Matrices in the Problem of Finding the Transitive
                 Closure of a Graph",
  journal =      "Soviet Math. Dokl.",
  year =         "1970",
  volume =       "11",
  pages =        "1252",
}

@Article{sep:G.MarkosyanS.E.Markosyan:76,
  author =       "A. G. Markosyan and S. E. Markosyan",
  title =        "Algorithms for Testing Certian Graph Properties",
  journal =      "Kibernetika (Kiev)",
  year =         "1976",
  volume =       "2",
  pages =        "76--81",
}

@TechReport{sep:Gabovich:73,
  author =       "E. Ya. Gabovich",
  title =        "Assignment Problem",
  institution =  "Moskau",
  year =         "1973",
  address =      "Moskau",
}

@Article{sep:Gabovich:76,
  author =       "E. Ya. Gabovich",
  title =        "Fully ordered Semigroups and their Applications",
  journal =      "Russian Math. Surveys",
  year =         "1976",
  volume =       "31",
  pages =        "147--216",
}

@Article{sep:Gabovich:82,
  author =       "E. Ya. Gabovich",
  title =        "On Spectral Theory in Discrete Programming",
  journal =      "Discrete Appl. Math.",
  year =         "1982",
  volume =       "4",
  pages =        "269--280",
}

@Article{sep:Gabow:85,
  author =       "H. N. Gabow",
  title =        "Scaling Algorithms for Network Problems",
  journal =      "J. Comput. System Sci.",
  year =         "1985",
  volume =       "31",
  pages =        "148--168",
}

@InProceedings{sep:GabowTarjan:79,
  author =       "H. N. Gabow and R. E. Tarjan",
  title =        "Efficient Algorithms for Simple Matroid Intersection
                 Problems",
  booktitle =    "Annual Symposium on Foundations of Computer Science,
                 San Juan 1979",
  year =         "1979",
  pages =        "196--204",
  address =      "New York",
  publisher =    "Institute of Electrical and Electronics Engineers",
}

@Article{sep:GabowTarjan:84,
  author =       "H. N. Gabow and R. E. Tarjan",
  title =        "Efficient Algorithms for a Family of Matroid
                 Intersection Problems",
  journal =      "J. Algorithms",
  year =         "1984",
  volume =       "5",
  pages =        "80--131",
}

@Article{sep:GaililTardos:88,
  author =       "Z. Gailil and E. Tardos",
  title =        "An {O}(n2(m + n log n)log n) Min-Cost Algorithm",
  journal =      "J. Assoc. Comput. Mach.",
  year =         "1988",
  volume =       "35",
  pages =        "374--396",
}

@Article{sep:Gal:86,
  author =       "T. Gal",
  title =        "Shadow Prices and Sensitivity Analysis in Linear
                 Programming under Degeneracy. State-of-the-Art-Survey",
  journal =      "OR Spektrum",
  year =         "1986",
  volume =       "8",
  pages =        "59--71",
}

@Article{sep:GalMiranker:77,
  author =       "S. Gal and W. Miranker",
  title =        "Optimal Sequential and Parallel Search for Finding a
                 Root",
  journal =      "J. Combin. Theory Ser. A",
  year =         "1977",
  volume =       "23",
  pages =        "1--14",
}

@TechReport{sep:GalambosWoeginger:91,
  author =       "G. Galambos and G. Woeginger",
  title =        "An On-Line Scheduling Heuristic with Better Worst Case
                 Radio that Graham's List Scheduling",
  institution =  "TU Graz, Inst. f. Mathematik",
  year =         "1991",
  number =       "183",
  address =      "Graz",
  pages =        "9",
}

@TechReport{sep:GalambosWoeginger:93a,
  author =       "Gabor Galambos and Gerhard J. Woeginger",
  title =        "Minimizing the Weighted Number of Tardy Jobs in {EUT}
                 Open Shops",
  institution =  "Institut f{\"u}r Mathematik",
  year =         "1993",
  number =       "273",
  address =      "Technische Universit{\"a}t Graz",
}

@TechReport{sep:GalambosWoeginger:93b,
  author =       "Gabor Galambos and Gerhard J. Woeginger",
  title =        "On-Line Bin Packing - {A} Restricted Survey",
  institution =  "Institut f{\"u}r Mathematik",
  year =         "1993",
  number =       "280",
  address =      "Technische Universit{\"a}t Graz",
}

@Article{sep:Gale:68,
  author =       "D. Gale",
  title =        "Optimal Assignments in an Ordered Set: An Application
                 of Matroid Theory",
  journal =      "J. Combin. Theory Ser. A",
  year =         "1968",
  volume =       "4",
  pages =        "176--180",
}

@Article{sep:GalePlitof:81,
  author =       "D. Gale and T. Plitof",
  title =        "Substitutes and Complements in Network Flow Problems",
  journal =      "Discrete Appl. Math.",
  year =         "1981",
  volume =       "3",
  pages =        "175--186",
}

@Article{sep:Galil:78a,
  author =       "Z. Galil",
  title =        "A new Algorithms for the Maximal Flow Problem",
  journal =      "Proc. IEEE Symp. Foundations of Computer Science",
  year =         "1978",
  volume =       "19",
  pages =        "231--245",
}

@TechReport{sep:Galil:78b,
  author =       "Z. Galil",
  title =        "On the Theoretical Efficiency of Various Netork Flow
                 Algorithms",
  institution =  "IBM Research Center",
  year =         "1978",
  number =       "7320",
  address =      "Yorktown Heights",
  pages =        "9",
}

@Article{sep:GalloGrigoriadisTarjan:89,
  author =       "G. Gallo and M. D. Grigoriadis and R. E. Tarjan",
  title =        "A Fast Parametric Maximum Flow Algorithm",
  year =         "1989",
  journal =      "SIAM J. Comput.",
  volume =       "1",
  pages =        "30--55",
}

@TechReport{sep:GambleConnPuuleyblank:86,
  author =       "A. B. Gamble and A. R. Conn and W. R. Pulleyblank",
  title =        "A Network Penalty Method",
  institution =  "Rheinische Friedr.-Wilh.-Universit{\"a}t, Inst. f.
                 {\"O}konometrie und OR",
  year =         "1986",
  number =       "86445-OR",
  address =      "Bonn",
  pages =        "28",
}

@Article{sep:GanterGronau:91,
  author =       "B. Ganter and H.-D. O. F. Gronau",
  title =        "On two conjectures of demetrovics, f{\"u}redi, and
                 katona, concerning partitions",
  year =         "1991",
  journal =      "Discrete Math.",
  volume =       "2/3",
  pages =        "149--155",
}

@TechReport{sep:GareyJohnson:75,
  author =       "M. R. Garey and D. S. Johnson",
  title =        "Performance Guarantees for Heuristic Algorithms: An
                 Annotated Bibliography",
  institution =  "Bell Laboratories",
  year =         "1975",
  address =      "Murray Hill, NJ",
  pages =        "8",
}

@Article{sep:GareyJohnson:76,
  author =       "M. R. Garey and D. S. Johnson",
  title =        "Some Simplified {NP}-Complete Graph Problems",
  journal =      "Theoret. Comput. Sci.",
  year =         "1976",
  volume =       "1",
  pages =        "237--267",
}

@Article{sep:Garfinkel:71,
  author =       "R. S. Garfinkel",
  title =        "An Improved Algorithm for the Bottleneck Assignment
                 Problem",
  journal =      "Oper. Res.",
  year =         "1971",
  volume =       "19",
  pages =        "1747--1751",
}

@Article{sep:GarfinkelRao:71,
  author =       "R. S. Garfinkel and M. R. Rao",
  title =        "The Bottleneck Transportation Problem",
  journal =      "Naval Research Logistics Quarterly",
  year =         "1971",
  volume =       "18",
  pages =        "465--472",
}

@Article{sep:GarfinkelRao:76,
  author =       "R. S. Garfinkel and M. R. Rao",
  title =        "Bottleneck Linear Pr\'{o}gramming",
  journal =      "Math. Programming",
  year =         "1976",
  volume =       "11",
  pages =        "291--298",
}

@Article{sep:GassShaoJr:85,
  author =       "Saul Gass and S. P. I. Shao Jr.",
  title =        "On the Solution of Special Generalized Upper-Bounded
                 Problems: The {LP}/{GUB} Knapsack Problem and the -Form
                 Separable Convex Objective Function Problem",
  journal =      "Math. Programming Stud.",
  year =         "1985",
  volume =       "24",
  pages =        "104--115",
}

@Article{sep:Gassner:64,
  author =       "B. J. Gassner",
  title =        "Cycling in the Transportation Problem",
  journal =      "Naval Research Logistics Quarterly",
  year =         "1964",
  volume =       "11",
  pages =        "43--58",
}

@PhdThesis{sep:Gaubert:93,
  author =       "S. Gaubert",
  title =        "{R}\'{e}sultats suppl\'{e}mentaires de th\'{e}orie
                 spectrale des matrices",
  year =         "1993",
  annote =       "included with R.B. Bapat, David P. Stanford, P. van de
                 Driessche",
}

@Article{sep:GaulHeinecke:75,
  author =       "W. Gaul and A. Heinecke",
  title =        "Einige Aspekte in der Zuordnungstheorie",
  journal =      "Z. Oper. Res. Ser. A-B",
  year =         "1975",
  volume =       "19",
  pages =        "89--99",
}

@TechReport{sep:GavalecHudec:92,
  author =       "M. Gavalec and O. Hudec",
  title =        "A Polynomial Algorithm for a Balanced Location on a
                 Graph",
  institution =  "Technical University, Dep. of Mathematics",
  year =         "1992",
  address =      "Kosice/CSSR",
  pages =        "8",
}

@Article{sep:GavishSchweitzerShlifer:77,
  author =       "B. Gavish and P. Schweitzer and E. Shlifer",
  title =        "The Zero Pivot Phenomenon in Transportation and
                 Assignment Problems and its Computational
                 Implications",
  journal =      "Math. Programming",
  volume =       "12",
  year =         "1977",
  pages =        "226--240",
}

@TechReport{sep:Gay:87,
  author =       "D. M. Gay",
  title =        "Pictures of Karmarkar's Linear Programming Algorithm",
  institution =  "AT\&T Bell Laboratories",
  year =         "1987",
  number =       "136",
  address =      "Murray Hill, NJ",
  pages =        "46",
}

@TechReport{sep:GayKarmarkarRamamkrishnan:86,
  author =       "D. M. Gay and N. K. Karmarkar and K. G.
                 Ramamkrishnan",
  title =        "The Karmarkar algorithm: Adding wings to linear
                 programming",
  institution =  "AT\&T Bell Laboratories",
  year =         "1986",
  address =      "Murray Hill, NJ",
  pages =        "7",
}

@Article{sep:GeethaNair:93,
  author =       "S. Geetha and K. P. K. Nair",
  title =        "A Variation of the Assignment Problem",
  journal =      "European Journal of Operations Research",
  volume =       "68",
  pages =        "422--426",
  year =         "1994",
}

@Article{sep:Geoffrion:68,
  author =       "A. M. Geoffrion",
  title =        "Proper Efficiency and the Theory of Vector
                 Maximization",
  journal =      "J. Math. Anal. Appl.",
  year =         "1968",
  volume =       "22",
  pages =        "618--630",
}

@Article{sep:Geoffrion:74,
  author =       "A. M. Geoffrion",
  title =        "Lagrangean Relaxation for Integer Programming",
  journal =      "Math. Programming Stud.",
  year =         "1974",
  volume =       "2",
  pages =        "82--114",
}

@Article{sep:Geoffrion:77,
  author =       "A. M. Geoffrion",
  title =        "Objective Function Approximations in Mathematical
                 Programming",
  journal =      "Math. Programming",
  year =         "1977",
  volume =       "13",
  pages =        "23--37",
}

@Article{sep:GerardsSeboe:87,
  author =       "A. M. H. Gerards and A. Seb{\"o}",
  title =        "Total Dual Integrality Implies Local Strong
                 Unimodularity",
  year =         "1987",
  journal =      "Math. Programming",
  volume =       "38",
  pages =        "69--73",
}

@Article{sep:GhellnickVial:86,
  author =       "G. de Ghellinck and J. Ph. Vial",
  title =        "A Polynomial Newton Method for Linear Programming",
  journal =      "Algorithmica",
  volume =       "1",
  year =         "1986",
  pages =        "425--453",
}

@Article{sep:GhellnickVial:87,
  author =       "G. de Ghellinck and J. Ph. Vial",
  title =        "An Extension of Karmarkar's Algorithm for Solving a
                 System of Linear Honogeneous Equations on the Simplex",
  journal =      "Math. Programming",
  year =         "1987",
  volume =       "39",
  pages =        "79--92 p.",
}

@TechReport{sep:Gieron:8,
  author =       "Gieron",
  title =        "Ellipsoidmethoden und Rechnererfahrungen am Beispiel
                 des Zuordnungsproblems",
  institution =  "Mathematisches Institut, Universit{\"a}t zu K{\"o}ln",
  year =         "198x",
  address =      "K{\"o}ln",
  pages =        "11",
}

@TechReport{sep:Giffler:60,
  author =       "B. Giffler",
  title =        "Schedule Algebras and their Use in Formulating General
                 Systems Smulations",
  institution =  "International Business Machines Corp.",
  year =         "1960",
  pages =        "39--58",
}

@Article{sep:Giffler:63,
  author =       "B. Giffler",
  title =        "Scheduling General Production Systems Using Schedule
                 Algebra",
  journal =      "Naval Research Logistics Quarterly",
  year =         "1963",
  volume =       "10",
  pages =        "237--255",
}

@Article{sep:Giffler:68,
  author =       "B. Giffler",
  title =        "Schedule Algebra: {A} Progress Report",
  journal =      "Naval Research Logistics Quarterly",
  year =         "1968",
  volume =       "15",
  pages =        "255--280",
}

@PhdThesis{sep:Giles:75,
  author =       "R. Giles",
  title =        "Submodular Functions, Graphs and Interger Polyhedra",
  school =       "Dep. of Combinatorics and Optimization",
  year =         "1975",
  address =      "Waterloo",
  pages =        "1.1--7.7",
}

@TechReport{sep:Giles:79,
  author =       "R. Giles",
  title =        "Adjacency on the Postman Polyhedron",
  institution =  "Rhein. Friedr.-Wilh.-Univ.",
  year =         "1979",
  number =       "79128-OR",
  address =      "Bonn",
  pages =        "7",
}

@Article{sep:Giles:82a,
  author =       "R. Giles",
  title =        "Optimum Matching Forests {I}: Special Weights",
  journal =      "Math. Programming",
  year =         "1982",
  volume =       "22",
  pages =        "1--11",
}

@Article{sep:Giles:82b,
  author =       "R. Giles",
  title =        "Optimum Matching Forests {II}: General Weights",
  journal =      "Math. Programming",
  year =         "1982",
  volume =       "22",
  pages =        "12--38",
}

@Article{sep:Giles:82c,
  author =       "R. Giles",
  title =        "Optimum Matching Forests {III}: Facets of Matching
                 Forest Polyhedra",
  journal =      "Math. Programming",
  year =         "1982",
  volume =       "22",
  pages =        "39--51",
}

@Article{sep:GilesHausmann:79,
  author =       "R. Giles and D. Hausmann",
  title =        "Characterizations of Adjacency on the Branching
                 Polyhedron",
  journal =      "Discrete Appl. Math.",
  year =         "1979",
  volume =       "26",
  pages =        "219--226",
}

@Article{sep:GilesPulleyblank:79,
  author =       "F. R. Giles and W. R. Pulleyblank",
  title =        "Totel Dual Integrality and Integer Polyhedra",
  journal =      LINAA2,
  year =         "1979",
  volume =       "25",
  pages =        "191--196",
}

@TechReport{sep:GillMarxenMurraySaundersWright:88,
  author =       "P. Gill and A. Marxen and W. Murray and M. Saunders
                 and M. Wright",
  title =        "Newton Barrier Methods for {LP}: Some Implementation
                 Aspects",
  institution =  "Stanford University, Dep. of OR",
  year =         "1988",
  address =      "Stanford",
  pages =        "15",
}

@Article{sep:GillMurraySaundersTomlinWright:86,
  author =       "P. E. Gill and W. Murray and M. A. Saunders and J. A.
                 Tomlin and M. H. Wright",
  title =        "On Projected Newton Barrier Methods for Linear
                 Programming and an Equivalence to Karmarkar's
                 Projective Method",
  year =         "1986",
  journal =      "Math. Programming",
  volume =       "36",
  pages =        "183--209",
}

@TechReport{sep:GillMurraySaundersWright:86,
  author =       "P. E. Gill and W. Murray and M. A. Saunders and M. H.
                 Wright",
  title =        "A Note on Nonlinear Approaches to Linear Programming",
  institution =  "Stanford University, Dep. of Oper. Research",
  year =         "1986",
  number =       "SOL 86-7",
  address =      "Stanford",
  pages =        "12",
}

@Article{sep:GillMurraySaundersWright:87,
  author =       "P. E. Gill and W. Murray and M. A. Saunders and M. H.
                 Wright",
  title =        "Maintaining {LU} factors of a general sparse matrix",
  year =         "1987",
  journal =      LINAA2,
  volume =       "88/89",
  pages =        "239--270",
}

@TechReport{sep:GillMurraySaundersWright:88,
  author =       "P. Gill and W. Murray and M. Saunders and M. Wright",
  title =        "Numerical Issues in Interior-Point Method",
  institution =  "Stanford University, Dep. of OR",
  year =         "1988",
  address =      "Stanford",
  pages =        "22",
}

@TechReport{sep:GiorgiMititelu:8,
  author =       "G. Giorgi and S. Mititelu",
  title =        "Extremum Conditions in Quasi-Convex Programming",
  institution =  "Universita di Pisa",
  year =         "198x",
  number =       "A-102",
  address =      "Pisa",
  pages =        "26",
}

@Proceedings{sep:GirlichDathe:79,
  editor =       "E. Girlich and H. Dathe",
  title =        "Zum sortimentsbeschr{\"a}nkten Problem der optimalen
                 Standardisierung",
  organisation = "Techn. Hochschule Ilmenau, 24. Intern.Wiss. Koll.",
  year =         "1979",
  journal =      "Wiss. Z. Tech. Hochsch. Ilmenau",
  address =      "Ilmenau",
  note =         "61 -- 63 p.",
}

@TechReport{sep:GirlichKovalev:93,
  author =       "E. Girlich and M. Kovalev",
  title =        "Classification of Polyhedral Matroids",
  institution =  "Institut f{\"u}r Mathematische Optimierung",
  year =         "1993",
  number =       "14/93",
  address =      "Otto-von-Guericke Universit{\"a}t Magdeburg",
}

@TechReport{sep:GirlichKowaljow:79,
  author =       "E. Girlich and M. M. Kowaljow",
  title =        "Polyederklassen maximaler Eckenanzahl",
  institution =  "Sektion Mathematik d.
                 Friedr.-Schiller-Universit{\"a}t",
  year =         "1979",
  number =       "N/79/14",
  address =      "Jena",
  pages =        "8",
}

@Article{sep:GirlichKowaljow:80a,
  author =       "E. Girlich and M. M. Kowaljow",
  title =        "Zur mathematischen Theorie der optimalen
                 Standardisierung",
  journal =      "Math. Operationsforsch. Statist. Ser. Optim.",
  year =         "1980",
  pages =        "547--561",
}

@Article{sep:GirlichKowaljow:80b,
  author =       "E. Girlich and M. M. Kowaljow",
  title =        "Eine Problemklasse der nichtlinearen diskreten
                 Optimierung.",
  journal =      "Wiss. Ztschr.Friedrich-Schiller-Univ. Jena,
                 Math.-Naturwiss. R.",
  year =         "1980",
  volume =       "29",
  pages =        "327--338",
}

@Proceedings{sep:GirlichKowaljow:90,
  editor =       "E. Girlich and M. M. Kowaljow",
  title =        "{M}{\"o}glichkeiten der Software-Familie Diskograd zur
                 {L}{\"o}sung von Optimierungsproblemen",
  organisation = "Techn. Hochschule Ilmenau, XV. International
                 Conference Eisenach",
  year =         "1990",
  address =      "Ilmenau",
  note =         "42 -- 44 p.",
}

@TechReport{sep:GirlichSchneidereitZaporoshetc:93,
  author =       "E. Girlich and Gabriele Schneidereit and Alexander
                 Zaporoshetc",
  title =        "Non-simple Polymatroids and Corresponding Submodular
                 Function",
  institution =  "Institut f{\"u}r Mathematische Optimierung",
  year =         "1993",
  number =       "20/93",
  address =      "Otto-von-Guericke Universit{\"a}t Magdeburg",
}

@Article{sep:Gleason:70,
  author =       "A. M. Gleason",
  title =        "Remarks on the van der Waerden Permanent Conjecture",
  journal =      "J. Combin. Theory Ser. A",
  year =         "1970",
  volume =       "8",
  pages =        "54--64",
}

@Article{sep:Glover:69,
  author =       "F. Glover",
  title =        "Integer Programming over a Finite Additive Group",
  journal =      "SIAM J. Control Optim.",
  year =         "1969",
  volume =       "7",
  pages =        "213--231",
}

@Article{sep:GloverKarneyKlingmanNapier:74,
  author =       "F. Glover and D. Karney and D. Klingman and A.
                 Napier",
  title =        "A Computation Study on Start Procedures, Basis Change
                 Criteria, and Solution Algorithms for Transportation
                 Problems",
  journal =      "Management Sci.",
  year =         "1974",
  volume =       "20",
  pages =        "793--813",
}

@TechReport{sep:GloverKlingmanPhillipsSchneider:8,
  author =       "F. Glover and D. D. Klingman and N. Phillips and R. F.
                 Schneider",
  title =        "New Polynomial Shortest Path Algorithms and their
                 Computational Attributes",
  institution =  "CBDA, University of Texas",
  year =         "198x",
  number =       "CBDA 103",
  address =      "Austin",
  pages =        "1--42",
}

@Article{sep:GloverKlingmanStutz:74,
  author =       "F. Glover and D. Klingman and J. Stutz",
  title =        "Augmented Threaded Index Method for Network
                 Optimization",
  journal =      "Infor",
  year =         "1974",
  volume =       "12",
  pages =        "293--298",
}

@Article{sep:Goepfert:78,
  author =       "A. G{\"o}pfert",
  title =        "Zur Anwendung der Dualit{\"a}tstheorie in allgemeinen
                 {R}{\"a}umen",
  journal =      "Wiss. Z. Tech. Hochsch. Leuna-Merseburg",
  year =         "1978",
  volume =       "20",
  pages =        "156--164",
}

@TechReport{sep:Goffin:87,
  author =       "J. L. Goffin",
  title =        "Affine and Projektive Transformations in
                 Nondifferentiable Optimization",
  institution =  "Universite Catholique de Louvain, Center of OR \&
                 Econometrics",
  year =         "1987",
  number =       "CORE 8744",
  address =      "Louvain-la-Neuve, Belgien",
  pages =        "24",
}

@TechReport{sep:GoffinHaurieVial:90,
  author =       "J.-L. Goffin and A. Haurie and J.-Ph. Vial",
  title =        "Decomposition and Nondifferentiable Optimization with
                 the Projective Algorithm",
  institution =  "McGill University, GERAD and Faculty of Management",
  year =         "1990",
  address =      "Montreal",
  pages =        "27",
}

@TechReport{sep:GoffinHaurieVialZhu:91,
  author =       "J.-L. Goffin and A. Haurie and J.-Ph. Vial and D. L.
                 Zhu",
  title =        "Using Central Prices in the Decomposition of Linear
                 Programs",
  institution =  "McGill University, GERAD and Faculty of Management",
  year =         "1991",
  address =      "Montreal",
  pages =        "28",
}

@Article{sep:GoffinVial:,
  author =       "J. L. Goffin and J. P. Vial",
  title =        "Cutting Planes and Column Generation Techniques with
                 the Projective Algorithm",
  journal =      "J. Optim. Theory Appl.",
  year =         "1990",
  volume =       "65",
  pages =        "409--427",
}

@TechReport{sep:GoffinVial:91,
  author =       "J. L. Goffin and J. P. Vial",
  title =        "Short Steps with Kamarkar's Projective Algorithm for
                 Linear Programming",
  institution =  "McGill University, GERAD and Faculty of Management",
  year =         "1991",
  address =      "Montreal",
  pages =        "21",
}

@Article{sep:GoldbergPlotkinTardos:91,
  author =       "A. V. Goldberg and S. A. Plotkin and E. Tardos",
  title =        "Combinatorial Algorithms for the Generalized
                 Circulation Problem",
  year =         "1991",
  journal =      "Math. Oper. Res.",
  volume =       "16",
  number =       "2",
  pages =        "351--381",
}

@Article{sep:GoldbergTarjan:88,
  author =       "A. V. Goldberg and R. E. Tarjan",
  title =        "A New Approach to the Maximum Flow Problem",
  year =         "1988",
  journal =      "J. Assoc. Comput. Mach.",
  volume =       "16",
  number =       "2",
  pages =        "321--340",
}

@Article{sep:GoldbergTarjan:89,
  author =       "A. V. Goldberg and R. E. Tarjan",
  title =        "Finding Minimum-Cost Circulations by Caceling Negative
                 Cicles",
  year =         "1989",
  journal =      "J. Assoc. Comput. Mach.",
  volume =       "36",
  number =       "4",
  pages =        "873--886",
}

@Article{sep:GoldbergTarjan:90,
  author =       "A. V. Goldberg and R. E. Tarjan",
  title =        "Finding Minimum-Cost Circulations by Successive
                 Approximation",
  journal =      "Math. Oper. Res.",
  year =         "1990",
  volume =       "15",
  pages =        "430--466",
}

@Article{sep:GoldenBodinDoyleStewart:80,
  author =       "B. Golden and L. Bodin and T. Doyle and W. Stewart
                 jr.",
  title =        "Approximate Traveling Salesman Algorithms",
  journal =      "Oper. Res.",
  year =         "1980",
  volume =       "28",
  pages =        "694--711",
}

@TechReport{sep:Goldfarb:77,
  author =       "D. Goldfarb",
  title =        "On the Bartels-Golub Decomposition for Linear
                 Programming Bases",
  institution =  "City College of New York",
  year =         "1977",
  address =      "New York, NJ",
  pages =        "272--279",
}

@Article{sep:Goldfarb:85,
  author =       "D. Goldfarb",
  title =        "Efficient Dual Simplex Algorithms for the Assignment
                 Problem",
  year =         "1985",
  journal =      "Math. Programming",
  volume =       "33",
  pages =        "187--203",
}

@Article{sep:Goldfarb:88,
  author =       "D. Goldfarb",
  title =        "Relaxed Variants of Karmarkar's Algorithm for Linear
                 Programs with Unknown Optimal Objective Value",
  journal =      "Math. Programming",
  year =         "1988",
  volume =       "40",
  pages =        "183--195",
}

@Article{sep:GoldfarbHao:87,
  author =       "D. Goldfarb and J. Hao",
  title =        "A Primal Simplex Algorithms that Solves the Maximum
                 Flow Problem in at Most nm Pivots and =(n2m) Time",
  year =         "1987",
  journal =      "Math. Programming",
  volume =       "47",
  number =       "3",
  pages =        "353--365",
}

@TechReport{sep:GoldfarbHao:88,
  author =       "D. Goldfarb and J. Hao",
  title =        "Polynomial-time Primal Simplex Algorithms for the
                 Minimum Cost Network Flow Problem",
  institution =  "Columbia University, Dep. of Industrial Engineering
                 and OR",
  year =         "1988",
  address =      "New York, NY",
  pages =        "21",
}

@TechReport{sep:GoldfarbHao:90,
  author =       "D. Goldfarb and J. Hao",
  title =        "On Strongly Polynomial Variants of the Network Simplex
                 Algorithm for the Maximum Flow Problem",
  institution =  "Columbia University, Dep. of Industrial Engineering
                 and OR",
  year =         "1990",
  address =      "New York, NY",
  pages =        "7",
}

@Article{sep:GoldfarbHaoKai:90,
  author =       "D. Goldfarb and J. Hao and S. R. Kai",
  title =        "Anti-Stalling Pivot Rules for the Network Simplex
                 Algorithm",
  journal =      "Networks",
  year =         "1990",
  volume =       "20",
  pages =        "79--91",
}

@Article{sep:GoldfarbHaoKai:91,
  author =       "D. Goldfarb and J. Hao and S. R. Kai",
  title =        "Shortest Path Algorithms using dynamic Breadth-First
                 Search",
  year =         "1991",
  journal =      "Networks",
  volume =       "21",
  number =       "1",
  pages =        "29--50",
}

@Article{sep:GoldfarbMehrotra:88,
  author =       "D. Goldfarb and S. Mehrotra",
  title =        "A relaxed version of Karmarkar's method",
  year =         "1988",
  journal =      "Math. Programming",
  volume =       "40",
  number =       "3",
  address =      "New York, NY",
  pages =        "289--315",
}

@Article{sep:GoldfarbReid:77,
  author =       "D. Goldfarb and J. K. Reid",
  title =        "A Practicable Steepest-Edge Simplex Algorithm",
  journal =      "Math. Programming",
  year =         "1977",
  volume =       "12",
  pages =        "361--371",
}

@TechReport{sep:GoldschmidtHochbaum:8,
  author =       "O. Goldschmidt and D. S. Hochbaum",
  title =        "Polynomial Algorithm for the k-Cut Problem",
  institution =  "University of California",
  year =         "198x",
  address =      "Berkeley, CA",
  pages =        "8",
}

@Article{sep:Gomory:65,
  author =       "R. E. Gomory",
  title =        "On the Relation between Integer and Noninteger
                 Solutions to Linear Programs",
  journal =      "Proc. Nat. Acad. Sci. U.S.A.",
  year =         "1965",
  volume =       "53",
  pages =        "260--265",
}

@Article{sep:Gomory:69,
  author =       "R. E. Gomory",
  title =        "Some Polyhedra Related to Combinatorial Problems",
  journal =      "Linear Algebra and Its Applications",
  year =         "1969",
  volume =       "2",
  pages =        "451--558",
}

@Article{sep:Gondran:73,
  author =       "M. Gondran",
  title =        "Matrices totalement unimodulaires",
  journal =      "E.D.F. - Bulletin de la Direction des Etudes et
                 Recherches S\'{e}rie C - Math\'{e}matiques,
                 Informatique",
  year =         "1973",
  volume =       "1",
  pages =        "55--74",
}

@Article{sep:Gondran:75a,
  author =       "M. Gondran",
  title =        "Algebre des Chemins et Algorithmes",
  journal =      "E.D.F. - Bulletin de la Direction des Etudes et
                 Recherches S\'{e}rie C -Math\'{e}matiques,
                 Informatique",
  year =         "1975",
  volume =       "2",
  pages =        "57--64",
}

@Article{sep:Gondran:75b,
  author =       "M. Gondran",
  title =        "Alg\`{e}bre Lineaire et Cheminement Dans un Graphe",
  journal =      "RAIRO Rech. Op{'e}r.",
  year =         "1975",
  volume =       "9",
  pages =        "77--99",
}

@Article{sep:Gondran:75d,
  author =       "M. Gondran",
  title =        "Algebre des Chemins et Algorithmes",
  journal =      "E.D.F. - Bulletin de la Direction des Etudes et
                 Recherches S\'{e}rie C -Math\'{e}matiques,
                 Informatique",
  year =         "1975",
  volume =       "2",
  pages =        "57--64",
}

@Article{sep:Gondran:75e,
  author =       "M. Gondran",
  title =        "{L}'algorithme glouton dans les alg\`{e}bres de
                 chemins",
  journal =      "E.D.F. - Bulletin de la Direction des Etudes et
                 Recherches S\'{e}rie C -Math\'{e}matiques,
                 Informatique",
  year =         "1975",
  volume =       "1",
  pages =        "25--32",
}

@InProceedings{sep:Gondran:75f,
  author =       "M. Gondran",
  title =        "Path Algebra and Algorithms",
  booktitle =    "Combinatorial Programming: Methods and Applications",
  year =         "1975",
  editor =       "B. Roy",
  pages =        "137--148",
  address =      "Dordrecht",
  publisher =    "Reidel",
}

@Article{sep:Gondran:76,
  author =       "M. Gondran",
  title =        "Le probl\`{e}me du plus court chemin dans un graphe",
  journal =      "E.D.F. - Bulletin de la Direction des Etudes et
                 Recherches S\'{e}rie C -Math\'{e}matiques,
                 Informatique",
  year =         "1976",
  volume =       "2",
  pages =        "5--33",
}

@InProceedings{sep:Gondran:77,
  author =       "M. Gondran",
  title =        "Eigenvalues and Eigenvectors in Hierarchical
                 Classification",
  booktitle =    "Recent Development in Statistics",
  year =         "1977",
  editor =       "J. R. Barra et al.",
  pages =        "775--781",
  address =      "Amsterdam",
  publisher =    "North Holland",
}

@Article{sep:Gondran:79,
  author =       "M. Gondran",
  title =        "Les Elements p-Reguliers dans les Dioides",
  journal =      "Discrete Math.",
  year =         "1979",
  volume =       "25",
  pages =        "33--39",
}

@TechReport{sep:Gondran:80,
  author =       "M. Gondran",
  title =        "The Dioid Theory and its Applications",
  institution =  "RDF - DER Service IMA",
  year =         "1980",
  address =      "Clamart",
  pages =        "10",
}

@TechReport{sep:GondranMinoux:7,
  author =       "M. Gondran and M. Minoux",
  title =        "Les alg\`{e}bres de chemins",
  institution =  "D\`{e}partement Traitement de L'Information et Etudes
                 Mathematiques",
  year =         "197x",
  address =      "Clamart",
  pages =        "65--101",
}

@Article{sep:GondranMinoux:77,
  author =       "M. Gondran and M. Minoux",
  title =        "Valeurs propres et vecteurs propres dans les dioides
                 et leur interpr\'{e}tation en th\`{e}ory des graphes",
  journal =      "E.D.F. - Bulletin de la Direction des Etudes et
                 Recherches S\'{e}rie C - Math\'{e}matiques,
                 Informatique",
  year =         "1977",
  volume =       "2",
  pages =        "25--41",
}

@Article{sep:GondranMinoux:78,
  author =       "M. Gondran and M. Minoux",
  title =        "{L}'ind\'{e}pendance lin\'{e}are dans les dioides",
  journal =      "E.D.F. - Bulletin de la Direction des Etudes et
                 Recherches S\'{e}rie C - Math\'{e}matiques,
                 Informatique",
  year =         "1978",
  volume =       "1",
  pages =        "67--90",
}

@TechReport{sep:Gonzaga:85,
  author =       "C. Gonzaga",
  title =        "A conical projection algorithm for linear
                 programming",
  institution =  "Univ. of California, Electronics Research Laboratory",
  year =         "1985",
  number =       "UCB/ERL M85/61",
  address =      "Berkeley",
  pages =        "14",
}

@TechReport{sep:Gonzaga:87,
  author =       "C. Gonzaga",
  title =        "Search directions for interior linear programming
                 methods",
  institution =  "University of California, Electronics Research
                 Laboratory, College of Engineering",
  year =         "1987",
  number =       "UCB/ERL M87/44",
  address =      "Berkeley",
  pages =        "31",
}

@TechReport{sep:Gonzaga:88a,
  author =       "C. C. Gonzaga",
  title =        "Polynomial Affine Algorithms for Linear Progamming",
  institution =  "COPPE-Fedral University",
  year =         "1988",
  number =       "ES-139/88",
  address =      "Rio de Janeiro/Brasil",
  pages =        "15",
}

@TechReport{sep:Gonzaga:88b,
  author =       "C. C. Gonzaga",
  title =        "A Simple Presentation of Karmarkar's Algorithm",
  institution =  "COPPE-Fedral University",
  year =         "1988",
  address =      "Rio de Janeiro/Brasil",
  pages =        "9",
}

@Article{sep:Gonzaga:89a,
  author =       "C. Gonzaga",
  title =        "Conical projection algorithms for linear programming",
  year =         "1989",
  journal =      "Math. Programming",
  volume =       "A 43",
  number =       "2",
  pages =        "151--173",
}

@InProceedings{sep:Gonzaga:89b,
  author =       "C. Gonzaga",
  title =        "An Algorithm for Solving linear programming problems
                 in {O}(n3 {L}) operations",
  year =         "1989",
  booktitle =    "Proc.Conf., Pacific Grove Kalif. 1987",
  pages =        "1--28",
}

@TechReport{sep:Gonzaga:89c,
  author =       "C. C. Gonzaga",
  title =        "Large-Steps Path-Following Methods for Linear
                 Programming: Potential Reduction Method",
  institution =  "University of Rio de Janeiro, Dept. of Systems
                 Engineering and Computer Sciences",
  year =         "1989",
  number =       "ES-211/89",
  address =      "Rio de Janeiro",
  pages =        "15",
}

@TechReport{sep:Gonzaga:89d,
  author =       "C. C. Gonzaga",
  title =        "Large-Steps Path-Following Methods for Linear
                 Programming: Barrier Function Method",
  institution =  "University of Rio de Janeiro, Dept. of Systems
                 Engineering and Computer Sciences",
  year =         "1989",
  number =       "ES-210/89",
  address =      "Rio de Janeiro",
  pages =        "13",
}

@TechReport{sep:Gonzaga:90,
  author =       "C. C. Gonzaga",
  title =        "On Lower Bound Updates in Primal Potential Reduction
                 Methods for Linear Programming",
  institution =  "University of Rio de Janeiro, Dept. of Systems
                 Engineering and Computer Sciences",
  year =         "1990",
  number =       "ES-227/90",
  address =      "Rio de Janeiro",
  pages =        "15",
}

@Article{sep:Gonzaga:91a,
  author =       "C. C. Gonzaga",
  title =        "Search Directions for Interior Linear Programming
                 Methods",
  journal =      "Algorithmica",
  year =         "1991",
  volume =       "6",
  number =       "2",
  pages =        "153--181",
}

@Article{sep:Gonzaga:91b,
  author =       "C. C. Gonzaga",
  title =        "Interior Point Algorithms for Linear Programming
                 Problems with Inequality Constraints",
  year =         "1991",
  journal =      "Math. Programming",
  volume =       "B",
  number =       "2",
  pages =        "209--225",
}

@TechReport{sep:GonzagaCarlos:90,
  author =       "C. C. Gonzaga and L. A. Carlos",
  title =        "A Primal Affine-Scaling Algorithm for Linearly
                 Constrained Convex Programs",
  institution =  "COPPE-Federal University",
  year =         "1990",
  number =       "ES-238/90",
  address =      "Rio de Janeiro/Brasil",
  pages =        "13",
}

@Article{sep:GonzalesSahni:78,
  author =       "T. Gonzales and S. Sahni",
  title =        "Preemptive Scheduling of Uniform Processor Systems",
  journal =      "J. Assoc. Comput. Mach.",
  year =         "1978",
  volume =       "25",
  pages =        "92--101",
}

@TechReport{sep:GrabnerPethooeTichyWoeginger:93,
  author =       "Peter J. Grabner and Attila Petho{\"o} and Robert F.
                 Tichy and Gerhard Woeginger",
  title =        "Associativity of Recurrence Multiplication",
  institution =  "Institut f{\"u}r Mathematik",
  year =         "1993",
  number =       "267",
  address =      "Technische Universit{\"a}t Graz",
}

@Article{sep:Grabowski:64,
  author =       "W. Grabowski",
  title =        "Problem of Tansportation in Minimum Time",
  journal =      "Bulletin de L'Academie Polnaise des Sciences,
                 S\'{e}rie des siences math., astr. et phys.",
  year =         "1964",
  volume =       "12",
  pages =        "107--108",
}

@Article{sep:Grabowski:76,
  author =       "W. Grabowski",
  title =        "Lexicographic and Time Minimization in the
                 Transportation Problem",
  journal =      "Zastosowania Matematyki Applicationes Mathematicae",
  year =         "1976",
  volume =       "15",
  pages =        "191--213",
}

@InProceedings{sep:Grabowski:82,
  author =       "J. Grabowski",
  title =        "A new Algorithm of Solving the Flow - Shop Problem",
  booktitle =    "Operations Research in Progress",
  year =         "1982",
  editor =       "G. Feichtinger and P. Kall",
  pages =        "57--76",
  address =      "Dordrecht",
  publisher =    "Reidel",
}

@TechReport{sep:Granot:78,
  author =       "F. Granot",
  title =        "Efficient Heuristic Algorithms for Positive 0-1
                 Polynomial Programming Problems",
  institution =  "Stanford University",
  year =         "1978",
  number =       "SOL 78-20",
  address =      "Stanford",
  pages =        "24",
}

@Article{sep:GranotGranot:80,
  author =       "D. Granot and F. Granot",
  title =        "Generalized Covering Relaxation for 0-1 Programs",
  journal =      "Oper. Res.",
  year =         "1980",
  volume =       "28",
  pages =        "1442--1449",
}

@Article{sep:GreenbergPierskalla:71,
  author =       "H. J. Greenberg and W. P. Pierskalla",
  title =        "A Review of Quasi-Convex Functions",
  journal =      "Oper. Res.",
  year =         "1971",
  pages =        "1553--1570",
}

@TechReport{sep:GribikHuangKortanek:87,
  author =       "P. R. Gribik and S. Huang and K. O. Kortanek",
  title =        "First and Second Order Convex Programming Scaling
                 Algorithms Applied to Geometric Programming",
  institution =  "The University of Iowa, College of Business
                 Administration",
  year =         "1987",
  number =       "87-6",
  address =      "Iowa-City",
  pages =        "24",
}

@TechReport{sep:Grigoriadis:78,
  author =       "M. D. Grigoriadis",
  title =        "Algorithms for the Minimum Cost Single and
                 Multicommodity Network Flow Problems",
  institution =  "Summer School in Combinatorial Optimization",
  year =         "1978",
  pages =        "72",
}

@TechReport{sep:GrigoriadisKhachiyan:91a,
  author =       "M. D. Grigoriadis and L. G. Khachiyan",
  title =        "Fast Approximation Schemes for Convex Programs with
                 many Blocks and Coupling Constriants",
  institution =  "Rutgers University, Department of Computer Science",
  year =         "1991",
  number =       "DCS-TR-273",
  address =      "New Brunswick, NJ",
  pages =        "30",
}

@TechReport{sep:GrigoriadisKhachiyan:91b,
  author =       "M. D. Grigoriadis and L. G. Khachiyan",
  title =        "Approximate Solution of Matrix Grmaes in Parallel",
  institution =  "Rutgers University, Department of Computer Science",
  year =         "1991",
  number =       "DCS-TR-281",
  address =      "New Brunswick, NJ",
  pages =        "10",
}

@Article{sep:Grinold:70,
  author =       "R. C. Grinold",
  title =        "Lagrangian Subgradients",
  journal =      "Management Sci.",
  year =         "1970",
  volume =       "17",
  pages =        "185--188",
}

@Article{sep:Gritzmann:83,
  author =       "P. Gritzmann",
  title =        "The Toroidal Analogue to Eberhard's Theorem",
  journal =      "Mathematika",
  year =         "1983",
  volume =       "30",
  pages =        "274--290",
}

@TechReport{sep:Gritzmann:85,
  author =       "P. Gritzmann",
  title =        "Lattice Covering of Space with Symmetric Convex
                 Bodies",
  institution =  "Universit{\"a}t Siegen, Math. Institut",
  year =         "1985",
  address =      "Siegen",
  pages =        "311--315",
}

@Article{sep:Gritzmann:86,
  author =       "P. Gritzmann",
  title =        "Finite Packing of Equal Balls",
  journal =      "J. London Math. Soc. (2)",
  year =         "1986",
  volume =       "33",
  pages =        "543--553",
}

@Article{sep:Gritzmann:87,
  author =       "P. Gritzmann",
  title =        "A new isoperimetric inequality",
  journal =      "J. Reine Angew. Math.",
  year =         "1987",
  volume =       "379",
  pages =        "22--30",
}

@Article{sep:GroeflinHoffmann:82,
  author =       "H. Gr{\"o}flin and A. J. Hoffmann",
  title =        "Lattice Polyhedra {II}: Generalization, Constructions
                 and Examples",
  journal =      "Annals of Discrete Mathematics",
  year =         "1982",
  volume =       "15",
  pages =        "189--203",
}

@Article{sep:Groetschel:79,
  author =       "M. Gr{\"o}tschel",
  title =        "On Minimal Strong Blocks",
  journal =      "J. Graph Theory",
  year =         "1979",
  volume =       "3",
  pages =        "213--219",
}

@Article{sep:Groetschel:80a,
  author =       "M. Gr{\"o}tschel",
  title =        "On the Symmetric Travelling Salesman Problem: Solution
                 of a 120-City Problem",
  journal =      "Math. Programming Stud.",
  year =         "1980",
  volume =       "12",
  pages =        "61--77",
}

@Article{sep:Groetschel:80b,
  author =       "M. Gr{\"o}tschel",
  title =        "On the Monotone Symmetric Travelling Salesman Problem:
                 Hypohamiltonian/Hypotraceable Graphs and Facets",
  journal =      "Math. Oper. Res.",
  year =         "1980",
  volume =       "5",
  pages =        "285--292",
}

@TechReport{sep:Groetschel:81,
  author =       "M. Gr{\"o}tschel",
  title =        "Approaches to Hard Combinatorial Optimization
                 Problems",
  institution =  "Universit{\"a}t Bonn",
  year =         "1981",
  number =       "791147-OR",
  address =      "Bonn",
  pages =        "89",
}

@TechReport{sep:Groetschel:84,
  author =       "M. Gr{\"o}tschel",
  title =        "Combinatorial Optimization",
  institution =  "Universit{\"a}t Augsburg",
  year =         "1984",
  number =       "26",
  address =      "Augsburg",
  pages =        "54",
}

@TechReport{sep:Groetschel:92,
  author =       "M. Gr{\"o}tschel",
  title =        "Discrete Mathematics in Manufacturing",
  institution =  "Konrad-Zuse-Zentrum f{\"u}r Informationstechnik",
  year =         "1992",
  number =       "SC 92--3",
  address =      "Berlin",
}

@Article{sep:GroetschelHarary:79,
  author =       "M. Gr{\"o}tschel and F. Harary",
  title =        "The graphs for which all strong orientations are
                 Hamiltonian",
  journal =      "J. Graph Theory",
  year =         "1979",
  volume =       "3",
  pages =        "221--223",
}

@Article{sep:GroetschelHolland:87,
  author =       "M. Gr{\"o}tschel and O. Holland",
  title =        "A Cutting Plane Algorithm for Minimum Perfect
                 2-Matchings",
  year =         "1987",
  journal =      "Computing",
  volume =       "39",
  pages =        "327--344",
}

@TechReport{sep:GroetschelHolland:88,
  author =       "M. Gr{\"o}tschel and O. Holland",
  title =        "Solution of Large-Scale Symmetric Travelling Salesman
                 Problems",
  institution =  "Universit{\"a}t Augsburg, Inst.f. Mathem.",
  year =         "1988",
  number =       "73",
  address =      "Augsburg",
  pages =        "68",
}

@Article{sep:GroetschelHolland:91,
  author =       "M. Gr{\"o}tschel and O. Holland",
  title =        "Solution of Large-Scale Symmetric Travelling Salesman
                 Problems",
  journal =      "Math. Programming",
  year =         "1991",
  volume =       "A51",
  number =       "2",
  pages =        "141--202",
}

@TechReport{sep:GroetschelJuengerReinelt:82,
  author =       "M. Gr{\"o}tschel and M. J{\"u}nger and G. Reinelt",
  title =        "Optimal Triangulation of Large Real World Input-Output
                 Matrices",
  institution =  "Universit{\"a}t Bonn",
  year =         "1982",
  number =       "82228-OR",
  address =      "Bonn",
  pages =        "37",
}

@Article{sep:GroetschelJuengerReinelt:85,
  author =       "M. Gr{\"o}tschel and M. J{\"u}nger and G. Reinelt",
  title =        "Facets of the Linear Ordering Polytope",
  year =         "1985",
  journal =      "Math. Programming",
  volume =       "33",
  pages =        "43--60",
}

@Article{sep:GroetschelJuengerReinelt:91,
  author =       "M. Gr{\"o}tschel and M. J{\"u}nger and G. Reinelt",
  title =        "Optimal Control of Plotting and Drilling Machines: {A}
                 Case Study",
  year =         "1991",
  journal =      "Z. Oper. Res. Ser. A-B",
  volume =       "35",
  number =       "1",
  pages =        "61--84",
}

@Article{sep:GroetschelLovaszSchrijver:81,
  author =       "M. Gr{\"o}tschel and L. Lov\`{a}sz and A. Schrijver",
  title =        "The Ellipsoid method and its Consequences in
                 Combinatorial Optimization",
  journal =      "Combinatorica",
  year =         "1981",
  volume =       "1",
  pages =        "169--197",
}

@Article{sep:GroetschelLovaszSchrijver:84a,
  author =       "M. Gr{\"o}tschel and L. Lov\`{a}sz and A. Schrijver",
  title =        "Polynomial Algorithms for Perfect Graphs",
  year =         "1984",
  journal =      "Ann. Disc. Math.",
  volume =       "21",
  pages =        "325--356",
}

@Article{sep:GroetschelLovaszSchrijver:84b,
  author =       "M. Gr{\"o}tschel and L. Lov\`{a}sz and A. Schrijver",
  title =        "Corrigendium to our Paper {"}The Ellipsoid Method and
                 its Consequences in Combinatorial Optimization{"}",
  year =         "1984",
  journal =      "Combinatorica",
  volume =       "4",
  pages =        "291--295",
}

@TechReport{sep:GroetschelMartinWeismantel:92a,
  author =       "M. Gr{\"o}tschel and A. Martin and R. Weismantel",
  title =        "Packing Steiner Trees: Polyhedral Investigations",
  institution =  "Konrad-Zuse-Zentrum f{\"u}r Informationstechnik",
  year =         "1992",
  number =       "SC 92-8",
  address =      "Berlin",
  pages =        "29",
}

@TechReport{sep:GroetschelMartinWeismantel:92b,
  author =       "M. Gr{\"o}tschel and A. Martin and R. Weismantel",
  title =        "Packing Steiner Trees: {A} Cutting Plane Algorithm and
                 Computational Results",
  institution =  "Konrad-Zuse-Zentrum f{\"u}r Informationstechnik",
  year =         "1992",
  number =       "SC 92-9",
  address =      "Berlin",
  pages =        "33",
}

@Article{sep:GroetschelMonma:90,
  author =       "M. Gr{\"o}tschel and C. L. Monma",
  title =        "Integer Polyhedra Arising from Certain Network Design
                 Problems with Connectivity Constraints",
  year =         "1990",
  journal =      "SIAM J. Disc. Math.",
  volume =       "3",
  number =       "4",
  pages =        "502--523",
}

@TechReport{sep:GroetschelMonmaStoer:89a,
  author =       "M. Gr{\"o}tschel and C. L. Monma and M. Stoer",
  title =        "Facets for Polyhedra Arising in the Design on
                 Communication Networks with Low-Connectivity
                 Constraints",
  institution =  "Universit{\"a}t Augsburg, Inst. f. Mathematik",
  year =         "1989",
  number =       "187",
  address =      "Augsburg",
  pages =        "34",
}

@TechReport{sep:GroetschelMonmaStoer:89b,
  author =       "M. Gr{\"o}tschel and C. L. Monma and M. Stoer",
  title =        "Computational Results with a Cutting Plane Algorithm
                 for Designing Communication Networks with
                 Low-Connectivity Constraints",
  institution =  "Universit{\"a}t Augsburg, Inst. f. Mathematik",
  year =         "1989",
  number =       "188",
  address =      "Augsburg",
  pages =        "34",
}

@TechReport{sep:GroetschelMonmaStoer:90,
  author =       "M. Gr{\"o}tschel and C. Monma and M. Stoer",
  title =        "Polyhedral Approaches to Network Survivability",
  institution =  "Universit{\"a}t Augsburg, Inst. f. Mathematik",
  year =         "1990",
  number =       "189",
  address =      "Augsburg",
  pages =        "20",
}

@TechReport{sep:GroetschelPadberg:74,
  author =       "M. Gr{\"o}tschel and M. Padberg",
  title =        "Linear Characterizations of the Asymmetric Travelling
                 Salesman Polytope",
  institution =  "Universit{\"a}t Bonn",
  year =         "1974",
  number =       "7417-OR",
  address =      "Bonn",
  pages =        "6",
}

@Article{sep:GroetschelPadberg:79,
  author =       "M. Gr{\"o}tschel and M. W. Padberg",
  title =        "On the Symmetric Travelling Salesman Problem {II}:
                 {LIFTING} {"Theoria"EMS} {AND} {FACETS}",
  journal =      "Math. Programming",
  year =         "1979",
  volume =       "16",
  pages =        "281--302",
}

@TechReport{sep:GroetschelPadberg:83a,
  author =       "M. Gr{\"o}tschel and M. Padberg",
  title =        "Polyhedral Aspects of the Travelling Salesman Problem
                 {II} : Computation",
  institution =  "Universit{\"a}t Bonn",
  year =         "1983",
  number =       "82214-OR",
  address =      "Bonn",
  pages =        "78",
}

@TechReport{sep:GroetschelPadberg:83b,
  author =       "M. Gr{\"o}tschel and M. Padberg",
  title =        "Polyhedral Aspects of the Travelling Salesman Problem
                 {I} : Theory",
  institution =  "Universit{\"a}t Bonn",
  year =         "1983",
  number =       "82212-OR",
  address =      "Bonn",
  pages =        "75",
}

@TechReport{sep:GroetschelPadberg:84,
  author =       "M. Gr{\"o}tschel and M. Padberg",
  title =        "Polyhedral Aspects of the Travelling Salesman Problem
                 {II}: Computation",
  institution =  "Universita' di Pisa, Dipartimento di Matematica",
  year =         "1984",
  address =      "Pisa",
  pages =        "93",
}

@Article{sep:GroetschelPulleyblank:81,
  author =       "M. Gr{\"o}tschel and W. R. Pulleyblank",
  title =        "Weakly Bipartite Graphs and the Max-Cut Problem",
  journal =      "Oper. Res. Lett.",
  year =         "1981",
  volume =       "1",
  pages =        "23--27",
}

@Article{sep:GroetschelPulleyblank:86,
  author =       "M. Gr{\"o}tschel and W. R. Pulleyblank",
  title =        "Clique Tree Inequalities and the Symmetric Travelling
                 Salesman Problem",
  year =         "1986",
  journal =      "Math. Oper. Res.",
  volume =       "11",
  pages =        "537--569",
}

@Article{sep:GroetschelThomassenWakabayashi:80,
  author =       "M. Gr{\"o}tschel and C. Thomassen and Y. Wakabayashi",
  title =        "Hypotraceable Digraphs",
  journal =      "J. Graph Theory",
  year =         "1980",
  volume =       "4",
  pages =        "377--381",
}

@Article{sep:GroetschelWakabayashi:81a,
  author =       "M. Gr{\"o}tschel and Y. Wakabayashi",
  title =        "On the Structure of the Monotone Asymmetric Travelling
                 Salesman Polytope {II} : Hypotraceable Facets",
  journal =      "Math. Programming Stud.",
  year =         "1981",
  volume =       "14",
  pages =        "77--97",
}

@Article{sep:GroetschelWakabayashi:81b,
  author =       "M. Gr{\"o}tschel and Y. Wakabayashi",
  title =        "On the Structure of the Monotone Asymmetric Travelling
                 Salesman Polytope {I} : Hypohamiltonian Facets",
  journal =      "Discrete Math.",
  year =         "1981",
  volume =       "34",
  pages =        "43--59",
}

@TechReport{sep:GroetschelWakabayashi:87,
  author =       "M. Gr{\"o}tschel and Y. Wakabayashi",
  title =        "Composition of Facets of the Clique Partitioning
                 Polytope",
  institution =  "Universit{\"a}t Augsburg, Institut f{\"u}r
                 Mathematik",
  year =         "1987",
  number =       "18",
  address =      "Augsburg",
  pages =        "14",
}

@Article{sep:GroetschelWakabayashi:89,
  author =       "M. Gr{\"o}tschel and Y. Wakabayashi",
  title =        "A Cutting Plane Algorithm for a Clustering Problem",
  year =         "1989",
  journal =      "Math. Programming",
  volume =       "B45",
  number =       "1",
  pages =        "56--96",
}

@Article{sep:GroetschelWakabayashi:90,
  author =       "M. Gr{\"o}tschel and Y. Wakabayashi",
  title =        "Facets of the Clique Partitioning Polytope",
  year =         "1990",
  journal =      "Math. Programming",
  volume =       "A47",
  number =       "3",
  address =      "Augsburg",
  pages =        "367--387",
}

@InProceedings{sep:GroetschelWakabayshi:80,
  author =       "M. Gr{\"o}tschel and Y. Wakabayshi",
  title =        "Hypohamiltonian Digraphs",
  booktitle =    "Methods of Operations Research, 36",
  year =         "1980",
  editor =       "R. Henn and H. P. Kuenzi and H. Schubert",
  pages =        "99--120",
  address =      "Koenigstein",
  publisher =    "Anton Hain Meisenheim",
}

@Article{sep:Gronau:79,
  author =       "B.-D. O. F. Gronau",
  title =        "Recognition of monotone functions",
  journal =      "Acta Cybernet.",
  year =         "1979",
  volume =       "4",
  pages =        "279--281",
}

@Article{sep:Gronau:81,
  author =       "H.-D. O. F. Gronau",
  title =        "Sperner type theorems and complexity of minimal
                 disjunctive normal forms of monotone boolean
                 functions",
  journal =      "Period. Math. Hungar.",
  year =         "1981",
  volume =       "12",
  pages =        "267--282",
}

@Article{sep:Gronau:83a,
  author =       "H.-D. O. F. Gronau",
  title =        "More on the Erd{\"o}s-Ko-Rado Theorem for Integer
                 Sequences",
  journal =      "J. Combin. Theory Ser. A",
  year =         "1983",
  volume =       "35",
  pages =        "279--288",
}

@Article{sep:Gronau:83b,
  author =       "H.-D. O. F. Gronau",
  title =        "Maximum nontrivial k-uniform set families in which no
                 {æ} sets have an empty Intersection",
  journal =      "Elektron. Informationsverarb. Kybernet.",
  year =         "1983",
  volume =       "19",
  pages =        "357--364",
}

@TechReport{sep:GronauPrestin:82,
  author =       "H.-D. O. F. Gronau and J. Prestin",
  title =        "Some Results on Designs with repeated blocks",
  institution =  "?",
  year =         "1982",
  type =         "Math. Kollg.",
  number =       "21",
  address =      "Rostock",
  pages =        "15--38",
}

@Article{sep:GronauRentner:85,
  author =       "H.-D. O. F. Gronau and I. Rentner",
  title =        "On the decomposition of th set of all k-element
                 subsets of a v-element set into indecomposable t-(v,k,
                 ) designs",
  year =         "1985",
  journal =      "Rostock. Math. Kolloq.",
  volume =       "28",
  pages =        "49--54",
}

@Article{sep:Groppen:77,
  author =       "V. O. Groppen",
  title =        "Extremal Problems on Graphs with Minimax Goal
                 Function",
  journal =      "Avtomat. i Telemekh.",
  year =         "1977",
  volume =       "6",
  pages =        "97--102",
}

@TechReport{sep:Gross:59,
  author =       "O. Gross",
  title =        "The Bottleneck Assignment Problem",
  institution =  "RAND-Syposium on Mathematical Programming",
  year =         "1959",
  number =       "P-1630",
  address =      "Santa Monica",
  pages =        "8",
}

@Article{sep:Grygiel:81,
  author =       "G. Grygiel",
  title =        "Algebraic k-assignment Problems",
  journal =      "Control Cybernet.",
  year =         "1981",
  volume =       "10",
  pages =        "155--165",
}

@MastersThesis{sep:Gschrei:78,
  author =       "U. Gschrei",
  title =        "Erzeugung von Zufallsgraphen",
  school =       "M{\"u}nchen",
  year =         "1978",
  address =      "M{\"u}nchen",
  pages =        "65",
}

@Article{sep:Guddat:8,
  author =       "J. Guddat",
  title =        "On Qualitative Stability in the Non-Linear Parametric
                 Programming and Some Applications",
  journal =      "Math. Programming Stud.",
  year =         "198x",
}

@Article{sep:GuddatWndler:81,
  author =       "J. Guddat and K. Wendler",
  title =        "{\"U}ber die {L}{\"o}sung von
                 Vektoroptimierungsproblemen mit Hilfe der
                 parametrischen Optimierung",
  journal =      "Wiss. Z. Humboldt-Univ. Berlin Math.-Natur. Reihe",
  year =         "1981",
  volume =       "5",
  pages =        "405--410",
}

@TechReport{sep:GuelerDenHertagRoosTerlakyTsuchiya:92,
  author =       "O. G{\"u}ler and D. den Hertog and C. Roos and T.
                 Terlaky and T. Tsuchiya",
  title =        "Degeneracy in Interior Point Methods for Linear
                 Programming",
  institution =  "Delft University of Technology",
  year =         "1992",
  number =       "91-102",
  address =      "Delft",
  pages =        "27",
}

@TechReport{sep:GuelerRoopsTerlakyVial:92,
  author =       "O. G{\"u}ler and C. Roos and T. Terlaky and J.-Ph.
                 Vial",
  title =        "Interior Point Approach to the Theory of Linear
                 Programming",
  institution =  "Delft University of Technology",
  year =         "1992",
  address =      "Delft",
  pages =        "18",
}

@Article{sep:GuptaArora:77,
  author =       "R. Gupta and S. R. Arora",
  title =        "Programming Problems with Maximin Objective Function",
  journal =      "Opsearch",
  year =         "1977",
  volume =       "14",
  pages =        "125--130",
}

@Article{sep:GuptaArora:78,
  author =       "R. Gupta and S. R. Arora",
  title =        "Programming Problems with Maximin Objective Function",
  journal =      "Z. Oper. Res. Ser. A-B",
  year =         "1978",
  volume =       "22",
  pages =        "69--72",
}

@Article{sep:GuptaPunnen:90,
  author =       "S. K. Gupta and P. Punnen",
  title =        "k-Sum Optimization Problems",
  journal =      "Oper. Res. Lett.",
  year =         "1990",
  volume =       "9",
  pages =        "121--126",
}

@Article{sep:Gusfield:84,
  author =       "D. Gusfield",
  title =        "Bounds for Naive Multiple Machine Scheduling with
                 Release Times and Deadlines",
  journal =      "J. Algorithms",
  year =         "1984",
  volume =       "5",
  pages =        "1--6",
}

@Article{sep:Gusfield:89,
  author =       "D. Gusfield",
  title =        "Efficient Solution of the Matroid Product Problem",
  journal =      "Oper. Res. Lett.",
  year =         "1989",
  volume =       "8",
  pages =        "257--259",
}

@Article{sep:Gusfield:91,
  author =       "D. Gusfield",
  title =        "Computing the Strength of a Graph",
  year =         "1991",
  journal =      "SIAM J. Comput.",
  volume =       "20",
  number =       "4",
  pages =        "639--654",
}

@Article{sep:GusfieldIrving:89,
  author =       "D. Gusfield and R. W. Irving",
  title =        "Parametric Stable Marriage and Minimum Cuts",
  journal =      "Inform. Process. Lett.",
  year =         "1989",
  volume =       "30",
  pages =        "255--259",
}

@Article{sep:GusfieldMartel:92,
  author =       "D. Gusfield and C. Martel",
  title =        "A Fast Algorithm for the Generalized Parametric
                 Minimum Cut Problem and Applications",
  journal =      "Algorithmica",
  year =         "1992",
  volume =       "7",
  pages =        "499--519",
}

@Article{sep:GusfieldNaor:89,
  author =       "Dan Gusfield and Dalit Naor",
  title =        "Extracting Maximal Information about Sets of Minimum
                 Cuts",
  journal =      "Algorithmica",
  volume =       "10",
  pages =        "64--89",
  year =         "1989",
}

@Article{sep:GusfieldNaor:91,
  author =       "D. Gusfield and D. Naor",
  title =        "Efficient Algorithms for Generalized Cut-Trees",
  journal =      "Networks",
  volume =       "21",
  pages =        "505--520",
  year =         "1991",
}

@TechReport{sep:Gwinner:75,
  author =       "J. Gwinner",
  title =        "Dualit{\"a}tstheorie f{\"u}r eine Klasse von
                 allgemeinen Programmen",
  institution =  "Universit{\"a}t Mannheim, Lehrstuhl f{\"u}r Mathematik
                 VII",
  year =         "1975",
  address =      "Mannheim",
  pages =        "35--50",
}

@Article{sep:HabibMoehring:87,
  author =       "M. Habib and R. H. M{\"o}hring",
  title =        "On some complexity properties of {N}-free posets and
                 posets with bounded decomposition diameter",
  year =         "1987",
  journal =      "Discrete Math.",
  volume =       "63",
  pages =        "157--182",
}

@TechReport{sep:Hackstein:73,
  author =       "R. Hackstein",
  title =        "Qualitative Personalplanung im Hinblick auf Ergonomie
                 und Anpassung",
  institution =  "Kommission der Europ. Gemeinschaften, Rhein.-Westf.
                 TH",
  year =         "1973",
  number =       "6224222-23/1/008",
  address =      "Aachen",
  pages =        "148",
}

@TechReport{sep:HadleyRendlWolkowicz:89a,
  author =       "S. Hadley and F. Rendl and H. Wolkowicz",
  title =        "Symmetrization of Nonsymmetric Quadratic Assignment
                 Problems and the Hoffmann-Wielandt Inequality",
  institution =  "Techn. Univ. Graz, Inst. f. Mathematik",
  year =         "1989",
  number =       "143",
  address =      "Graz",
  pages =        "12",
}

@TechReport{sep:HadleyRendlWolkowicz:89b,
  author =       "S. W. Hadley and F. Rendl and H. Wolkowicz",
  title =        "A new lower Bound via Elimination for the Quadratic
                 Assignment Problem",
  institution =  "University of Waterloo, Dep. of Combinatorics and
                 Optimization",
  year =         "1989",
  address =      "Waterloo",
  pages =        "14",
  note =         "to appear in Mathematics on OR",
}

@TechReport{sep:HagauerRote:93,
  author =       "Johann Hagauer and G{\"u}nter Rote",
  title =        "Three-clustering of points in the plane",
  institution =  "Institut f{\"u}r Mathematik",
  year =         "1993",
  number =       "259",
  address =      "Technische Universit{\"a}t Graz",
}

@TechReport{sep:HagauerWoegingerKlavzar:92,
  author =       "J. Hagauer and Woeginger Klavzar S.",
  title =        "Every n-dimensional Grid is Cordia",
  institution =  "Techn. Universit{\"a}t Graz, Inst. f. Mathematik.",
  year =         "1992",
  number =       "248",
  address =      "Graz",
  pages =        "11",
}

@Article{sep:Hahn:07,
  author =       "H. Hahn",
  title =        "{\"U}ber die nichtarchimedischen
                 Gr{\"o}\ss{}ensysteme",
  journal =      "Sitzungsberichte der Akademie der Wissenschaften
                 Wien",
  year =         "1907",
  volume =       "IIa",
  number =       "116",
  pages =        "601--655",
}

@TechReport{sep:Hahn:73a,
  author =       "W. Hahn",
  title =        "{\"U}ber ein Auswahlproblem in der
                 Farbrezepturberechnung",
  institution =  "Universit{\"a}t Karlsruhe",
  year =         "1973",
  number =       "20",
  address =      "Karlsruhe",
  pages =        "8",
}

@Article{sep:Hahn:73b,
  author =       "W. Hahn",
  title =        "Rundungsfehler beim {"} All-integer Integer
                 Programming Algorithm {"} von Gomory",
  journal =      "Computing",
  year =         "1973",
  volume =       "11",
  pages =        "249--254",
}

@InProceedings{sep:Hahn:74,
  author =       "W. Hahn",
  title =        "Optimierungsaufgaben mit multiplikativ verkn{\"u}pften
                 bin{\"a}ren Variablen",
  booktitle =    "Operations Research-Verfahren XVIII",
  year =         "1974",
  editor =       "R. Henn et al.",
  pages =        "121--128",
  address =      "Meisenheim",
  publisher =    "A. Hain",
}

@Article{sep:Haley:62,
  author =       "K. B. Haley",
  title =        "The Solid Transportation Problem",
  journal =      "Oper. Res.",
  year =         "1962",
  volume =       "10",
  pages =        "448--463",
}

@Article{sep:Haley:63,
  author =       "K. B. Haley",
  title =        "The Multi-Index Problem",
  journal =      "Oper. Res.",
  year =         "1963",
  volume =       "11",
  pages =        "368--379",
}

@Article{sep:HallVohra:93,
  author =       "N. G. Hall and R. V. Vohra",
  title =        "Towards Equitable Distribution via Proportional Equity
                 Constraints",
  journal =      "Math. Programming",
  year =         "1993",
  volume =       "58",
  pages =        "287--294",
}

@Article{sep:Hamacher:79,
  author =       "H. Hamacher",
  title =        "Numerical Investigations on the Maximal Flow
                 Algorithms of Karzanov",
  journal =      "Computing",
  year =         "1979",
  volume =       "22",
  pages =        "17--29",
}

@TechReport{sep:Hamacher:8,
  author =       "H. Hamacher",
  title =        "A Lexicographic Flow Model for Priority Evacuations of
                 Buildings",
  institution =  "University of Floriada",
  year =         "198x",
  address =      "Gainesville",
  pages =        "15",
}

@Article{sep:Hamacher:80a,
  author =       "H. Hamacher",
  title =        "Algebraic Flows in Regular Matroids",
  journal =      "Discrete Appl. Math.",
  year =         "1980",
  volume =       "2",
  pages =        "27--38",
}

@TechReport{sep:Hamacher:80b,
  author =       "H. Hamacher",
  title =        "Optimal Cuts",
  institution =  "Universit{\"a}t K{\"o}ln",
  year =         "1980",
  number =       "80-8",
  address =      "K{\"o}ln",
  pages =        "17",
}

@PhdThesis{sep:Hamacher:80c,
  author =       "H. Hamacher",
  title =        "Algebraische Flussprobleme in Regul{\"a}ren
                 Matroiden",
  school =       "Universit{\"a}t K{\"o}ln",
  year =         "1980",
  address =      "K{\"o}ln",
  pages =        "128",
}

@InProceedings{sep:Hamacher:80d,
  author =       "H. Hamacher",
  title =        "Maximal Algebraic Flows: Algorithms and Examples",
  booktitle =    "Discrete Structures and Algorithms",
  year =         "1980",
  editor =       "U. Pape",
  pages =        "253--166",
  address =      "M{\"u}nchen",
  publisher =    "Hanser",
}

@TechReport{sep:Hamacher:80e,
  author =       "H. Hamacher",
  title =        "On a Class of Easily Solvable Optimal Cocircuit
                 Problems in Regular Matroids",
  institution =  "Universit{\"a}t K{\"o}ln",
  year =         "1980",
  number =       "80-15",
  address =      "K{\"o}ln",
  pages =        "22",
}

@Article{sep:Hamacher:82a,
  author =       "H. Hamacher",
  title =        "Optimal cocircuits in regular matroids and
                 applications",
  journal =      "J. Comput. Appl. Math.",
  year =         "1982",
  volume =       "8",
  pages =        "171--177",
}

@Article{sep:Hamacher:82b,
  author =       "H. Hamacher",
  title =        "Decomposition of Group Flows in Regular Matroids",
  journal =      "Computing",
  year =         "1982",
  volume =       "29",
  pages =        "113--133",
}

@Article{sep:Hamacher:82c,
  author =       "H. Hamacher",
  title =        "Determining Minimal Cuts with a Minimal Number of
                 Arcs",
  journal =      "Networks",
  year =         "1982",
  volume =       "12",
  pages =        "493--504",
}

@TechReport{sep:Hamacher:83,
  author =       "H. Hamacher",
  title =        "Min Cost and Time Minimizing Dynamic Flows",
  institution =  "University of Florida",
  year =         "1983",
  number =       "83-16",
  address =      "Gainesville",
  pages =        "25",
}

@Article{sep:Hamacher:85,
  author =       "H. Hamacher",
  title =        "A Time Expanded Matroid Algorithm for Finding Optimal
                 Dynamic Matroid Intersections",
  year =         "1985",
  journal =      "Z. Oper. Res. Ser. A-B",
  volume =       "A29",
  pages =        "203--215",
}

@Article{sep:Hamacher:86,
  author =       "H. Hamacher",
  title =        "Maximal Dynamic Polymatroids Flows and Applications",
  year =         "1986",
  journal =      "Discrete Appl. Math.",
  volume =       "15",
  pages =        "41--54",
}

@Article{sep:HamacherChoiFrancisTufekci:84,
  author =       "H. W. Hamacher and W. Choi and R. L. Francis and S.
                 Tufekci",
  title =        "Network Models of Building Evacuation Problems with
                 Flow-Dependent Exit Capacities",
  journal =      "Oper. Res.",
  year =         "1984",
  pages =        "1047--1059",
}

@Article{sep:HamacherFoulds:89,
  author =       "H. W. Hamacher and L. R. Foulds",
  title =        "Algorithms for Flows with Parametric Capacities",
  year =         "1989",
  journal =      "Z. Oper. Res. Ser. A-B",
  volume =       "33",
  number =       "1",
  pages =        "21--37",
}

@Article{sep:HamacherPicardQueyranne:84,
  author =       "H. Hamacher and J. C. Picard and M. Queyranne",
  title =        "Ranking the Cuts and Out-sets of a Network",
  year =         "1984",
  journal =      "Ann. Disc. Math.",
  volume =       "19",
  pages =        "183--200",
}

@Article{sep:HamacherTufekci:87,
  author =       "H. W. Hamacher and S. Tufekci",
  title =        "On the Use of Lexicographic Min Cost Flows in
                 Evacuation Modelling",
  year =         "1987",
  journal =      "Naval Research Logistics Quarterly",
  volume =       "34",
  number =       "4",
  pages =        "487--503",
}

@Article{sep:HamalaHalicka:,
  author =       "M. Hamala and M. Halicka",
  title =        "Monotonicity of the Lagrangian Function in the
                 Parametric Interior Point Methods of Convexs
                 Programming",
  journal =      "Acta Math. Univ. Comenian.",
  year =         "1992",
  volume =       "LXI",
  pages =        "41--55",
}

@Article{sep:Hammer:69,
  author =       "P. L. Hammer",
  title =        "Time-Minimizing Transportation Problems",
  journal =      "Naval Research Logistics Quarterly",
  year =         "1969",
  volume =       "16",
  pages =        "345--357",
}

@TechReport{sep:Hammer:7,
  author =       "P. L. Hammer",
  title =        "Boolean Elements in Combinatorial Optimization, {I} -
                 {II}",
  institution =  "University of Waterloo",
  year =         "197x",
  address =      "Waterloo",
  pages =        "15",
}

@TechReport{sep:Hammer:71,
  author =       "P. L. Hammer",
  title =        "Communication on {"}The Bottleneck Transportation
                 Problems{"} and {"}Some Remarks on the Time
                 Transportation Problem{"}",
  institution =  "?",
  year =         "1971",
  pages =        "487--490",
}

@InProceedings{sep:Hammer:75,
  author =       "P. L. Hammer",
  title =        "Boolean Elements in Combinatorial Optimization: {A}
                 Survey",
  booktitle =    "Combinatorial Programming: Methods and Applications.
                 Proceedings of the NATO Advanced Study Inst.,
                 Versailles 1974",
  year =         "1975",
  editor =       "B. Roy",
  pages =        "67--92",
  address =      "Dordrecht",
  publisher =    "Reidel",
}

@InProceedings{sep:Hammer:79,
  author =       "P. L. Hammer",
  title =        "Boolean Elements in Combinatorial Optimization",
  booktitle =    "Discrete Optimization I",
  year =         "1979",
  editor =       "P. L. Hammer and E. L. Johnson and B. H. Korte",
  pages =        "51--71",
  organization = "Annals of Discrete Mathematics 4",
  address =      "Amsterdam, New York, Oxford",
  publisher =    "North-Holland",
}

@TechReport{sep:HammerPeledSorensen:73,
  author =       "P. L. Hammer and U. N. Peled and S. Sorensen",
  title =        "Pseudo-Boolean Functions and Game Theory, Core
                 Elements and Shapley Value",
  institution =  "University of Waterloo",
  year =         "1973",
  number =       "CORR 73-26",
  address =      "Waterloo",
  pages =        "8",
}

@TechReport{sep:HammerRosenberg:73,
  author =       "P. L. Hammer and I. G. Rosenberg",
  title =        "Linear Decomposition of a Positive Group-Boolean
                 Function",
  institution =  "University of Waterloo",
  year =         "1973",
  number =       "CORR 73-25",
  address =      "Waterloo",
  pages =        "10",
}

@Article{sep:HammerSimeoneLieblingDeWerra:88,
  author =       "P. L. Hammer and B. Simeone and Th. Liebling and D. de
                 Werra",
  title =        "From Linear Separability to Unimodality : {A}
                 Hierarchy of Classes of Pseudo-Boolean Functions",
  year =         "1988",
  journal =      "SIAM J. Disc. Math.",
  volume =       "1",
  number =       "2",
  pages =        "174--184",
}

@Article{sep:HanYue:85,
  author =       "J. Han and M. Yue",
  title =        "Elimination Conditions and Lower Bounds for the
                 Permutation Flow-Shop Sequencing Problem",
  year =         "1985",
  journal =      ACTMA2,
  volume =       "2",
  pages =        "321--331",
}

@Proceedings{sep:Hansen:77,
  editor =       "P. Hansen",
  title =        "Methods of nonlinear 0-1 Programming",
  organization = "Conference on Discrete Optimization",
  year =         "1977",
  address =      "Vancouver",
  month =        aug,
  pages =        "25",
}

@Article{sep:Hansen:80,
  author =       "P. Hansen",
  title =        "An {O}(m log {D}) Algorithm for Shortest Paths",
  journal =      "Discrete Appl. Math.",
  year =         "1980",
  volume =       "2",
  pages =        "151--153",
}

@Article{sep:Hansen:83,
  author =       "P. Hansen",
  title =        "Recognizing Sign Solvable Graphs",
  journal =      "Discrete Appl. Math.",
  year =         "1983",
  volume =       "6",
  pages =        "237--242",
}

@Article{sep:HansenKaufman:73,
  author =       "P. Hansen and L. Kaufman",
  title =        "A Primal-Dual Algorithm for the Three-Dimensional
                 Assignment Problem",
  journal =      "Cahiers Centre {'E}tudes Rech. Op{'e}r.",
  year =         "1973",
  volume =       "15",
  pages =        "327--336",
}

@TechReport{sep:HansenRoberts:92,
  author =       "P. Hansen and F. S. Roberts",
  title =        "An Impossibility Result in Axiomatic Location Theory",
  institution =  "DIMACS, Rutgers University",
  year =         "1992",
  number =       "92--2",
  address =      "New Brunswick",
}

@Article{sep:Hanson:91,
  author =       "Morgan A. Hanson",
  title =        "A Simple Solution of the van der Waerden Permanent
                 Problem",
  journal =      "Journal of Global Optimization",
  volume =       "1",
  pages =        "287--293",
  year =         "1991",
}

@InProceedings{sep:Harborth:88,
  author =       "H. Harborth",
  title =        "Fermat-Like Binomial Equations",
  booktitle =    "Applications of Fibonacci Numbers",
  year =         "1988",
  editor =       "A. N. Philippou et al.",
  pages =        "1--5",
  publisher =    "Kluwer Academic Publishers",
}

@InProceedings{sep:HarborthKemnitzMoellerSuessenbach:87,
  author =       "H. Harborth and A. Kemnitz and M. M{\"o}ller and A.
                 S{\"u}ssenbach",
  title =        "Ganzzahlige planare Darstellung der platonischen
                 {K}{\"o}rper",
  booktitle =    "Elemente der Mathematik 42",
  year =         "1987",
  pages =        "119--122",
  address =      "Basel",
  publisher =    "Birkh{\"a}user Verlag",
}

@Article{sep:HarperSavage:72,
  author =       "L. H. Harper and J. E. Savage",
  title =        "On the Complexity of the Marriage Problem",
  journal =      "Adv. in Math.",
  year =         "1972",
  volume =       "9",
  pages =        "299--312",
}

@TechReport{sep:HartmannSchneider:90,
  author =       "M. Hartmann and M. H. Schneider",
  title =        "An Analogue of Hoffman's Circulation Conditions for
                 Max-Balanced Flows",
  institution =  "University of North Carolina, Dep. of Operations
                 Research",
  year =         "1990",
  number =       "90-02",
  address =      "Chapel Hill, NC",
  pages =        "23",
}

@Article{sep:Hassin:81a,
  author =       "R. Hassin",
  title =        "Maximum Flow in (s,t) Planar Networks",
  journal =      "Inform. Process. Lett.",
  year =         "1981",
  volume =       "13",
  pages =        "107--108",
}

@Article{sep:Hassin:81b,
  author =       "R. Hassin",
  title =        "Generalizations of Hoffman's Existence Theorem for
                 Circulations",
  journal =      "Networks",
  year =         "1981",
  volume =       "11",
  pages =        "243--254",
}

@Article{sep:Hassin:82a,
  author =       "R. Hassin",
  title =        "Minimum Cost Flow with Set-Constraints",
  journal =      "Networks",
  year =         "1982",
  volume =       "12",
  pages =        "1--21",
}

@TechReport{sep:Hassin:82b,
  author =       "R. Hassin",
  title =        "Maximum Flow in Undirected Planar Networks",
  institution =  "University of Tel-Aviv",
  year =         "1982",
  address =      "Tel-Aviv",
  pages =        "11",
}

@Article{sep:Hassin:83,
  author =       "R. Hassin",
  title =        "The Minimum Cost Flow Problem: {A} Unifying Approach
                 to Existing Algorithms and a New Tree-Search
                 Algorithm",
  journal =      "Math. Programming",
  year =         "1983",
  volume =       "25",
  pages =        "228--239",
}

@Article{sep:Hassin:84a,
  author =       "R. Hassin",
  title =        "A Dichotomous Search for a Geometric Random Variable",
  year =         "1983",
  journal =      "Oper. Res.",
  volume =       "32",
  pages =        "423--439",
}

@Article{sep:Hassin:84b,
  author =       "R. Hassin",
  title =        "On Multicommodity Flows in Planar Graphs",
  journal =      "Networks",
  year =         "1984",
  volume =       "14",
  pages =        "225--235",
}

@Article{sep:Hassin:92,
  author =       "Refael Hassin",
  title =        "Algorithms for the Minimum Cost Circulation Problem
                 based on Maximizing the Mean Improvement",
  journal =      "Operations Research Letters",
  volume =       "12",
  pages =        "227--233",
  year =         "1992",
}

@Article{sep:HassinZemel:88,
  author =       "R. Hassin and E. Zemel",
  title =        "Probabilistic Analysis of the Capacitated
                 Transportation Problem",
  year =         "1988",
  journal =      "Math. Oper. Res.",
  volume =       "13",
  number =       "1",
  pages =        "80--89",
}

@InProceedings{sep:Hausmann:79,
  author =       "D. Hausmann",
  title =        "Complexity of the Testing of Adjacency on the
                 {B}-Matching Polyhedron",
  booktitle =    "Operations Researchs Verfahren, 32, Third Symposium on
                 Operations Research, Mannheim 1978",
  year =         "1979",
  editor =       "W. Oettli and F. Steffens",
  pages =        "133--141",
  address =      "K{\"o}nigstein",
  publisher =    "Anton Hain Meisenheim",
}

@Article{sep:HausmannJenkynsKorte:80,
  author =       "D. Hausmann and T. A. Jenkyns and B. Korte",
  title =        "Worst Case Analysis of Greedy Type Algorithms for
                 Independence Systems",
  journal =      "Math. Programming Stud.",
  year =         "1980",
  volume =       "12",
  pages =        "120--131",
}

@Article{sep:HausmannKorte:78,
  author =       "D. Hausmann and B. Korte",
  title =        "Colouring Criteria for the Adjacency on
                 0-1-Polyhedra",
  journal =      "Math. Programming Stud.",
  year =         "1978",
  volume =       "8",
  pages =        "106--127",
}

@InProceedings{sep:HausmannKorte:80a,
  author =       "D. Hausmann and B. Korte",
  title =        "The Relative Strength of Oracles for Independence
                 Systems",
  booktitle =    "Special Topics of Applied Mathematics",
  year =         "1980",
  editor =       "J. Frehse and D. Pallaschke and U. Trottenberg",
  pages =        "195--212",
  address =      "Amsterdam",
  publisher =    "North-Holland",
}

@InProceedings{sep:HausmannKorte:80b,
  author =       "D. Hausmann and B. Korte",
  title =        "Computational Relations between Various Definitions of
                 Matroids and Independence Systems",
  booktitle =    "Optimization Techniques, Part II",
  year =         "1980",
  editor =       "K. Iracki and K. Malanowski and P. Walukiewicz",
  pages =        "195--198",
  organization = "Lecture Notes in Control and Information Sciences,
                 23",
  address =      "Berlin",
  publisher =    "Springer",
}

@InProceedings{sep:HausmannKorte:81,
  author =       "D. Hausmann and B. Korte",
  title =        "Algorithmic Versus Axiomatic Definitions of Matroids",
  booktitle =    "Mathematical Programming at Oberwolfach",
  year =         "1981",
  editor =       "H. Koenig and B. Korte and K. Ritter",
  pages =        "98",
  organization = "Mathematical Programming Study, 14",
}

@Article{sep:HausmannKorteKannan:81,
  author =       "D. Hausmann and Korte Kannan R.",
  title =        "Exponential Lower Bounds on a Class of Knapsack
                 Algorithms",
  journal =      "Math. Oper. Res.",
  year =         "1981",
  volume =       "6",
  pages =        "225--232",
}

@TechReport{sep:Haverly:85a,
  author =       "C. A. Haverly",
  title =        "Number of Simplex Iterations for Four Model
                 Structures",
  institution =  "Haverly Systems Inc.",
  year =         "1985",
  address =      "Denville, New Jersey 07834",
  pages =        "11",
}

@TechReport{sep:Haverly:85b,
  author =       "C. A. Haverly",
  title =        "Studies on Behavior of the Karmarkar Method",
  institution =  "Haverly Systems Inc.",
  year =         "1985",
  address =      "Denville, New Jersey 07834",
  pages =        "22",
}

@TechReport{sep:Haverly:85c,
  author =       "C. A. Haverly",
  title =        "Results of a New Series of Case Rems using the
                 Karmarkar Algorithm",
  institution =  "Haverley Systems Inc.",
  year =         "1985",
  address =      "Denville, New Jersey 07834",
  pages =        "10",
}

@Article{sep:Hayashi:86,
  author =       "Y. Hayashi",
  title =        "A Solution Method for a Knapsack Problem and Its
                 Variant",
  journal =      "Japan J. Appl. Math.",
  year =         "1986",
  volume =       "3",
  pages =        "73--91",
}

@Article{sep:Helbig:84,
  author =       "S. Helbig",
  title =        "Optimization Problems on Extremal Algebras: Neccessary
                 and Sufficient Conditions for Optimal Points",
  journal =      "International Series of Numerical Mathematics",
  year =         "1984",
  volume =       "72",
  pages =        "166--184",
}

@InProceedings{sep:Helbig:86,
  author =       "S. Helbig",
  title =        "Parametric Optimization in Certain Lattice-Ordered
                 Groups: Variable Objective Function",
  booktitle =    "Parametric Optimization and related Topics",
  year =         "1986",
  editor =       "J. Guddat",
  address =      "Berlin",
  publisher =    "Akademie-Verlag",
}

@Book{sep:Helbig:87,
  author =       "S. Helbig",
  title =        "Parametrische semi-infinite Optimierung in
                 totalgeordneten Gruppen",
  publisher =    "Fischer Verlag",
  year =         "1987",
  address =      "Frankfurt/M.",
  pages =        "162",
}

@Article{sep:Helbig:88,
  author =       "S. Helbig",
  title =        "On the continuity of the optimal value in extremally
                 linear optimization problems",
  year =         "1988",
  journal =      "Numer. Funct. Anal. Optim.",
  volume =       "9",
  number =       "11/12",
  pages =        "1201--1220",
}

@Article{sep:HeldHoffmannJohnsonWolfe:84,
  author =       "M. Held and A. J. Hoffmann and E. L. Johnson and P.
                 Wolfe",
  title =        "Aspects of the Travelling Salesman Problem",
  journal =      "IBM J. Res. Develop.",
  year =         "1984",
  volume =       "28",
  pages =        "476--486",
}

@Article{sep:HeldKarp:62,
  author =       "M. Held and R. M. Karp",
  title =        "A Dynamic Programming Approach to Sequencing
                 Problems",
  journal =      "J. Soc. Indust. Appl. Math.",
  year =         "1962",
  volume =       "10",
  pages =        "196--210",
}

@Article{sep:HeldKarp:70,
  author =       "M. Held and R. M. Karp",
  title =        "The Travelling-Salesman Problems and Minimum Spanning
                 Trees",
  journal =      "Oper. Res.",
  year =         "1970",
  volume =       "18",
  pages =        "1138--1162",
}

@Article{sep:HeldKarp:71,
  author =       "M. Held and R. M. Karp",
  title =        "The Travelling-Salesman Problems and Minimum Spanning
                 Trees: Part {II}",
  journal =      "Math. Programming",
  year =         "1971",
  volume =       "1",
  pages =        "6--25",
}

@Article{sep:HeldWolfeCrowder:74,
  author =       "M. Held and P. Wolfe and H. P. Crowder",
  title =        "Validation of Subgradient Optimization",
  journal =      "Math. Programming",
  year =         "1974",
  volume =       "6",
  pages =        "62--88",
}

@Article{sep:HellNesetril:91,
  author =       "P. Hell and J. Nesetril",
  title =        "Images of Rigid Digraphs",
  year =         "1991",
  journal =      EURJC,
  volume =       "12",
  number =       "1",
  pages =        "33--42",
}

@TechReport{sep:Helmberg:93,
  author =       "Christoph Helmberg",
  title =        "Cutting Aluminium Coils with High Length
                 Variabilities",
  institution =  "Institut f{\"u}r Mathematik",
  year =         "1993",
  number =       "275",
  address =      "Technische Universit{\"a}t Graz",
}

@TechReport{sep:HelmbergMoharPoljakRendl:93,
  author =       "Christoph Helmberg and Bojan Mohar and Svatopluk
                 Poljak and Franz Rendl",
  title =        "A Spectral Approach to Bandwidth and Separator
                 Problems in Graphs",
  institution =  "Institut f{\"u}r Mathematik",
  year =         "1993",
  number =       "272",
  address =      "Technische Universit{\"a}t Graz",
}

@TechReport{sep:HertogJarreRoosTerlaky:92,
  author =       "D. den Hertog and F. Jarre and C. Roos and T.
                 Terlaky",
  title =        "A Unifying Investigation of Interior-Point Methods for
                 Convex Programming",
  institution =  "Delft University of Technology",
  year =         "1992",
  number =       "92--89",
  address =      "Delft",
}

@TechReport{sep:HertogKaliskiRoosTerlaky:93,
  author =       "D. den Hertog and J. Kaliski and C. Roos and T.
                 Terlaky",
  title =        "A Logarithmic Barrier Cutting Plane Method for Convex
                 Programming",
  institution =  "Delft University of Technology",
  year =         "1993",
  number =       "93-43",
  address =      "Delft",
}

@TechReport{sep:HertogRoosTerlaky:90,
  author =       "D. den Hertog and C. Roos and R. Terlaky",
  title =        "A Potential Reduction Variant of Renegar's Short-Step
                 Path-Following Method for Linear Programming",
  institution =  "Delft University of Technology",
  year =         "1990",
  number =       "90-14",
  address =      "Delft",
  pages =        "19",
}

@TechReport{sep:Hettich:85,
  author =       "R. Hettich",
  title =        "Parametric Optimization: Applications and
                 Computational Methods",
  institution =  "Universit{\"a}t Trier",
  year =         "1985",
  address =      "Trier",
  pages =        "18",
}

@TechReport{sep:HettichJongen:94,
  author =       "Rainer Hettich and Hubertus Th. Jongen",
  title =        "On Continuous Deformations of Semi-Infinite
                 Optimization Problems",
  institution =  "Institut f{\"u}r Mathematik",
  year =         "1994",
  address =      "Universit{\"a}t Trier",
}

@Article{sep:HettichMargraff:88,
  author =       "R. Hettich and G. Margraff",
  title =        "Some Experiments with Karmarkar's Algorithm or Linear
                 Programming",
  journal =      "Optimization",
  year =         "1988",
  number =       "5",
  volume =       "19",
  pages =        "653--664",
}

@Article{sep:HochbaumMaass:87,
  author =       "D. S. Hochbaum and W. Maass",
  title =        "Fast Approximation Algorithms for a Nonconvex Covering
                 Problem",
  journal =      "J. Algorithms",
  year =         "1987",
  volume =       "8",
  pages =        "305--323",
}

@TechReport{sep:HochbaumNaor:91,
  author =       "D. S. Hochbaum and J. Naor",
  title =        "Simple and Fast Algorithms for Linear and Integer
                 Programs with two Variables per Inequality",
  institution =  "University of California, Dep. of IE\&OR",
  year =         "1991",
  address =      "Berkeley, CA",
  pages =        "17",
}

@InProceedings{sep:HochbaumShmoys:84,
  author =       "D. S. Hochbaum and D. B. Shmoys",
  title =        "Powers of Graphs: {A} Powerful Approximation Algorithm
                 Technique for Bottleneck Problems",
  booktitle =    "Proceedings of the Sixteenth Annual ACM Symposium on
                 Theory of Computing, Washington, 1984",
  year =         "1984",
  pages =        "324--333",
  address =      "Baltimore",
  publisher =    "ACM",
}

@Article{sep:Hoeding:87,
  author =       "M. H{\"o}ding",
  title =        "Algebraische Strukturen spezieller diskreter
                 Optimierungsprobleme",
  journal =      "Wiss. Z. Tech. Hochsch. Magdeburg",
  year =         "1987",
  volume =       "31",
  pages =        "63--67",
}

@TechReport{sep:Hoelder:1901,
  author =       "O. H{\"o}lder",
  title =        "Die Axiome der Quantit{\"a}t und die Lehre vom
                 Ma\ss{}",
  institution =  "K{\"o}nigl. S{\"a}chs. Gesellschaft der
                 Wissenschaften, Mathematisch-Physikalische Klasse 53",
  year =         "1901",
  address =      "Leipzig",
  pages =        "1--64",
}

@Article{sep:Hoffman:63,
  author =       "A. J. Hoffman",
  title =        "On Abstract Dual Linear Programs",
  journal =      "Naval Research Logistics Quarterly",
  year =         "1963",
  volume =       "10",
  pages =        "369--373",
}

@Article{sep:Hoffman:74,
  author =       "A. J. Hoffman",
  title =        "A Generalization of Max Flow-Min Cut",
  journal =      "Math. Programming",
  year =         "1974",
  volume =       "6",
  pages =        "52--359",
}

@TechReport{sep:Hoffman:78a,
  author =       "A. J. Hoffman",
  title =        "Some Greedy Ideas",
  institution =  "Summerschool",
  year =         "1978",
  address =      "Sogesta, Urbino",
  pages =        "1--12",
}

@TechReport{sep:Hoffman:78b,
  author =       "A. J. Hoffman",
  title =        "On Simple Linear Programming Problems",
  institution =  "Summerschool",
  year =         "1978",
  address =      "Sogesta, Urbino",
  pages =        "317--327",
}

@Article{sep:Hoffman:78c,
  author =       "A. J. Hoffman",
  title =        "On Lattice Polyhedra {III}: Blockers and Anti-Blockers
                 of Lattice Clutters",
  journal =      "Math. Programming Stud.",
  year =         "1978",
  volume =       "8",
  pages =        "197--207",
}

@TechReport{sep:HoffmanSchwartz:76,
  author =       "A. J. Hoffmann and D. E. Schwartz",
  title =        "On Lattice Polyhedra",
  institution =  "Colloquia Mathematica Societatis J\`{a}nos Bolyai,
                 Combinatorics",
  year =         "1976",
  number =       "18",
  address =      "Keszthely (Hungary)",
  pages =        "593--598",
}

@Article{sep:Holm:87,
  author =       "S. Holm",
  title =        "Adding Activities to the Dual Instead of Cuts to the
                 Primal Problem",
  journal =      "Discrete Appl. Math.",
  year =         "1987",
  volume =       "18",
  pages =        "167--174",
}

@TechReport{sep:HolmTind:85,
  author =       "S. Holm and J. Tind",
  title =        "Decomposition in Integer Programming by Superadditive
                 Functions",
  institution =  "Odense University",
  year =         "1985",
  number =       "\#32-85-86",
  address =      "Odense, Denmark",
  pages =        "21",
}

@Article{sep:HoltonMcKayPlummerThomassen:82,
  author =       "D. A. Holton and B. D. McKay and M. D. Plummer and C.
                 Thomassen",
  title =        "A Nine Point Theorem for 3-Connected Graphs",
  journal =      "Combinatorica",
  year =         "1982",
  volume =       "2",
  pages =        "53--62",
}

@PhdThesis{sep:Holzbaur:84,
  author =       "U. D. Holzbaur",
  title =        "Entscheidungsmodelle {\"u}ber Angeordneten
                 {K}{\"o}rpern",
  school =       "Universit{\"a}t Ulm",
  year =         "1984",
  address =      "Ulm",
  note =         "1 -- 79 p.",
}

@Article{sep:HopcroftUllman:73,
  author =       "J. E. Hopcroft and J. D. Ullman",
  title =        "Set Merging Algorithms",
  journal =      "SIAM J. Comput.",
  year =         "1973",
  volume =       "4",
  pages =        "294--301",
}

@Article{sep:HoppeKovalev:90a,
  author =       "V. Hoppe and M. Kovalev",
  title =        "Zu einigen Problemen der Reihenfolgeoptimierung der
                 operativen Steuerung im {FMS} (flexible manufactory
                 systems)",
  journal =      "Optimization",
  year =         "1990",
  volume =       "21",
  pages =        "109--212",
}

@Article{sep:HoppeKovalev:90b,
  author =       "V. Hoppe and M. M. Kovalev",
  title =        "Zu einigen Problemen der Reihenfolgeoptimierung der
                 operativen Steuerung in {FMS} (flexible manufactory
                 systems)",
  journal =      "Optimization",
  year =         "1990",
  volume =       "21",
  pages =        "109--121",
}

@TechReport{sep:HoppeKovalev:92,
  author =       "V. Hoppe and M. Kovalev",
  title =        "Balanced Resource for Cyclic Scheduling",
  institution =  "Belarussian State University, Dep. of Mathematical
                 Problems in CAD",
  year =         "1992",
  number =       "9208-Do",
  address =      "Minsk,Belarussian",
  pages =        "9",
}

@Article{sep:Horn:74,
  author =       "W. A. Horn",
  title =        "Some Simple Scheduling Algorithms",
  journal =      "Naval Research Logistics Quarterly",
  year =         "1974",
  volume =       "21",
  pages =        "177--185",
}

@Article{sep:HorvathLamSethi:77,
  author =       "E. C. Horvath and S. Lam and R. Sethi",
  title =        "A Level Algorithm for Preemptive Scheduling",
  journal =      "J. Assoc. Comput. Mach.",
  year =         "1977",
  volume =       "24",
  pages =        "32--43",
}

@Article{sep:Hu:61,
  author =       "T. C. Hu",
  title =        "The Maximum Capacity Route Problem",
  journal =      "Oper. Res.",
  year =         "1961",
  volume =       "9",
  pages =        "898--900",
}

@Article{sep:Hu:67,
  author =       "T. C. Hu",
  title =        "Revised Matrix Algortihms for Shortst Paths",
  journal =      "SIAM J. Appl. Math.",
  year =         "1967",
  volume =       "15",
  pages =        "207--218",
}

@Article{sep:HuangKortanek:91,
  author =       "S. Huang and K. O. Kortanek",
  title =        "A note on a potential reduction algorithm for linear
                 programming with simultanous primal-dual updating",
  journal =      "Oper. Res. Lett.",
  volume =       "10",
  year =         "1991",
  number =       "9",
  pages =        "501--507",
}

@Article{sep:Hujter:88,
  author =       "M. Hujter",
  title =        "Improved Lower and Upper Bounds for the Number of
                 Feasible Solutions to a Knapsack Problem",
  journal =      "Optimization",
  year =         "1988",
  volume =       "19",
  pages =        "889--894",
}

@Misc{sep:Hujter:92,
  author =       "Mih\ïaly Hujter",
  title =        "Combinatorial Optimization Problems Related to
                 Geometrical Packings and Coverings",
  year =         "1992",
}

@InProceedings{sep:Hujter:94,
  author =       "Mih\ïaly Hujter",
  title =        "On the {QR} Factorization of Sparse Matrices by using
                 Graphs",
  booktitle =    "Proc. MicroCAD Conf., Miskolc",
  year =         "1994",
  address =      "Miskolc",
  annote =       "in print",
}

@Article{sep:HujterVizvary:87,
  author =       "M. Hujter and B. Vizv\`{a}ry",
  title =        "The Exact Solutions to the Frobenius Problem with
                 Three Variables",
  journal =      "J. Ramanujan Math. Soc.",
  year =         "1987",
  volume =       "2",
  pages =        "117--143",
}

@Article{sep:Hulin:71,
  author =       "Adam J. Hulin",
  title =        "Extensions of ordered Semigroups",
  journal =      "Semigroup Forum",
  year =         "1971",
  volume =       "2",
  pages =        "336--342",
}

@Article{sep:HulmeShiverSlater:84,
  author =       "B. Hulme and A. W. Shiver P. J. Slater",
  title =        "A Boolean algebraic analysis of fire protection",
  journal =      "Ann. Disc. Math.",
  volume =       "19",
  year =         "1981",
  pages =        "215--228",
}

@Article{sep:HungRom:80,
  author =       "M. S. Hung and W. O. Rom",
  title =        "Solving the Assignment Problems by Relaxation",
  journal =      "Oper. Res.",
  year =         "1980",
  volume =       "28",
  pages =        "969--982",
}

@InBook{sep:Huppert:x0,
  author =       "B. Huppert",
  title =        "Endliche Gruppen {I}",
  publisher =    "?",
  year =         "19x0",
  pages =        "24--33",
}

@Article{sep:Ibaraki:78,
  author =       "T. Ibaraki",
  title =        "Depth-m Search in Branch-and Bound Algorithms",
  journal =      "Internat. J. Comput. Inform. Sci.",
  year =         "1978",
  volume =       "7",
  pages =        "315--343",
}

@Article{sep:Ichimori:84,
  author =       "T. Ichimori",
  title =        "On Min-Max Integer Allocation Problems",
  journal =      "Oper. Res.",
  year =         "1984",
  volume =       "32",
  pages =        "449--450",
}

@Article{sep:IchimoriIshiiNishida:79,
  author =       "T. Ichimori and H. Ishii and T. Nishida",
  title =        "A Minimax Flow Problem",
  journal =      "Math. Japon.",
  year =         "1979",
  volume =       "24",
  pages =        "65--71",
}

@Article{sep:IchimoriIshiiNishida:80,
  author =       "T. Ichimori and H. Ishii and T. Nishida",
  title =        "Finding the Weighted Minimax Flow in a Polynomial
                 Time",
  journal =      "J. Oper. Res. Soc. Japan",
  year =         "1980",
  volume =       "23",
  pages =        "268--272",
}

@Article{sep:IchimoriIshiiNishida:81,
  author =       "T. Ichimori and H. Ishii and T. Nishida",
  title =        "Weighted Minimax Real-Valued Flows",
  journal =      "J. Oper. Res. Soc. Japan",
  year =         "1981",
  volume =       "24",
  pages =        "52--60",
}

@Article{sep:IchimoriIshiiNishida:82,
  author =       "T. Ichimori and H. Ishii and T. Nishida",
  title =        "Optimal Sharing",
  journal =      "Math. Programming",
  year =         "1982",
  volume =       "23",
  pages =        "341--348",
}

@Article{sep:Imai:87,
  author =       "H. Imai",
  title =        "Extensions of the Multiplicative Penalty Function
                 Method for Linear Programming",
  journal =      "J. Oper. Res. Soc. Japan",
  year =         "1987",
  volume =       "30",
  pages =        "160--179",
}

@Article{sep:Imai:88,
  author =       "H. Imai",
  title =        "On the Convexity of the Multiplicative Version of
                 Karmarkar's Potential Function",
  journal =      "Math. Programming",
  year =         "1988",
  volume =       "40",
  pages =        "29--32",
}

@Proceedings{sep:ImaiIriSasakawa:88,
  editor =       "H. Imai and M. Iri and T. Sasakawa",
  title =        "Multiplicative Penalty Function Method for Linear
                 Programming and its Variations",
  publisher =    "13th International Symp. on Mathematical Programming",
  year =         "1988",
  address =      "Tokyo",
}

@Article{sep:Iri:62a,
  author =       "M. Iri",
  title =        "Fundamentals of the algebraic and topological
                 treatments of general information networks",
  journal =      "RAAG Memoirs of the Unifying Study of Basic Problems
                 in Engineering and Physical Sciences by Means of
                 Geometry",
  year =         "1962",
  volume =       "III",
  number =       "Division G",
  pages =        "418--450",
}

@InProceedings{sep:Iri:62b,
  author =       "M. Iri",
  title =        "Theory of General Information Networks: An Algebraic
                 and Topological Foundation to the Theory of
                 Information-Handling Systems",
  booktitle =    "Proceedings of the Symposium on Mathematical Theory of
                 Automata",
  year =         "1962",
  pages =        "415--435",
  address =      "Brooklyn",
  publisher =    "Polytechnic Institute of Brooklyn",
}

@Article{sep:Iri:78,
  author =       "M. Iri",
  title =        "A practical algorithm for the Menger-Type
                 Generalization of the independent assignment problem",
  journal =      "Math. Programming Stud.",
  year =         "1978",
  volume =       "8",
  pages =        "88--105",
}

@Proceedings{sep:Iri:79a,
  editor =       "M. Iri",
  title =        "Survey of Recent Trends in Applications of Matroids",
  organization = "ISCAS",
  year =         "1979",
  pages =        "987",
}

@InProceedings{sep:Iri:79b,
  author =       "M. Iri",
  title =        "A review of recent work in Japan on principal
                 partitions of matroids and their applications",
  booktitle =    "Second International Conference on Combinatorial
                 Mathematics",
  year =         "1979",
  editor =       "A. Gewirtz and L. V. Quintas",
  pages =        "306--319",
  address =      "Annals of the New York Academy of Sciences, 319, New
                 York",
  publisher =    "The New York Academy of Sciences",
}

@InProceedings{sep:Iri:81,
  author =       "M. Iri",
  title =        "Application of Matroid Theory to Engineering Systems
                 Problems",
  booktitle =    "Proceeding of the Sixth Conference on Probality
                 Theory, Brasov 1979",
  year =         "1981",
  editor =       "B. Bereanu and P. Grigorescu and M. Iosifescu and T.
                 Postelnicu",
  publisher =    "Editura Academiei Republicii Socialista Romania",
  address =      "Bucuresti",
  pages =        "107--127",
}

@TechReport{sep:Iri:84,
  author =       "M. Iri",
  title =        "Another {"}Simple and Fast{"} Algorithm for linear
                 Programming",
  institution =  "?",
  year =         "1984",
  pages =        "1",
}

@InProceedings{sep:Iri:85,
  author =       "M. Iri",
  title =        "On Geometric Algorithms",
  booktitle =    "Methods of Operations Research 54",
  year =         "1985",
  editor =       "M. J. Beckmann and K.-W. Gaede and K. Ritter and H.
                 Schneeweiss",
  pages =        "18--37",
  organization = "X. Symposium on Operations Research",
  address =      "M{\"u}nchen",
  publisher =    "Anton Hain",
  month =        "26-28.8.1985",
}

@Article{sep:Iri:86,
  author =       "M. Iri",
  title =        "Practical Computational Methods in
                 Geometrical/Geographical Optimization Problems",
  journal =      "Methods of Operations Research",
  volume =       "54",
  year =         "1986",
  pages =        "17--37",
}

@Article{sep:IriFujishige:81,
  author =       "M. Iri and S. Fujishige",
  title =        "Use of Matroid Theory in Operations Research, Circuits
                 and Systems Theory",
  journal =      "Internat. J. Systems Sci.",
  year =         "1981",
  volume =       "12",
  number =       "1",
  pages =        "27--54",
}

@Article{sep:IriImai:86,
  author =       "M. Iri and H. Imai",
  title =        "A Multiplicative Barrier Function Method for Linear
                 Programming",
  journal =      "Algorithmica",
  year =         "1986",
  volume =       "1",
  pages =        "455--482",
}

@InProceedings{sep:IriImai:87,
  author =       "M. Iri and H. Imai",
  title =        "Theory of the Multiplicative Penalty Function Method
                 for Linear Programming",
  booktitle =    "Discrete Algorithms and Complexity",
  year =         "1987",
  editor =       "D. S. Johnson and T. Nishizeki",
  pages =        "417--435",
  address =      "Boston",
  publisher =    "Academic Press",
}

@Article{sep:IriRecski:80,
  author =       "M. Iri and A. Recski",
  title =        "What does Duality Really mean?",
  journal =      "Circuit Theory and Applications",
  year =         "1980",
  volume =       "8",
  pages =        "317--324",
}

@TechReport{sep:IriSugihara:90,
  author =       "M. Iri and K. Sugihara",
  title =        "An Approach to Numerical-Combinatorial Algorithms with
                 an Example of Voronoi Diagram Construction",
  institution =  "Univerrsity of Tokyo, Faculty of Engineering",
  year =         "1990",
  address =      "Tokyo",
  pages =        "29",
}

@Article{sep:IriTomizawa:76,
  author =       "M. Iri and N. Tomizawa",
  title =        "An algorithm for finding an optimal {"}Independent
                 Assignment{"}",
  journal =      "J. Oper. Res. Soc. Japan",
  year =         "1976",
  volume =       "19",
  pages =        "32--57",
}

@Article{sep:Isermann:78,
  author =       "H. Isermann",
  title =        "On Some Relations between a Dual Pair of Multiple
                 Objective Linear Programs",
  journal =      "Z. Oper. Res. Ser. A-B",
  year =         "1978",
  volume =       "22",
  pages =        "33--41",
}

@Article{sep:Ishii78,
  author =       "H. Ishii",
  title =        "A new method finding the k-th best path in a graph",
  journal =      "J. Oper. Res. Soc. Japan",
  year =         "1978",
  pages =        "469--475",
}

@Article{sep:Ivanchev:86,
  author =       "D. T. Ivanchev",
  title =        "Finding the k Foremost Nodes in Parametric Capacited
                 Networks",
  journal =      "University Annual Applied Mathematics",
  year =         "1986",
  volume =       "22",
  pages =        "151--165",
}

@Article{sep:IvanchevRuhe:86a,
  author =       "D. T. Ivanchev and G. Ruhe",
  title =        "The Solution of Generalized Network Flow Problems with
                 Parametric Capacities and Stochastic Demands",
  journal =      "Found. Control Engrg.",
  year =         "1984",
  volume =       "9",
  pages =        "123--139",
}

@Article{sep:IvanchevRuhe:86b,
  author =       "D. T. Ivanchev and G. Ruhe",
  title =        "Finding the k Bicriterial Foremost Edges in Planer
                 Flow Networks",
  journal =      "C. R. Acad. Bulgare Sci.",
  year =         "1986",
  volume =       "39",
  pages =        "35--38",
}

@TechReport{sep:Iwamura:89,
  author =       "K. Iwamura",
  title =        "Primal Dual Algorithm for the Lexicographically
                 Optimal Base of a Submodular Polyhedron and its
                 Relation to a Poset Greedoid",
  institution =  "Rheinische Friedr.-Wilhelms-Universit{\"a}t, Inst. f.
                 {\"O}komometrie und OR",
  year =         "1989",
  number =       "88507-OR",
  address =      "Bonn",
  pages =        "12",
}

@Article{sep:Jacobsen:71,
  author =       "S. Jacobsen",
  title =        "On Marginal Allocation in Single Constraint Min-Max
                 Problems",
  journal =      "Management Sci.",
  year =         "1971",
  volume =       "17",
  pages =        "780--783",
}

@TechReport{sep:Jahn:85,
  author =       "J. Jahn",
  title =        "Duality in Partially Ordered Sets",
  institution =  "Technische Hochschule Darmstadt",
  year =         "1985",
  address =      "Darmstadt",
  pages =        "16",
}

@Article{sep:JajouZimmermann:89,
  author =       "A. F. Jajou and K. Zimmermann",
  title =        "Max-Separable Equations and the Set Covering",
  journal =      "Acta Univ. Carolin.---Math. Phys.",
  year =         "1989",
  volume =       "30",
  pages =        "13--21",
}

@TechReport{sep:JansenRoosTerlaky:92,
  author =       "B. Jansen and C. Roos and T. Terlaky",
  title =        "An Interior Point Approach to Postoptimal and
                 Parametric Analysis in Linear Programming",
  institution =  "Delft University of Technology",
  year =         "1992",
  number =       "92--21",
  address =      "Delft",
}

@TechReport{sep:JansenRoosTerlaky:93a,
  author =       "B. Jansen and C. Roos and T. Terlaky",
  title =        "The Theory of Linear Programming: Skew Symmetric
                 Self-Dual Problems and the Central Path",
  institution =  "Delft University of Technology",
  year =         "1993",
  number =       "93--15",
  address =      "Delft",
}

@TechReport{sep:JansenRoosTerlaky:93b,
  author =       "B. Jansen and C. Roos and . T. Terlaky",
  title =        "A Polynomial Primal-Dual Dikin-Type Algorithm for
                 Linear Programming",
  institution =  "TU Delft, Faculty of Technical Mathematics and
                 Informatics",
  year =         "1993",
  number =       "93-36",
  address =      "Delft",
  pages =        "20",
}

@TechReport{sep:JansenSchefflerWoeginger:92,
  author =       "K. Jansen and P. Scheffler and G. J. Woeginger",
  title =        "The Disjoint Cliques Problem",
  institution =  "Techn. Univ. Graz, Inst. f{\"u}r Mathematik",
  year =         "1992",
  number =       "240",
  address =      "Graz",
  pages =        "17",
}

@TechReport{sep:JansenWoeginger:92,
  author =       "K. Jansen and G. J. Woeginger",
  title =        "The Complexity of Detecting Crossingfree
                 Configurations in the Plane",
  institution =  "Techn. Univ. Graz, Inst. f{\"u}r Mathematik",
  year =         "1992",
  number =       "246",
  address =      "Graz",
  pages =        "17",
}

@TechReport{sep:JansenWoegingerYu:93,
  author =       "Klaus Jansen and Gerhard Woeginger and Zhongliang Yu",
  title =        "{UET}-Scheduling with Chain-type Precedence
                 Constraints",
  institution =  "Institut f{\"u}r Mathematik",
  year =         "1993",
  number =       "277",
  address =      "Technische Universit{\"a}t Graz",
}

@TechReport{sep:Janssen:84,
  author =       "P. Janssen",
  title =        "Anleitung zur Benutzung des {TEX}-Systems",
  institution =  "Universit{\"a}t Bonn",
  year =         "1984",
  number =       "72",
  address =      "Bonn",
  pages =        "1--13",
}

@TechReport{sep:JemelitschewKrawzow:80,
  author =       "W. A. Jemelitschew and M. K. Krawzow",
  title =        "Kombinatorik der Transportpolyeder",
  institution =  "Friedrich-Schiller-Universit{\"a}t",
  year =         "1980",
  number =       "N/80/27",
  address =      "Jena",
  pages =        "1--15",
}

@Article{sep:Jenkins:87,
  author =       "L. Jenkins",
  title =        "Parametric-Objective Integer Programming Using
                 Knapsack facets and Gomory cutting planes",
  journal =      "European J. Oper. Res.",
  volume =       "31",
  year =         "1987",
  pages =        "102--109",
}

@Article{sep:JerominKoerner:85,
  author =       "B. Jeromin and F. K{\"o}rner",
  title =        "On the refinement of bounds of heuristic algorithms
                 for the travelling salesman problem",
  journal =      "Math. Programming",
  volume =       "32",
  year =         "1985",
  pages =        "114--117",
}

@Article{sep:Jeroslow:73,
  author =       "R. G. Jeroslow",
  title =        "The simplex algorithm with the pivot rule of
                 maximizing criterion improvement",
  journal =      "Discrete Math.",
  year =         "1973",
  volume =       "4",
  pages =        "367--377",
}

@Article{sep:Jeroslow:78,
  author =       "R. G. Jeroslow",
  title =        "Some basis theorems for integral monoids",
  journal =      "Math. Oper. Res.",
  year =         "1978",
  volume =       "3",
  pages =        "145--154",
}

@InProceedings{sep:Jeroslow:81,
  author =       "R. Jeroslow",
  title =        "Some influences of generalized and ordinary convexity
                 in disjunctive and integer programming",
  booktitle =    "Generalized Concavity in Optimization and Economics",
  year =         "1981",
  editor =       "P. Schaible and W. T. Ziemba",
  pages =        "689--699",
  address =      "NATO Study Advanced Institute, Vancouver, New York
                 etc.",
  publisher =    "Academic Press",
}

@Article{sep:Jeroslow:85a,
  author =       "R. G. Jeroslow",
  title =        "The polynomial hierarchy and a simple model for
                 competititve analysis",
  journal =      "Math. Programming",
  volume =       "32",
  year =         "1985",
  pages =        "146--164",
}

@TechReport{sep:Jeroslow:85b,
  author =       "R. G. Jeroslow",
  title =        "A Simplification for Some Disjunctive Formulations",
  institution =  "?",
  year =         "1985",
  pages =        "19",
}

@TechReport{sep:Jeroslow:85c,
  author =       "R. G. Jeroslow",
  title =        "Alternative Formulations of Mixed integer Programs",
  institution =  "?",
  year =         "1985",
  pages =        "53",
}

@TechReport{sep:Jeroslow:85d,
  author =       "R. G. Jeroslow",
  title =        "An extension of mixed-integer programming models and
                 techniques to some database and {ARTIFICIAL}
                 {INTELLIGENCE} {STETTINGS}",
  institution =  "Institute of Technology",
  year =         "1985",
  address =      "Atlanta, Georgia",
  pages =        "1--93",
}

@Article{sep:JeroslowLowe:84a,
  author =       "R. G. Jeroslow and J. Lowe",
  title =        "Modelling with integer variables",
  journal =      "Math. Programming Stud.",
  volume =       "22",
  year =         "1984",
  pages =        "167--184",
}

@Article{sep:JeroslowLowe:84b,
  author =       "R. G. Jeroslow and J. Lowe",
  title =        "Modelling with integer variables",
  journal =      "Math. Programming Stud.",
  volume =       "22",
  year =         "1984",
  pages =        "167--184",
}

@TechReport{sep:JeroslowWang:87,
  author =       "G. Jeroslow and J. Wang",
  title =        "Dynamic Programming, Integral Polyhedra and Horn
                 Clause Knowledge Bases",
  institution =  "?",
  year =         "1987",
  type =         "36",
}

@Article{sep:Jeurissen:75,
  author =       "R. H. Jeurissen",
  title =        "Covers, matchings and odd cycles of a graph",
  journal =      "Discrete Math.",
  year =         "1975",
  volume =       "13",
  pages =        "251--260",
}

@Article{sep:JeworrekSchulz:87,
  author =       "T. Jeworrek and G. Schulz",
  title =        "Zur {L}{\"o}sung des Brieftr{\"a}gerproblems auf
                 gemischten Graphen",
  journal =      "Wiss. Z. Tech. Hochsch. Magdeburg",
  year =         "1987",
  volume =       "31",
  number =       "5",
  pages =        "58--61",
}

@TechReport{sep:JhaKortanekNo:88,
  author =       "S. Jha and O. Kortanek and H. No",
  title =        "Lotsizing and Setup Time Reduction under Stochastics
                 Demand: {A} Geometric Programming Approach",
  institution =  "The University of Iowa, College of Business
                 Administration",
  year =         "1988",
  number =       "88-12",
  address =      "Iowa",
  pages =        "43",
}

@Article{sep:Johnson:74,
  author =       "E. L. Johnson",
  title =        "On the Group Problem and a Subadditive Approach to
                 Integer Programming",
  journal =      "Math. Programming Stud.",
  year =         "1974",
  volume =       "2",
  pages =        "137--179",
}

@Article{sep:Johnson:77,
  author =       "D. B. Johnson",
  title =        "Efficient Algorithms for Shortest Path in Sparse
                 Networks",
  journal =      "J. Assoc. Comput. Mach.",
  year =         "1977",
  volume =       "24",
  pages =        "1--13",
}

@Article{sep:Johnson:80,
  author =       "E. L. Johnson",
  title =        "Subadditive Lifting Methods for Partitioning and
                 Knapsack Problems",
  journal =      "J. Algorithms",
  year =         "1980",
  volume =       "1",
  pages =        "75--96",
}

@Article{sep:Johnson:81,
  author =       "E. L. Johnson",
  title =        "Characterization of Facets for Multiple Right-Hand
                 Choice Linear Programs",
  journal =      "Math. Programming Stud.",
  year =         "1981",
  volume =       "14",
  pages =        "112--142",
}

@Article{sep:JohnsonAragonMcGeochSchevon:89,
  author =       "D. S. Johnson and C. R. Aragon and L. A. McGeoch and
                 C. Schevon",
  title =        "Optimization by Simulated Annealing: An Experimental
                 Evaluation; {I}: Graph Partitioning",
  journal =      "Oper. Res.",
  year =         "1989",
  volume =       "37",
  pages =        "865--891",
}

@InProceedings{sep:JohnsonPadberg:82,
  author =       "E. L. Johnson and M. W. Padberg",
  title =        "Degree-two inequalities, clique facets, and biperfect
                 graphs",
  booktitle =    "Bonn Workshop in Combinatorial Optimization",
  year =         "1982",
  editor =       "A. Bachem and M. Gr{\"o}tschel and B. Korte",
  pages =        "169--187",
  address =      "Annals of Discrete Mathematics, 16, Amsterdam",
  publisher =    "North Holland",
}

@TechReport{sep:JongenTwiltWeber:89,
  author =       "H. Th. Jongen and F. Twilt and G. W. Weber",
  title =        "Semi-Infinite Optimization: Structure and Stability of
                 the Feasible Set",
  institution =  "University of Twente, Facullty of Appl. Mathematics",
  year =         "1989",
  number =       "838",
  address =      "Enschede, Holland",
  pages =        "32",
}

@TechReport{sep:JongenWeber:91,
  author =       "H. Th. Jongen and G.-W. Weber",
  title =        "Nonconvex Optimization and its Structural Frontiers",
  institution =  "RETH Aachen, Lehrstuhl C. f{\"u}r Mathematik",
  year =         "1991",
  number =       "29",
  address =      "Aachen",
  pages =        "53",
}

@Article{sep:JuengerPulleyblankReinelt:85,
  author =       "M. J{\"u}nger and W. R. Pulleyblank and G. Reinelt",
  title =        "On Partitioning the Edges of Graphs into Connected
                 Subgraphs",
  journal =      "J. Graph Theory",
  year =         "1985",
  number =       "4",
  volume =       "9",
  pages =        "539--549",
}

@Article{sep:Juhnke:88,
  author =       "Fr. Juhnke",
  title =        "Ingradius und dicke Konvexer {K}{\"o}rper aus
                 Optimierungstheoretischer Sicht",
  journal =      "Beitr{"a}ge Algebra Geom.",
  year =         "1988",
  volume =       "27",
  pages =        "13--20",
}

@Article{sep:Jung:74,
  author =       "H. A. Jung",
  title =        "{\"U}ber die Bestimmung minimaler Wege und Ger{\"u}ste
                 in Graphen",
  journal =      "Computing",
  year =         "1974",
  volume =       "13",
  pages =        "249--252",
}

@PhdThesis{sep:Junginger:70,
  author =       "W. Junginger",
  title =        "{\"U}ber die {L}{\"o}sung des dreidimensionalen
                 Transportproblems",
  school =       "Univ. Stuttgart",
  year =         "1970",
  address =      "Stuttgart",
  pages =        "1--93",
}

@InProceedings{sep:Junginger:71,
  author =       "W. Junginger",
  title =        "Zur {L}{\"o}sung des dreidimensionalen
                 Transportproblems",
  booktitle =    "Operations Research-Verfahren XIII",
  year =         "1971",
  editor =       "R. Henn and H. P. Kuenzi and H. Schubert",
  pages =        "246--260",
  address =      "Meisenheim",
  publisher =    "A. Hain",
}

@TechReport{sep:Kaerkes:78,
  author =       "R. Kaerkes",
  title =        "Vorlesungen {\"u}ber Ordnungen und Netzplantheorie",
  institution =  "Rheinisch-Westf. Techn. Hochschule",
  year =         "1978",
  address =      "Aachen",
  number =       "45",
  pages =        "1--192",
}

@InProceedings{sep:Kalaba:60,
  author =       "R. Kalaba",
  title =        "On some Communication Network Problems",
  booktitle =    "Combinatorial Analysis",
  year =         "1960",
  pages =        "261--280",
  address =      "Providence",
  publisher =    "American Mathemaical Society",
}

@Article{sep:KalaiKleitmann:92,
  author =       "G. Kalai and D. J. Kleitman",
  title =        "A Quasi-Polynomial Bound for the Diameter of Graphs of
                 Polyhedra",
  journal =      "Bull. Amer. Math. Soc. (N.S.)",
  year =         "1992",
  volume =       "26",
  pages =        "315--316",
}

@TechReport{sep:KaliszewskiWalukiewicz:81,
  author =       "I. Kaliszewski and S. Walukiewicz",
  title =        "A Transformation of Integer Programs",
  institution =  "Systems Research Institute, Polish Academy of
                 Sciences",
  year =         "1981",
  number =       "2/81",
  address =      "Warszawa",
  pages =        "1--20",
}

@Article{sep:KamathKarmarkarRamakrishnanResende:90,
  author =       "A. P. Kamath and N. K. Karmarkar and K. G.
                 Ramakrishnan and M. G. C. Resende",
  title =        "Computational Experience with an Interior Point
                 Algorithmon the Staisfiability Problem",
  journal =      "Annals of Operations Research",
  year =         "1990",
  volume =       "25",
  pages =        "43--58",
}

@TechReport{sep:KamathKarmarkarRamakrishnanResende:91,
  author =       "A. P. Kamath and N. K. Karmarkar and K. G.
                 Ramakrishnan and M. G. C. Resende",
  title =        "A Continuous Approach to Inductive Inference",
  institution =  "AT \& T Bell Laboratories, Mathematical Sciences
                 Research Center",
  year =         "1991",
  address =      "Murray Hill, NJ",
  pages =        "27",
}

@Article{sep:Kamedo:74,
  author =       "M. Kamedo",
  title =        "Appendix {B}: Maximum Cardinality Matching Computer
                 Program",
  journal =      "Computing",
  year =         "1974",
  volume =       "12",
  pages =        "91--98",
}

@Article{sep:KamesamMeyer:84,
  author =       "P. V. Kamesam and R. R. Meyer",
  title =        "Multipoint Methods for separable nonlinear Networks",
  journal =      "Math. Programming Stud.",
  volume =       "22",
  year =         "1984",
  pages =        "185--205",
}

@Article{sep:Kannan:87,
  author =       "R. Kannan",
  title =        "Minkowski's Convex Body Theorem and Integer
                 Programming",
  journal =      "Math. Oper. Res.",
  year =         "1987",
  volume =       "12",
  pages =        "415--440",
}

@TechReport{sep:Kannan:91,
  author =       "R. Kannan",
  title =        "Solution of the Probenius Problem and its
                 Generalization",
  institution =  "Carnegie-Mellon University, Department of Computer
                 Science",
  year =         "1991",
  address =      "Pittsburg,PA",
  pages =        "36",
}

@TechReport{sep:KannanApplegate:,
  author =       "R. Kannan and D. Applegate",
  title =        "Sampling and Integration of Near Log-Concave
                 Functions",
  institution =  "?",
  year =         "19xx",
}

@Article{sep:KannanBachem:79,
  author =       "R. Kannan and A. Bachem",
  title =        "Polynomial algorithms for computing the Smith and
                 Hermite normal forms of an integer matrix",
  journal =      "SIAM J. Comput.",
  year =         "1979",
  volume =       "8",
  pages =        "499--507",
}

@InProceedings{sep:KannanKorte:84,
  author =       "R. Kannan and B. Korte",
  title =        "Approximative Combinatorial Algorithms",
  booktitle =    "Mathematical Programming, Proc. of the Intern.
                 Congress on Math. Progr., Rio de Janeiro 1981",
  year =         "1984",
  editor =       "R. W. Cottle and M. L. Kelmanson and B. Korte",
  pages =        "195--248",
  address =      "Amsterdam",
  publisher =    "North Holland",
}

@Article{sep:KannanLovasz:88,
  author =       "R. Kannan and L. Lov\'{a}sz",
  title =        "Covering Minima and Lattice-Point-Free Convex Bodies",
  journal =      "Ann. of Math. (2)",
  year =         "1988",
  volume =       "128",
  pages =        "577--602",
}

@Article{sep:KannanLovaszScarf:90,
  author =       "R. Kannan and L. Lov\`{a}sz and H. E. Scarf",
  title =        "The Shapes of Polyhedra",
  journal =      "Math. Oper. Res.",
  year =         "1990",
  volume =       "15",
  pages =        "364--380",
}

@TechReport{sep:KaoMeyer:84,
  author =       "C. Y Kao and R. R. Meyer",
  title =        "Secant Approximation Methods for Convex Optimization",
  institution =  "National Science Foundation Grant",
  year =         "1984",
  number =       "MCS74-20584 A02",
}

@Article{sep:Kaplan:74,
  author =       "S. Kaplan",
  title =        "Applications of Programs with Maximin Objective
                 Function to Problems of Optimal Resource Allocation",
  journal =      "Oper. Res.",
  year =         "1974",
  volume =       "22",
  pages =        "802--807",
}

@TechReport{sep:KarischPower:93,
  author =       "Stefan E. Karisch and Mike Power",
  title =        "A Simulation Study of Fishway Design: An Example of
                 Simulation in Environmental Problem Solving",
  institution =  "Institut f{\"u}r Mathematik",
  year =         "1993",
  number =       "253",
  address =      "Technische Universit{\"a}t Graz",
}

@TechReport{sep:KarischRendlWolkowicz:93,
  author =       "Stefan E. Karisch and Franz Rendl and Henry
                 Wolkowicz",
  title =        "Trust Regions and Relaxations for the Quadratic
                 Assignment Problem",
  institution =  "Institut f{\"u}r Mathematik",
  year =         "1993",
  number =       "262",
  address =      "Technische Universit{\"a}t Graz",
}

@Article{sep:Karmarkar:84a,
  author =       "N. Karmarkar",
  title =        "A New Polynomial-Time Algorithm for Linear
                 Programming",
  journal =      "Combinatorica",
  year =         "1984",
  volume =       "4",
  pages =        "373--395",
}

@TechReport{sep:Karmarkar:84b,
  author =       "N. Karmarkar",
  title =        "Some Comments on the Significance of the New
                 Polynomial-time Algorithm for Linear Programming",
  institution =  "AT \& \& Bell Laboratories",
  year =         "1984",
  address =      "Murray Hill, New Jersey",
  pages =        "6",
}

@InProceedings{sep:Karmarkar:90,
  author =       "N. Karmarkar",
  title =        "An Interior-Point Approach to {NP}-complete Problems",
  booktitle =    "Proc. Contemp. Math. 114",
  year =         "1990",
  pages =        "297--308",
}

@Article{sep:Karp:72,
  author =       "R. M. Karp",
  title =        "A Simple Derivation of Edmonds' Algorithm for Optimum
                 Branchings",
  journal =      "Networks",
  year =         "1972",
  volume =       "1",
  pages =        "265--272",
}

@Article{sep:Karp:75a,
  author =       "R. M. Karp",
  title =        "On the Computational Complexity of Combinatorial
                 Problems",
  journal =      "Networks",
  year =         "1975",
  volume =       "5",
  pages =        "45--68",
}

@Article{sep:Karp:75b,
  author =       "R. M. Karp",
  title =        "Two Special Cases of the Assignment Problem",
  journal =      "Discrete Math.",
  year =         "1975",
  volume =       "13",
  pages =        "129--142",
}

@InProceedings{sep:Karp:76,
  author =       "R. M. Karp",
  title =        "The Probabilistic Analysis of some Combinatorial
                 Search Algorithms",
  booktitle =    "Algorithms and Complexity, New Directions and Recent
                 Results",
  year =         "1976",
  editor =       "J. F. Traub",
  pages =        "1--20",
  address =      "New York",
  publisher =    "Academic Press",
}

@Article{sep:Karp:78,
  author =       "R. M. Karp",
  title =        "A Characterization of the Minimum Cycle Mean in a
                 Digraph",
  journal =      "Discrete Math.",
  year =         "1978",
  volume =       "23",
  pages =        "309--311",
}

@Article{sep:KarpMiranker68:,
  author =       "R. M. Karp and W. L. Miranker",
  title =        "Parallel Minimax Search for a Maximum",
  journal =      "J. Combin. Theory Ser. A",
  year =         "1968",
  volume =       "4",
  pages =        "19--35",
}

@Article{sep:KatohIbarakiMine:85,
  author =       "N. Katoh and T. Ibaraki and H. Mine",
  title =        "An Algorithm for the Equipollent Resource Allocation
                 Problem",
  journal =      "Math. Oper. Res.",
  year =         "1985",
  volume =       "10",
  pages =        "44--53",
}

@Article{sep:Kellerer:91,
  author =       "H. Kellerer",
  title =        "Bounds for Nonpreemptive Scheduling of Jobs with
                 Similar Processing Times on Multi-Processor Systems
                 Using the {LPT}-Algorithm",
  journal =      "Computing",
  year =         "1991",
  number =       "3",
  volume =       "46",
  pages =        "183--191",
}

@TechReport{sep:KellererRendlWoeginger:91,
  author =       "H. Kellerer and F. Rendl and G. Woeginger",
  title =        "Computing the Optimum Stock Size",
  institution =  "Techn. Univ. Graz, Institut f{\"u}r Mathematik",
  year =         "1991",
  number =       "202",
  address =      "Graz",
  pages =        "16",
}

@TechReport{sep:KellererTautenhahnWoeginger:92,
  author =       "H. Kellerer and T. Tautenhahn and G. Woeginger",
  title =        "Open Shop Scheduling eith Release Datew to Minimize
                 Maximum Lateness",
  institution =  "Techn. Univ. Graz, Institut f{\"u}r Mathematik",
  year =         "1992",
  number =       "208",
  address =      "Graz",
  pages =        "7",
}

@Article{sep:KellererWirsching:90,
  author =       "H. Kellerer and G. Wirsching",
  title =        "Prime Covers and Periodic Patterns",
  journal =      "Discrete Math.",
  year =         "1990",
  number =       "2",
  volume =       "85",
  pages =        "191--206",
}

@TechReport{sep:KellererWoeginger:90a,
  author =       "H. Kellerer and G. Woeginger",
  title =        "On the Euclidian two Paths Problems",
  institution =  "Techn. Univ. Graz, Institut f{\"u}r Mathematik",
  year =         "1990",
  number =       "166",
  address =      "Graz",
  pages =        "12",
}

@TechReport{sep:KellererWoeginger:90b,
  author =       "H. Kellerer and G. Woeginger",
  title =        "A Tight Bound for Three-Partitioning",
  institution =  "Techn. Univ. Graz, Institut f{\"u}r Mathematik",
  year =         "1990",
  number =       "170",
  address =      "Graz",
  pages =        "15",
}

@TechReport{sep:Kern:85a,
  author =       "W. Kern",
  title =        "On modular embeddings of geometric lattices (extended
                 abstract)",
  institution =  "Universit{\"a}t K{\"o}ln",
  year =         "1985",
  address =      "K{\"o}ln",
  pages =        "5",
}

@PhdThesis{sep:Kern:85b,
  author =       "W. Kern",
  title =        "Verbandstheoretische Dualit{\"a}t in kombinatorischen
                 Geometrien und orientierten Matroiden",
  school =       "Universit{\"a}t zu K{\"o}ln,
                 Mathem.-Naturwissenschaftl. Fakult{\"a}t",
  year =         "1985",
  address =      "K{\"o}ln",
  pages =        "57",
}

@Article{sep:Kern:86,
  author =       "W. Kern",
  title =        "An Efficient Algorithm for Solving a Special Class of
                 {LP}'s",
  journal =      "Computing",
  year =         "1986",
  volume =       "37",
  pages =        "219--226",
}

@Article{sep:KernWanka:90,
  author =       "W. Kern and A. Wanka",
  title =        "On a Problem about Covering Lines by Squares",
  journal =      "Discrete Comput. Geom.",
  year =         "1990",
  number =       "1",
  volume =       "5",
  pages =        "77--82",
}

@TechReport{sep:KhachiyanTodd:90,
  author =       "L. G. Khachiyan and M. J. Todd",
  title =        "On the Complexity of Approximating the Maximal
                 Inscribed Ellipsoid for a Polytope",
  institution =  "Cornell University, College of Engineering",
  year =         "1990",
  number =       "893",
  address =      "Ithaca, New York",
  pages =        "39",
}

@Article{sep:KindervaterLenstra:85,
  author =       "G. A. P. Kindervater and J. K. Lenstra",
  title =        "Parallel Algorithms in Combinatorial Optimization: An
                 Annotated Bibliography",
  journal =      "An. nat. Bibliogr., Summer Sch. Dublin",
  year =         "1985",
  pages =        "106--128",
}

@Article{sep:Kiwiel:89,
  author =       "K. C. Kiwiel",
  title =        "Survey of Bundle Methods for Nondifferentiable
                 Optimization",
  year =         "1989",
  journal =      "Math. Appl. Jan. Ser.6",
  volume =       "6",
  pages =        "263--282",
}

@Article{sep:Klee:80a,
  author =       "V. Klee",
  title =        "Combinatorial Optimization: What is the State of the
                 Art",
  journal =      "Math. Oper. Res.",
  year =         "1980",
  volume =       "5",
  pages =        "1--26",
}

@TechReport{sep:Klee:80b,
  author =       "V. Klee",
  title =        "A Note on Convex Cones and Constraint Qualifications
                 in Infinite-Dimensional Vector Spaces",
  institution =  "Rhein. Friedr.-Wilh.-Universit{\"a}t",
  year =         "1980",
  number =       "80157-OR",
  address =      "Bonn",
  pages =        "0.1--4.1",
}

@TechReport{sep:KleeMinty:71,
  author =       "V. Klee and G. J. Minty",
  title =        "How good is the Simplex Algorithm",
  institution =  "Indiana University",
  year =         "1971",
  number =       "GP-11878",
  address =      "Bloomington, Indiana",
  pages =        "159--186",
}

@InProceedings{sep:KleeWitzgall:68,
  author =       "V. Klee and C. Witzgall",
  title =        "Facets and Vertices of Transportation Polytopes",
  booktitle =    "Mathematics of the Decision Sciences, Part 1",
  year =         "1968",
  editor =       "G. B. Dantzig and A. F. Veinott",
  pages =        "257--282",
  address =      "Providence",
  publisher =    "American Mathematical Society",
}

@InProceedings{sep:Klein-Barmen:42,
  author =       "F. Klein-Barmen",
  title =        "{\"U}ber gewisse Halbverb{\"a}nde und kommutative
                 Semigruppen",
  booktitle =    "Mathematische Zeitung 48. Band",
  year =         "1942",
  pages =        "715--734",
  address =      "Berlin",
  publisher =    "Springer",
}

@InProceedings{sep:Klein-Barmen:49,
  author =       "F. Klein-Barmen",
  title =        "Ein Beitrag zur Theorie der linearen Holoide",
  booktitle =    "Mathematische Zeitung 51. Band",
  year =         "1949",
  pages =        "357--366",
  address =      "Berlin",
  publisher =    "Springer",
}

@Article{sep:KleindorferNewson:75,
  author =       "P. R. Kleindorfer and E. F. P. Newson",
  title =        "A Lower Bounding Structure for Lot-Size Scheduling
                 Problems",
  journal =      "Oper. Res.",
  year =         "1975",
  volume =       "23",
  pages =        "299",
}

@Article{sep:Kleinmichel:79,
  author =       "H. Kleinmichel",
  title =        "Approximationsverfahren in der Numerik der
                 nichtlinearen Optimierung",
  journal =      "?",
  year =         "1979",
  volume =       "1979/2-3",
  pages =        "54--71",
}

@Article{sep:KlempousKotowski:91,
  author =       "R. Klempous and J. Kotowski",
  title =        "Nonlinear transport network design",
  journal =      "J. Comput. Appl. Math.",
  year =         "1991",
  volume =       "35",
  pages =        "269--275",
}

@Article{sep:KlingmannNapierStutz:74,
  author =       "D. Klingman and A. Napier and J. Stutz",
  title =        "Netgen: {A} Program for Generating Large Scale
                 Capacitated Assignment, Transportation, and Minimum
                 Cost Flow Network Problems.",
  journal =      "Management Sci.",
  year =         "1974",
  volume =       "20",
  pages =        "814--821",
}

@TechReport{sep:KlinzRudofWoeginger:92,
  author =       "B. Klinz and R. Rudolf and G. J. Woeginger",
  title =        "Permuting Matrices to Avoid Forbidden Submatrices",
  institution =  "Inst. f. Mathematik, Techn. Universit{\"a}t Graz",
  year =         "1992",
  number =       "234",
  address =      "Graz",
  pages =        "19",
}

@TechReport{sep:KlinzRudolfWoeginger:92,
  author =       "B. Klinz and R. Rudolf and G. J. Woeginger",
  title =        "On the Recognition of Permuted Bottleneck Monge
                 Matrices",
  institution =  "Inst. f. Mathematik, Techn. Universit{\"a}t Graz",
  year =         "1992",
  number =       "241",
  address =      "Graz",
  pages =        "23",
}

@TechReport{sep:KlinzTuy:92,
  author =       "B. Klinz and H. Tuy",
  title =        "Minimum Concave-Cost Network Flow Problems with a
                 Single Nonlinear Arc Cost",
  institution =  "Inst. f. Mathematik, Techn. Universit{\"a}t Graz",
  year =         "1992",
  number =       "191",
  address =      "Graz",
  pages =        "22",
}

@InProceedings{sep:Knauer:79,
  author =       "B. Knauer",
  title =        "A simple algorithm for Maximum Matching of Graphs",
  booktitle =    "Numerische Methoden bei Graphentheoretischen und
                 Kombinatorischen Problemen, Band 2, Oberwolfach 1978",
  year =         "1979",
  editor =       "L. Collatz and G. Meinardus and W. Wetterling",
  pages =        "184--194",
  address =      "Basel",
  publisher =    "Birkh{\"a}user",
}

@Article{sep:Knuth:79,
  author =       "D. E. Knuth",
  title =        "Lexicographic Permutations with Restrictions",
  journal =      "Discrete Appl. Math.",
  year =         "1979",
  volume =       "1",
  pages =        "117--125",
}

@Article{sep:Koenig:87,
  author =       "H. K{\"o}nig",
  title =        "On the Abstract Hahn-Banach Theorem due to Rod\'{e}",
  year =         "1987",
  journal =      "Aequationes Math.",
  volume =       "34",
  pages =        "89--95",
}

@TechReport{sep:Koerner:85,
  author =       "F. K{\"o}rner",
  title =        "An efficient branch and bound algorithm for solving
                 nonlinear integer programming problems",
  institution =  "Technische Hochschule Karl-Marx-Stadt, Sektion
                 Mathematik",
  year =         "1985",
  address =      "Karl-Marx-Stadt - Chemnitz",
  pages =        "16",
}

@Article{sep:KoernerKorsnikov:88,
  author =       "F. K{\"o}rner and A. D. Korsnikov",
  title =        "Planar Three-Index Tarnsportation Problems with
                 Dominating Index",
  year =         "1988",
  journal =      "Z. Oper. Res. Ser. A-B",
  volume =       "32",
  number =       "1",
  pages =        "29--33",
}

@Article{sep:KojimaMizunoNoma:89,
  author =       "M. Kojima and S. Mizuno and T. Noma",
  title =        "A New Continuation Method for Complementarity Problems
                 with Uniform {P}-Functions",
  year =         "1989",
  journal =      "Math. Programming",
  volume =       "43",
  number =       "1",
  pages =        "107--113",
}

@Article{sep:KojimaMizunoNoma:90,
  author =       "M. Kojima and S. Mizuno and T. Noma",
  title =        "Limiting Behavior of Trajectories Generated by a
                 Continuation Method for Monotone Complementarity
                 Problems.",
  year =         "1990",
  journal =      "Math. Oper. Res.",
  volume =       "15",
  number =       "4",
  pages =        "662--675",
}

@Article{sep:KojimaMizunoYoshise:89,
  author =       "M. Kojima and S. Mizuno and A. Yoshise",
  title =        "A Primal-Dual Interior Point Algorithm for Linear
                 Programming",
  year =         "1989",
  journal =      "Progress in math. programming",
  pages =        "29--47",
}

@TechReport{sep:KojimaMizunoYushise:87,
  author =       "M. Kojima and S. Mizuno and A. Yoshise",
  title =        "Polynomial-Time Algorithm for a Class of Linear
                 Complementarity Problems",
  institution =  "Tokyo Institute of Technology Oh-Okayama, Dept. of
                 Information Sciences",
  year =         "1987",
  address =      "Tokyo",
  pages =        "43",
}

@TechReport{sep:KojimaTone:86,
  author =       "M. Kojima and K. Tone",
  title =        "An Efficient Implementation of Karmarkar's New {LP}
                 Algorithm",
  institution =  "Saitama University, Tokyo Institute of Technology",
  year =         "1986",
  number =       "B-180",
  address =      "Urawa",
  pages =        "61",
}

@TechReport{sep:Kolen:90,
  author =       "A. W. J. Kolen",
  title =        "Constructing Valid Inequalities for Combinatorial
                 Optimization Problems",
  institution =  "Limburg University",
  year =         "1990",
  address =      "Maastricht/Holland",
}

@Article{sep:Kolesar:67,
  author =       "P. J. Kolesar",
  title =        "A Branch and Bound Algorithm for the Knapsack
                 Problem",
  journal =      "Management Sci.",
  year =         "1967",
  volume =       "13",
  pages =        "723--735",
}

@Article{sep:Korbut:65,
  author =       "A. A. Korbut",
  title =        "Extremal Spaces",
  journal =      "Soviet Math. Dokl.",
  year =         "1965",
  volume =       "6",
  pages =        "1358--1361",
}

@Article{sep:KorsnikovBurkhard:88,
  author =       "A. D. Korsnikov and R. E. Burkard",
  title =        "On the Dimension of Polytopes of Planar Three-Index
                 Transportation Problems",
  year =         "1987",
  journal =      "Optimization",
  volume =       "20",
  number =       "1",
  pages =        "107--116",
}

@TechReport{sep:Kortanek:86a,
  author =       "K. O. Kortanek",
  title =        "Computational Infinite Programming for Engineering
                 Physics",
  institution =  "University of Iowa",
  year =         "1986",
  address =      "Iowa City",
  pages =        "6",
}

@TechReport{sep:Kortanek:86b,
  author =       "K. O. Kortanek",
  title =        "Computational Infinite Programming for Engineering
                 Physics",
  institution =  "Intern. Conference on Numerical Optimization and
                 Application",
  year =         "1986",
  address =      "Xi'an/China",
  pages =        "6",
}

@TechReport{sep:Kortanek:86c,
  author =       "K. O. Kortanek",
  title =        "New algorithms for linear programming based on the
                 opposite sign property",
  institution =  "University of Iowa, College of Business
                 Administration",
  year =         "1986",
  number =       "86-32",
  address =      "Iowa City",
  pages =        "22",
}

@TechReport{sep:Kortanek:87a,
  author =       "K. O. Kortanek",
  title =        "{LINDO} {PC} vs {LP} Scaling on an exponential {LP}
                 problem with 12 variables in 12 inequalities",
  institution =  "The University of Iowa, College of Business
                 Administration",
  year =         "1987",
  address =      "Iowa City",
  pages =        "5",
}

@Article{sep:Kortanek:87b,
  author =       "K. O. Kortanek and M. Shi",
  title =        "Convergence results and numerical experiments on a
                 linear programming hybrid algorithm",
  journal =      "European J. Oper. Res.",
  year =         "1987",
  volume =       "32",
  pages =        "47--61",
}

@Article{sep:KortanekJeroslow:71,
  author =       "K. O. Kortanek and R. Jeroslow",
  title =        "An Exposition on the Constructive Decomposition the
                 Group of Gomory Cuts and Gomory's Round-off Algorithm",
  journal =      "Cahiers Centre {'E}tudes Rech. Op{'e}r.",
  year =         "1971",
  volume =       "13",
  pages =        "63--84",
}

@InProceedings{sep:Korte:77,
  author =       "B. Korte",
  title =        "Eine Analyse der Greedy-Heuristik f{\"u}r
                 Unabh{\"a}ngigkeitssysteme",
  booktitle =    "Operations Research Verfahren XXV, Methods of
                 Operations Research",
  year =         "1977",
  editor =       "R. Henn and P. Kall and B. Korte and O. Krafft",
  pages =        "217--220",
  address =      "Meisenheim",
  publisher =    "Hain",
}

@Article{sep:Korte:79,
  author =       "B Korte",
  title =        "Approximative Algorithms for Discrete Optimization
                 Problems",
  journal =      "Ann. Disc. Math.",
  year =         "1979",
  volume =       "4",
  pages =        "85--120",
}

@TechReport{sep:Korte:81,
  author =       "B. Korte",
  title =        "List of Working Papers",
  institution =  "Rhein. Friedr.-Wilh.-Universit{\"a}t",
  year =         "1981",
  number =       "81201-OR",
  address =      "Bonn",
  pages =        "1--35",
}

@TechReport{sep:Korte:82,
  author =       "B. Korte",
  title =        "Annual Report 1981",
  institution =  "Rhein. Friedr.-Wilhl.-Universit{\"a}t",
  year =         "1982",
  address =      "Bonn",
  pages =        "1--48",
}

@TechReport{sep:Korte:84,
  author =       "B. Korte",
  title =        "Remarks on {"}The Algorithmic Way of Life is best{"}",
  institution =  "Rhein. Friedr.-Wilh.-Universit{\"a}t",
  year =         "1984",
  number =       "84342",
  address =      "Bonn",
  pages =        "1--3",
}

@Article{sep:Korte:85a,
  author =       "B. Korte",
  title =        "Basis Graphs of Greedoids and Two-Connectivity",
  journal =      "Math. Programming Stud.",
  year =         "1985",
  volume =       "24",
  pages =        "158--165",
}

@TechReport{sep:Korte:85b,
  author =       "N. Korte",
  title =        "Transitive orientation of graphs with side
                 constraints",
  institution =  "Hochschule Hildesheim, Fachbereich Informatik",
  year =         "1985",
  number =       "TR 85-2",
  address =      "Hildesheim",
  pages =        "18",
}

@TechReport{sep:Korte:86a,
  author =       "B. Korte",
  title =        "Jahresbericht 1985",
  institution =  "Institut f{\"u}r {\"O}konometrie und Operations
                 Research, Universit{\"a}t Berlin",
  year =         "1986",
  number =       "86407-OR",
  address =      "Bonn",
  pages =        "55",
}

@InProceedings{sep:Korte:86b,
  author =       "B. Korte",
  title =        "Kombinatorische Optimierung und Algorithmische
                 Prinzipien",
  booktitle =    "{\"O}konomische Prognose-, Entscheidungs- und
                 Gleichgewichtsmodelle",
  year =         "1986",
  editor =       "W. Krelle",
  pages =        "286--341",
  address =      "Weinheim",
  publisher =    "VCH Verlagsgeselslchaft",
}

@InProceedings{sep:KorteLovasz:81,
  author =       "B. Korte and L. Lov\'{a}sz",
  title =        "Mathematical Structures Underlying Greedy Algorithms",
  booktitle =    "Fundamentals of Computation Theory",
  year =         "1981",
  editor =       "F. Gecseg",
  pages =        "205--209",
  address =      "Berlin",
  publisher =    "Springer",
}

@Article{sep:KorteLovasz:83,
  author =       "B. Korte and L. Lov\'{a}sz",
  title =        "Structural Properties of Geedoids",
  year =         "1983",
  journal =      "Combinatorica",
  volume =       "3",
  pages =        "359--374",
}

@InProceedings{sep:KorteLovasz:84b,
  author =       "B. Korte and L. Lov\'{a}sz",
  title =        "Greedoids - {A} Structural Framework for the Greedy
                 Algorithm",
  booktitle =    "Progress in Combinatorial Optimization",
  year =         "1984",
  editor =       "W. R. Pulleyblank",
  pages =        "221--244",
  address =      "New York",
  publisher =    "Academic Press",
}

@InProceedings{sep:KorteLovasz:84c,
  author =       "B. Korte and L. Lov\'{a}zs",
  title =        "Shelling Structures, Convexity and a Happy End",
  booktitle =    "Graph Theory and Combinatorics. Proc. Cambridge Comb.
                 Conf. In Honour of P. Erd{\"o}s",
  year =         "1984",
  editor =       "B. Bollobas",
  pages =        "219--232",
  address =      "New York",
  publisher =    "Academic Press",
}

@Article{sep:KorteLovasz:85a,
  author =       "B. Korte and L. Lov\'{a}sz",
  title =        "A Note on Selectors and Greedoids",
  year =         "1985",
  journal =      "European J. Oper. Res.",
  volume =       "6",
  pages =        "59--67",
}

@Article{sep:KorteLovasz:85b,
  author =       "B. Korte and L. Lov\'{a}sz",
  title =        "A Note on Selectors and Greedoids",
  journal =      EURJC,
  year =         "1985",
  volume =       "6",
  pages =        "59--67",
}

@Article{sep:KorteLovasz:85c,
  author =       "B. Korte and L. Lov\'{a}sz",
  title =        "Relations between Subclasses of Greedoids",
  journal =      "Z. Oper. Res. Ser. A-B",
  year =         "1985",
  volume =       "29",
  pages =        "249--267",
}

@TechReport{sep:KorteLovasz:85d,
  author =       "B. Korte and L. Lov\'{a}sz",
  title =        "On Submodularity in Greedoids and a Counterexample",
  institution =  "Institut f{\"u}r {\"O}konometrie und Operations
                 Research, Universit{\"a}t Bonn",
  year =         "1985",
  number =       "85384-OR",
  address =      "Bonn",
  pages =        "14",
}

@Article{sep:KorteLovasz:85e,
  author =       "B. Korte and L. Lov\'{a}sz",
  title =        "Polymatroid Greedoids",
  journal =      "J. Combin. Theory Ser. B",
  year =         "1985",
  volume =       "38",
  number =       "Serie B",
  pages =        "41--72",
}

@InCollection{sep:KorteLovasz:85f,
  author =       "B. Korte and L. Lov\'{a}sz",
  title =        "Posets, Matroids, and Greedoids",
  booktitle =    "Matroid Theory",
  year =         "1985",
  editor =       "L. Lov\`{a}sz and A. Recski",
  pages =        "239--265",
  address =      "Amsterdam",
  publisher =    "North Holland",
}

@Article{sep:KorteLovasz:86,
  author =       "B. Korte and L. Lov\'{a}sz",
  title =        "Homomorphisms and Ramsey Properties of Antimatroids",
  journal =      "Discrete Appl. Math.",
  year =         "1986",
  volume =       "15",
  pages =        "283--290",
}

@Article{sep:KorteLovasz:89,
  author =       "B. Korte and L. Lov\'{a}sz",
  title =        "Polyhedral results for antimatroids",
  year =         "1989",
  journal =      "Combinatorial math ann. N.J. Sci. 555",
  volume =       "555",
  pages =        "283--295",
}

@InProceedings{sep:KorteSchrader:81a,
  author =       "B. Korte and R. Schrader",
  title =        "A Survey on Oracle Techniques",
  booktitle =    "Mathematical Foundations of Computer Science 1981",
  year =         "1981",
  editor =       "J. Gruska and M. Chytil",
  pages =        "61--77",
  address =      "Berlin",
  publisher =    "Springer",
}

@InProceedings{sep:KorteSchrader:81b,
  author =       "B. Korte and R. Schrader",
  title =        "On the Existence of Fast Approximation Schemes",
  booktitle =    "Nonlinear Programming 4",
  year =         "1981",
  editor =       "O. L. Mangasarian and R. R. Meyer and P. M. Robisond",
  pages =        "415--437",
  address =      "New York",
  publisher =    "Academic Press",
}

@InProceedings{sep:KorteSchrader:81c,
  author =       "B. Korte and R. Schrader",
  title =        "A Note on Convergence Proofs for
                 Shor-Khachian-Methods",
  booktitle =    "Optimization and Optimal Control, Oberwolfach 1980",
  year =         "1981",
  editor =       "A. V. Balakrishnan and M. Thoma",
  pages =        "51--57",
  address =      "Berlin",
  publisher =    "Springer-Verlag",
}

@TechReport{sep:Kosmol:84,
  author =       "P. Kosmol",
  title =        "Ein Algorithmus f{\"u}r Variationsungleichungen und
                 lineare Optimierungsaufgaben",
  institution =  "?",
  year =         "1984",
  address =      "Kiel",
  pages =        "10",
}

@TechReport{sep:Kovalev:79,
  author =       "M. M. Kovalev",
  title =        "Semimatroide",
  institution =  "TH Ilmenau, 24. Intern. Wiss. Kolloquium",
  year =         "1979",
  address =      "Ilmenau",
  pages =        "57--59",
}

@TechReport{sep:Kovalev:82,
  author =       "M. Kovalev",
  title =        "Supermatroids and convexity",
  institution =  "Techn. Hochschule Ilmenau, 27. Intern. Wiss. Koll.",
  year =         "1982",
  address =      "Ilmenau",
  pages =        "215--217",
}

@Article{sep:Kovalev:87,
  author =       "M. M. Kovalev",
  title =        "Matroidii w Diskretnoi Optimizazii",
  journal =      "?",
  year =         "1987",
  pages =        "221",
}

@Article{sep:Kovalev:90a,
  author =       "M. M. Kovalev",
  title =        "Modelirowanie i optimizazija w chemotechnischeskaom i
                 topoligischeskom projektcrowanii",
  journal =      "?",
  year =         "1990",
  pages =        "117",
}

@TechReport{sep:Kovalev:90b,
  author =       "M. M. Kovalev",
  title =        "Greedy algorithms on convex-ordered sets",
  institution =  "Rhein. Friedr.-Wilhelms-Univ., Inst. f{\"u}r
                 {\"O}konometrie und Opeations Research",
  year =         "1990",
  number =       "90640-OR",
  address =      "Bonn",
  pages =        "11",
}

@TechReport{sep:Kovalev:91,
  author =       "M. Kovalev",
  title =        "{M}\'{e}thode d'Ordre Partielle En Optimisation
                 Cimbinatoire",
  institution =  "Universit{\'{e}} due Qu\'{e}bec \'{a} Montr\'{e}al,
                 D\'{e}partement de math\'{e}matiques d'informatique",
  year =         "1991",
  number =       "166",
  address =      "Montr\'{e}al/Qu\'{e}bec",
  pages =        "26",
}

@Article{sep:KovalevGirlich:77,
  author =       "M. Kovalev and E. Girlich",
  title =        "Zum Problem der optimalen Standardisierung",
  journal =      "Math. Operationsforsch. Statist. Ser. Optim.",
  year =         "1977",
  volume =       "8",
  pages =        "89--103",
}

@TechReport{sep:KovalevKotov:92,
  author =       "M. M. Kovalev and V. M. Kotov",
  title =        "Evaluation of Gradient Algorithms for Knapsack and
                 Travelling Salesman Problems",
  institution =  "Belarusian State University, Department of
                 Mathematical Problems in CAD",
  year =         "1992",
  number =       "9203",
  address =      "Minsk, Belarus.",
  pages =        "39",
}

@Article{sep:KovalevMilanov:80,
  author =       "M. Kovalev and P. Milanov",
  title =        "Supermatroids and the Greedy Algorithms",
  journal =      "Dokl. Akad. Nauk BSSR",
  year =         "1980",
  volume =       "33",
  pages =        "1459--1462 p.",
}

@TechReport{sep:KovalevMoshchensky:92a,
  author =       "M. Kovalev and A. Moshchensky",
  title =        "Oracle Complexity of Convex and Submodular Function
                 Maximization",
  institution =  "Belarusian State University, Department of
                 Mathematical Problems in CAD",
  year =         "1992",
  number =       "9201",
  address =      "Minsk, Belarus.",
  pages =        "21",
}

@TechReport{sep:KovalevMoshchensky:92b,
  author =       "M. Kovalev and A. Moshchensky",
  title =        "Optimal Algorithms for Submodular Function
                 Maximization",
  institution =  "University of Minsk, Faculty of Applied Mathematics
                 and Informatics",
  year =         "1992",
  address =      "Minsk,Belarus",
  pages =        "11",
}

@TechReport{sep:KovalevPisaruk:89,
  author =       "M. M. Kovalev and N. N. Pisaruk",
  title =        "Dekompositionsmethode zur Minimierung Submodularer
                 Funktionen",
  institution =  "Techn. Hochschule Ilmenau, Tagung Mathematische
                 Optimierung - Theorie und Anwendungen - Eisenach",
  year =         "1989",
  address =      "Ilmenau",
  pages =        "131--136",
}

@TechReport{sep:KovalevZaporozhets:92,
  author =       "M. Kovalev and A. Zaporozhets",
  title =        "The Alternating Sequences Polytope",
  institution =  "Belarusian State University, Department of
                 Mathematical Problems in CAD",
  year =         "1992",
  number =       "9204",
  address =      "Minsk, Belarus.",
  pages =        "9",
}

@Article{sep:KowaljovGirlich:76,
  author =       "M. M. Kowaljov and E. Girlich",
  title =        "{\"U}ber einige Aufgaben der optimalen
                 Standardisierung",
  journal =      "die Technik",
  year =         "1976",
  volume =       "31",
  number =       "9",
  pages =        "572--574",
}

@Article{sep:KrarupPruzan:81,
  author =       "J. Krarup and P. M. Pruzan",
  title =        "Reducibility of minimax to minimum 0-1 programming
                 problems",
  journal =      "European J. Oper. Res.",
  year =         "1981",
  volume =       "6",
  pages =        "125--132",
}

@TechReport{sep:KrarupWalukiewicz:78,
  author =       "J. Krarup and S. Walukiewicz",
  title =        "Proceedings of the Polish-Danish Mathematical
                 Programming Seminar; Part One",
  institution =  "Polska Akademia Nauk, Instytut Badan Systemowych",
  year =         "1978",
  number =       "26",
  address =      "Warszawa",
  pages =        "151",
}

@InProceedings{sep:KrarupWalukiewicz:80,
  author =       "J. Krarup and S. Walukiewicz",
  title =        "Relations among integer Programs",
  booktitle =    "Optimization Techniques, Part II",
  year =         "1980",
  editor =       "K. Iracki and K. Malanowski and P. Walukiewicz",
  pages =        "199--210",
  address =      "Berlin",
  publisher =    "Springer",
}

@Article{sep:Krasdow:86,
  author =       "M. K. Krasdow",
  title =        "On a structure of a set of feasible solutions for the
                 transportation problem with arc capacities",
  journal =      "EMM",
  year =         "1986",
  volume =       "22",
  pages =        "524--531",
}

@TechReport{sep:KravchenkoSotskovWerner:93,
  author =       "Svetlana A. Kravchenko and Yuri N. Sotskov and Frank
                 Werner",
  title =        "Optimal Schedules with Infinitely Large Stability
                 Radius",
  institution =  "Institute of Engineering Cybernetics",
  year =         "1993",
  annote =       "eingereicht in Optimization",
  address =      "Byelorussian Academy of Sciences, Minsk/Belarus",
}

@TechReport{sep:Krogdahl:74,
  author =       "S. Krogdahl",
  title =        "A Combinatorial Base for Some Optimal Matroid
                 Intersection Algorithms",
  institution =  "Stanford Univ.",
  year =         "1974",
  number =       "STAN-CS-74-468",
  address =      "Stanford",
  pages =        "1--25",
}

@TechReport{sep:Krogdahl:76a,
  author =       "S. Krogdahl",
  title =        "Matroideinf{\"u}hrung",
  institution =  "Stanford University.",
  year =         "1976",
  address =      "Stanford",
}

@TechReport{sep:Krogdahl:76b,
  author =       "S. Krogdahl",
  title =        "Intersection Algorithmen",
  institution =  "Stanford University.",
  year =         "1976",
  address =      "Stanford",
}

@TechReport{sep:Krogdahl:76c,
  author =       "S. Krogdahl",
  title =        "Beweise",
  institution =  "Stanford University.",
  year =         "1976",
  address =      "Stanford",
}

@TechReport{sep:Krogdahl:76d,
  author =       "S. Krogdahl",
  title =        "A Combinatorial Proof for Lawler's Matroid
                 Intersection Algorithm",
  institution =  "Stanford Univ.",
  year =         "1976",
  number =       "Univ.",
  address =      "Stanford",
  pages =        "33",
}

@Article{sep:Krogdahl:77,
  author =       "S. Krogdahl",
  title =        "The Dependence Graph for Bases in Matroids",
  journal =      "Discrete Math.",
  year =         "1977",
  volume =       "19",
  pages =        "47--60",
}

@TechReport{sep:KruegerScheutzowBestePetersen:85,
  author =       "W. Kr{\"u}ger and M. Scheutzow and A. Beste and J.
                 Petersen",
  title =        "Markov- und Rainflow-Rekonstruktionen Stochastischer
                 Beanspruchungszeitfunktionen",
  institution =  "Universit{\"a}t Kaiserslautern",
  year =         "1985",
  number =       "9",
  address =      "Kaiserslautern",
  pages =        "77",
}

@Article{sep:KurcyuczMajchrzak:79,
  author =       "S. Kurcyucz and J. Majchrzak",
  title =        "Morrison-type Algorithms for Constrained Optimization.
                 Part {I}",
  journal =      "Control Cybernet.",
  year =         "1979",
  volume =       "8",
  pages =        "131--140",
}

@Article{sep:KurcyuszMajchrzak:79,
  author =       "S. Kurcyusz and J. Majchrzak",
  title =        "Morrison-Type Algorithms for Constrained Optimization.
                 Part {II}",
  journal =      "Control Cybernet.",
  year =         "1979",
  volume =       "8",
  pages =        "229--240",
}

@Article{sep:LabetoulleLawlerLenstra:84,
  author =       "J. Labetoulle and E..L. Lawler and J. K. Lenstra and
                 A. H. G. Rinnooy Kan",
  title =        "Preemptive Scheduling of Uniform Machines Subject to
                 Release Dates",
  journal =      "Progress in Combinatorial Optimization",
  year =         "1984",
  pages =        "245--261",
}

@Article{sep:Lagarias:90,
  author =       "J. C. Lagarias",
  title =        "The Nonlinear Geometry of Linear Programming. {III}.
                 Projective Legendre Transform Coordinates and Hilbert
                 Geometry",
  journal =      "Trans. Amer. Math. Soc.",
  year =         "1990",
  volume =       "320",
  number =       "1",
  pages =        "193--225",
}

@TechReport{sep:Lageweg:73,
  author =       "B. J. Lageweg",
  title =        "An Algorithm for a maximum weighted common partial
                 Transversal",
  institution =  "Stichting Mathematisch Centrum",
  year =         "1973",
  number =       "BW25/73",
  address =      "Amsterdam",
  pages =        "1--28",
}

@Article{sep:Lawler:64,
  author =       "E. L. Lawler",
  title =        "On Scheduling Problems with Deferral Costs",
  journal =      "Management Sci.",
  year =         "1964",
  volume =       "11",
  pages =        "280--288",
}

@Article{sep:Lawler:71,
  author =       "E. L. Lawler",
  title =        "A Solvable Case of the Traveling Salesman Problem",
  journal =      "Math. Programming",
  year =         "1971",
  volume =       "1",
  pages =        "267--269",
}

@Article{sep:Lawler:73,
  author =       "E. L. Lawler",
  title =        "Optimal Sequencing of a single machine subject to
                 precedence contraints",
  journal =      "Management Sci.",
  year =         "1973",
  volume =       "19",
  pages =        "542--546",
}

@Article{sep:Lawler:75,
  author =       "E. L. Lawler",
  title =        "Matroid intersection Algorithms",
  journal =      "Math. Programming",
  year =         "1975",
  volume =       "9",
  pages =        "31--56",
}

@Article{sep:Lawler:78,
  author =       "E. L. Lawler",
  title =        "Sequencing jobs to minimize total weighted completion
                 time subject to precedence constraints",
  journal =      "Ann. Disc. Math.",
  year =         "1978",
  volume =       "2",
  pages =        "75--90",
}

@InProceedings{sep:Lawler:81,
  author =       "E. L. Lawler",
  title =        "An Introduction to polynomial network flows",
  booktitle =    "Analysis and Design of Algorithms in Combinatorial
                 Optimization",
  year =         "1981",
  editor =       "G. Ausiello and M. Lucertini",
  publisher =    "Springer",
  address =      "New York",
}

@TechReport{sep:Lawler:82,
  author =       "E. L. Lawler",
  title =        "Generalizations of the polymatroidal network flow
                 model",
  institution =  "Stichting Mathematisch Centrum",
  year =         "1982",
  number =       "BW 158/82",
  address =      "Amsterdam",
  pages =        "1--18",
}

@TechReport{sep:LawlerLenstraShmoys:91,
  author =       "E. L. Lawler and J. K. Lenstra and Shmoys D. B.
                 Rinnooy Kan",
  title =        "Sequencing and Scheduling: Algorithms and Complexity",
  institution =  "Centre for Mathematics and Computer Science.",
  year =         "1991",
  number =       "BS-R8909",
  address =      "Amsterdam",
}

@Article{sep:LawlerMartel:82a,
  author =       "E. L. Lawler and C. U. Martel",
  title =        "Flow Network formulations of polymatroid optimization
                 problems",
  journal =      "Ann. Disc. Math.",
  year =         "1982",
  volume =       "16",
  pages =        "189--200",
}

@InProceedings{sep:LawlerMartel:82b,
  author =       "E. L. Lawler and C. U. Martel",
  title =        "Flow Network Formulations of Polymatroid Optimization
                 Problems",
  booktitle =    "Bonn Workshop on Combinatorial Optimization",
  year =         "1982",
  editor =       "A. Bachem and M. Gr{\"o}tschel and B. Korte",
  pages =        "189--201",
  organization = "Annals of Discrete Mathematics, 16",
  address =      "Amsterdam",
  publisher =    "North Holland",
}

@Article{sep:LawlerMartel:82c,
  author =       "E. L Lawler and C. U. Martel",
  title =        "Computing Maximal {"}Polymatroidal{"} Network Flows",
  journal =      "Math. Oper. Res.",
  year =         "1982",
  volume =       "7",
  pages =        "334--347",
}

@Article{sep:LawlerMartel:86,
  author =       "E. L. Lawler and C. U. Martel",
  title =        "Polymatroidal Flows with Lower Bounds",
  journal =      "Discrete Appl. Math.",
  volume =       "15",
  year =         "1986",
  pages =        "291--313",
}

@Article{sep:Leclerc:89a,
  author =       "M. Leclerc",
  title =        "Slices of the Matching Polytopes",
  journal =      "Mitteilungen des Math. Seminar Giessen",
  volume =       "192",
  year =         "1989",
  pages =        "85--88",
}

@Article{sep:Leclerc:89b,
  author =       "M. Leclerc",
  title =        "Optimizing over a Slice of the Bipartite Matching
                 Polytope",
  journal =      "Discrete Math.",
  year =         "1989",
  volume =       "73",
  number =       "1/2",
  pages =        "159--162",
}

@Article{sep:LeclercRendl:90,
  author =       "M. Leclerc and F. Rendl",
  title =        "{K}-Best Constrained Bases of a Matroid",
  journal =      "Z. Oper. Res. Ser. A-B",
  year =         "1990",
  number =       "2",
  volume =       "34",
  pages =        "13",
}

@Article{sep:LegendreMinoux:77,
  author =       "J. P. Legendre and M. Minoux",
  title =        "Une application de la notion de dualit\'{e} en
                 programmation en nombres entiers: {S}\'{e}lection et
                 affectation optimales d'une flotte d'avions",
  journal =      "RAIRO Rech. Op{'e}r.",
  year =         "1977",
  volume =       "11",
  pages =        "201--222",
}

@Article{sep:Lehmann:77,
  author =       "D. J. Lehmann",
  title =        "Algebraic structures for transitive closure",
  journal =      "Theoret. Comput. Sci.",
  year =         "1977",
  volume =       "4",
  pages =        "59--76",
}

@TechReport{sep:Lehn:91,
  author =       "J. Lehn",
  title =        "Special methods for pseudoradom number generation",
  institution =  "Technische Hochschule Darmstadt, Fachbereich
                 Mathematik",
  year =         "1991",
  number =       "1372",
  address =      "Darmstadt",
  pages =        "7",
}

@InCollection{sep:Lengauer:91,
  author =       "T. Lengauer and D. Theune",
  title =        "Unstructured Path Problems and the Making of
                 Semirings",
  booktitle =    "Algorithms and Data Structures",
  publisher =    "Springer",
  year =         "1991",
  volume =       "519",
  editor =       "D. Frank et. al.",
  pages =        "189--200",
  note =         "Preliminary Version",
}

@TechReport{sep:Lenstra:81,
  author =       "H. W. Lenstra",
  title =        "Integer Programming with a Fixed Number of Variables",
  institution =  "University of Amsterdam",
  year =         "1981",
  number =       "81-03",
  address =      "Amsterdam",
  pages =        "20",
}

@TechReport{sep:LenstraLenstraRinnooyKanWansbeek:81,
  author =       "A. K. Lenstra and J. K. Lenstra and A. H. G. Rinnooy
                 Kan and T. J. Wansbeek",
  title =        "Two lines least squares",
  institution =  "Stichting Mathematisch Centrum",
  year =         "1981",
  number =       "134/81",
  address =      "Amsterdam",
  pages =        "14",
}

@Article{sep:LenstraRinnoo,
  author =       "J. K. Lenstra and A. H. G. Rinnooy Kan",
  title =        "Some simple applications of the travelling salesman
                 problem",
  journal =      "Opl Res. Q.",
  year =         "1975",
  volume =       "26",
  pages =        "717--733",
}

@Article{sep:Leontev:76,
  author =       "V. K. Leont\'ev",
  title =        "Stability in Combinatorial Choice Problems",
  journal =      "Soviet Math. Dokl.",
  volume =       "17",
  number =       "3",
  pages =        "635--8",
  year =         "1976",
}

@Article{sep:Leontev:81,
  author =       "V. K. Leont\'ev",
  title =        "On Relations of Trajectory Lengths in Combinatorial
                 Choice Problems",
  journal =      "Soviet Math. Dokl.",
  volume =       "23",
  number =       "3",
  pages =        "629--632",
  year =         "1981",
}

@Article{sep:Leue:72,
  author =       "O. Leue",
  title =        "Methoden zur {L}{\"o}sung dreidimensionaler
                 Zuordnungsprobleme",
  journal =      "Angewandte Informatik",
  year =         "1972",
  volume =       "14",
  pages =        "154--162",
}

@InProceedings{sep:Libura81:,
  author =       "M. Libura",
  title =        "Integer Programming Problems with Inexact Objective
                 Function",
  booktitle =    "Methods of Operations Research 40",
  year =         "1981",
  editor =       "R. R. Burkard and T. Ellinger",
  pages =        "371--374",
  address =      "Koenigstein",
  publisher =    "Anton Hain Meisenheim",
}

@TechReport{sep:Libura:,
  author =       "M. Libura",
  title =        "On Sensitivity Analysis for Minimum Weight Base of
                 Matroid",
  institution =  "Polish Academy of Sciences, Systems Research
                 Institute",
  year =         "19xx",
  note =         "submitted to OR Letters",
  address =      "Warszawa",
  pages =        "10",
}

@Article{sep:Libura:91a,
  author =       "M. Libura",
  title =        "Sensitivity Analysis for Minimum Hamiltonian Path and
                 Traveling Salesman Problems",
  journal =      "Discrete Appl. Math.",
  volume =       "30",
  year =         "1991",
  number =       "2/3",
  pages =        "197--211",
}

@Article{sep:Libura:91b,
  author =       "M. Libura",
  title =        "Sensitivity analysis for minimum Hamiltonian path and
                 traveling salesman problems",
  journal =      "Discrete Appl. Math.",
  year =         "1991",
  volume =       "30",
  pages =        "197--211",
}

@Article{sep:Libura:91c,
  author =       "M. Libura",
  title =        "Sensitivity analysis for minimum weight base of
                 matroid",
  journal =      "Control Cybernet.",
  year =         "1991",
  volume =       "20",
  pages =        "7--24",
}

@TechReport{sep:Libura:92,
  author =       "M. Libura",
  title =        "On combinatorial Optimization Problems in
                 Brachyradiotherapy Planning",
  institution =  "Polish Academy of Sciences, Systems Research
                 Institute",
  year =         "1992",
  address =      "Warszawa",
  pages =        "13",
}

@Article{sep:Lin:94,
  author =       "Yixun Lin",
  title =        "An Ordered Independence System and its Applications to
                 Scheduling Problems",
  journal =      "European Journal of Operational Research",
  volume =       "74",
  pages =        "188--195",
  year =         "1994",
}

@Article{sep:LinKernighan:73,
  author =       "S. Lin and B. W. Kernighan",
  title =        "An Effective Heuristic Algorithm for the
                 Traveling-Salesman Problem",
  journal =      "Oper. Res.",
  year =         "1973",
  volume =       "21",
  pages =        "498--516",
}

@TechReport{sep:Lindberg:81,
  author =       "P. O. Lindberg",
  title =        "A Relacational Framework for Duality",
  institution =  "Dep. of Mathematics, Royal Institute of Technology",
  year =         "1981",
  number =       "TRITA-MAT 12",
  address =      "Stockholm",
  pages =        "14",
}

@Article{sep:LittleRendl:89,
  author =       "C. H. C. Little and F. Rendl",
  title =        "An Algorithm for the Ear Decomposition of a 1-Factor
                 Covered Graph",
  journal =      "J. Austral. Math. Soc. Ser. A",
  volume =       "A 46",
  year =         "1989",
  number =       "2",
  pages =        "296--301",
}

@Article{sep:LittleRendl:91,
  author =       "C. H. C. Little and F. Rendl",
  title =        "Operations Preserving the Pfaffian Property of a
                 Graph",
  journal =      "J. Austral. Math. Soc. Ser. A",
  year =         "1991",
  volume =       "A 50",
  number =       "2",
  pages =        "248--257",
}

@Article{sep:Litvak:83,
  author =       "E. I. Litvak",
  title =        "A Generalized Theorem on Negative Cycles and Estimates
                 of the Quality of Flow Transport in a Network",
  journal =      "Soviet Math. Dokl.",
  year =         "1983",
  volume =       "27",
  pages =        "369--371",
}

@TechReport{sep:Loebl:91,
  author =       "M. Loebl",
  title =        "Maximal Cuts",
  institution =  "Universit{\"a}t Bielefeld",
  year =         "1991",
  number =       "91--065",
  address =      "Bielefeld",
}

@Article{sep:Lommatzsch:66,
  author =       "K. Lommatzsch",
  title =        "Ein Gradienten- und Schwerpunktverfahren der linearen
                 und nichtlinearen Optimierung",
  journal =      "SVAZEK",
  year =         "1966",
  volume =       "11",
  pages =        "303--313",
}

@TechReport{sep:Lootsma:89,
  author =       "F. A. Lootsma",
  title =        "Optimization with Multiple Objectives",
  journal =      "Proc. Math. Appl. Jap. Ser.6",
  year =         "1989",
  pages =        "333--364",
}

@InProceedings{sep:Lovasz:77,
  author =       "L. Lov\`{a}sz",
  title =        "Flats in Matroid and Geometric Graphs",
  booktitle =    "Combinatorial Surveys",
  year =         "1977",
  editor =       "P. J. Cameron",
  pages =        "45--86",
  address =      "London",
  publisher =    "Academic Press",
}

@TechReport{sep:Lovasz:79a,
  author =       "L. Lov\`{a}cz",
  title =        "Polymatroid Matchings and some Applications",
  institution =  "Univ. of Waterloo, Dept. of Combinatorics and
                 Optimization",
  year =         "1979",
  number =       "CORR 79-12",
  address =      "Waterloo",
  pages =        "43",
}

@InProceedings{sep:Lovasz:79b,
  author =       "L. Lov\`{a}sz",
  title =        "On Determinants, Matchings, and Random Algorithms",
  booktitle =    "Fundamentals of Computation Theory FCT '79",
  year =         "1979",
  editor =       "L. Budach",
  pages =        "565--574",
  address =      "Berlin",
  publisher =    "Akademie-Verlag",
}

@TechReport{sep:Lovasz:8x,
  author =       "L. Lov\`{a}cz",
  title =        "On the proof of von der Waerdens conjecture by
                 Yegorichev",
  institution =  "?",
  year =         "198x",
  pages =        "10",
}

@TechReport{sep:Lovasz:80,
  author =       "L. Lov\`{a}sz",
  title =        "The matroid parity problem",
  institution =  "Univ. of Szeged, Bolyai Institute",
  year =         "1980",
  number =       "Paper",
  address =      "Szeged",
  pages =        "25",
}

@TechReport{sep:Lovasz:81,
  author =       "L. Lov\`{a}sz",
  title =        "Bounding the Independence Number of a Graph",
  institution =  "Universit{\"a}t Bonn, Inst. f. OR",
  year =         "1981",
  number =       "81175-OR",
  address =      "Bonn",
  pages =        "16",
}

@InProceedings{sep:Lovasz:86,
  author =       "L. Lov\`{a}sz",
  title =        "Algorithmic aspects on some notions in classical
                 mathematics",
  pages =        "51--63",
  booktitle =    "CWI Monographie 1; Mathematics and Computer Science,
                 Proc. CWI Symp., Amsterdam/Neth. 1983",
  year =         "1986",
}

@TechReport{sep:Lovasz:89,
  author =       "L. Lov\`{a}sz",
  title =        "Geometry of Numbers and Integer Programming",
  journal =      "Proc. Math. Appl. Jap. Ser. 6",
  year =         "1989",
  pages =        "177--201",
}

@TechReport{sep:Lovasz:90,
  author =       "L. Lov\`{a}sz",
  title =        "Communication complexity: {A} survey",
  journal =      "Algorithms Comb. 9",
  year =         "1990",
  pages =        "135--265",
}

@Article{sep:Luenberger:68,
  author =       "D. G. Luenberger",
  title =        "Quasi-Convex Programming",
  journal =      "SIAM J. Appl. Math.",
  year =         "1968",
  volume =       "16",
  pages =        "1090--1095",
}

@Article{sep:Lugowski:69,
  author =       "H. Lugowski",
  title =        "{\"U}ber gewisse genordnete Halbmoduln mit negativen
                 Elementen",
  journal =      "Publ. Math. Debrecen",
  year =         "1969",
  volume =       "11",
  pages =        "23--41",
}

@Article{sep:Lunts:50,
  author =       "A. G. Lunts",
  title =        "The application of Boolean matrix algebra to the
                 analysis and synthesis of relay contact networks",
  journal =      "Dokl. Akad. Nauk SSSR",
  year =         "1950",
  volume =       "70",
  pages =        "421--423 p.",
}

@TechReport{sep:Lustig:85,
  author =       "I. J. Lustig",
  title =        "A Practical Approach to Karmarkar's Algorithm",
  institution =  "Stanford University, Dep. of OR",
  year =         "1985",
  number =       "Sol 85-5",
  address =      "Stanford",
  pages =        "20",
}

@Article{sep:Lustig:90,
  author =       "I. J. Lustig",
  title =        "Feasibility Issues in an Interior Point Method for
                 Linear Programming",
  journal =      "Math. Programming",
  year =         "1990",
  number =       "2",
  volume =       "Ser.A 49",
  pages =        "145--162",
}

@TechReport{sep:LustigMarstenShanno:92,
  author =       "I. J. Lustig and R. E. Marsten and D. F. Shanno",
  title =        "Interior Point Methods for Linear Programming:
                 Computational State of the Art",
  institution =  "Princeton University",
  year =         "1992",
  number =       "SOR 92-17",
  address =      "Princeton, NJ",
}

@Article{sep:LustigMarstenShanno:94,
  author =       "Irvin J. Lustig and Roy E. Marsten and David F.
                 Shanno",
  title =        "Computational Experience with a globally Convergent
                 primal-dual Predictor-Corrector Algorithm for linear
                 Programming",
  journal =      "Mathematical Programming",
  volume =       "66",
  pages =        "123--135",
  year =         "1994",
}

@Article{sep:LuttonBonomi:8,
  author =       "J. L. Lutton and E. Bonomi",
  title =        "An Efficient Non-Deterministic Heuristic for the
                 Minimum Weighted Perfect Euclidean Matching Problem:
                 The Metropolis Procedure",
  journal =      "Annals of Operations Research",
  year =         "198x",
  pages =        "23",
}

@TechReport{sep:Maas:85,
  author =       "Ch. Maas",
  title =        "Transportation Graphs with Optimal Spectra",
  institution =  "Universit{\"a}t Hamburg, Institut f{\"u}r Angewandte
                 Mathematik",
  year =         "1985",
  address =      "Hamburg",
  pages =        "2",
}

@InProceedings{sep:Madsen:80,
  author =       "O. B. G. Madsen",
  title =        "A Cutting Sequencing Algorithm",
  booktitle =    "Optimization Techniques, Part II",
  year =         "1980",
  editor =       "K. Iracki and K. Malanowski and P. Walukiewicz",
  pages =        "388--396",
  address =      "Lecture Notes in Control and Informations Sciences,
                 23, Berlin",
  publisher =    "Springer",
}

@TechReport{sep:MadsenKaegard:81,
  author =       "O. B. G. Madsen and K. E. Kaegard",
  title =        "An Application of Travelling Salesman Routines to
                 Solve Pattern Allocation Problems",
  institution =  "Technical Univ. of Denmark, Inst. of Mathematical
                 Statistics and OR",
  year =         "1981",
  number =       "6/1981",
  address =      "Lyngby",
  pages =        "10",
}

@TechReport{sep:MagazineNemhauserTrotter:,
  author =       "M. J. Magazine and G. L. Nemhauser and L. E. Trotter
                 Jr.",
  title =        "When the Informatik",
  institution =  "?",
  year =         "xxxx",
  pages =        "19",
}

@Article{sep:MagazineNemhauserTrotter:75,
  author =       "M. J. Magazine and G. L. Nemhauser and L. E. Trotter
                 Jr.",
  title =        "When the Greedy Solution Solves a Class of Knapsack
                 Problems",
  journal =      "Oper. Res.",
  year =         "1975",
  volume =       "23",
  pages =        "207--217",
}

@TechReport{sep:MagnatiShapiroWagner:75,
  author =       "T. L. Magnanti and J. F. Shapiro and M. H. Wagner",
  title =        "Generalized linear Programming Solves the Dual",
  institution =  "Massachusetts Institute of Technology",
  year =         "1975",
  pages =        "1195--1203",
  address =      "Massachusetts",
}

@TechReport{sep:Mahjoub:88,
  author =       "A. R. Mahjoub",
  title =        "Two Edge Connected Spanning Subgraphs and Polyhedra",
  institution =  "Universit{\"a}t Bonn, Institut f{\"u}r {\"O}konometrie
                 und OR",
  year =         "1988",
  number =       "88520-OR",
  address =      "Bonn",
  pages =        "22",
}

@TechReport{sep:Mahr:79,
  author =       "B. Mahr",
  title =        "Algebraische Komplexit{\"a}t des allgemeinen
                 Wegeproblems in Graphen",
  institution =  "Techn. Univ., Inst. f. Software und Theoretische
                 Informatik",
  year =         "1979",
  number =       "79-14",
  address =      "Berlin",
  pages =        "133",
}

@TechReport{sep:Mahr:80,
  author =       "B. Mahr",
  title =        "A Birds Eye View to Path Problems",
  institution =  "Techn. Univ., Inst. f. Software u. Theoret.
                 Informatik",
  year =         "1980",
  number =       "80-19",
  address =      "Berlin",
  pages =        "19",
}

@Article{sep:Mahr:82a,
  author =       "B. Mahr",
  title =        "Algebraic Complexity of Path Problems",
  journal =      "RAIRO Inform. Th{'e}or.",
  year =         "1982",
  volume =       "16",
  pages =        "263--292",
}

@TechReport{sep:Mahr:82b,
  author =       "B. Mahr",
  title =        "Semirings an Transitive Closure",
  institution =  "Techn. Univ., Inst. f. Software und Theoret.
                 Informatik",
  year =         "1982",
  number =       "82-5",
  address =      "Berlin",
  pages =        "84",
}

@Article{sep:Mahr:84,
  author =       "B. Mahr",
  title =        "Iteration and Summability in Semirings",
  journal =      "Ann. Disc. Math.",
  volume =       "19",
  year =         "1984",
  pages =        "229--256",
}

@Article{sep:Mangasarian:68,
  author =       "O. L. Mangasarian",
  title =        "Characterizations of Real Matrices of Montone Kind",
  journal =      "SIAM Rev.",
  year =         "1968",
  volume =       "20",
  pages =        "439--441",
}

@Article{sep:Manne:58,
  author =       "A. S. Manne",
  title =        "A Target-Assignment Problem",
  journal =      "Oper. Res.",
  year =         "1958",
  volume =       "6",
  pages =        "346--351",
}

@TechReport{sep:Maros:90,
  author =       "I. Maros",
  title =        "On Pricing in the Primal Network Simplex Algorithm",
  institution =  "Hungarian Academy of Sciences, Computer and Automation
                 Institute",
  year =         "1990",
  number =       "39",
  address =      "Budapest",
  pages =        "12",
}

@Article{sep:Martel:82,
  author =       "C. Martel",
  title =        "Preemptive Scheduling with Release Times, Deadlines,
                 and Due Times",
  journal =      "J. Assoc. Comput. Mach.",
  year =         "1982",
  volume =       "29",
  pages =        "812--829",
}

@InProceedings{sep:Martel:83,
  author =       "C. Martel",
  title =        "Scheduling Multiple Processors with Memory
                 Constraints",
  booktitle =    "Parallel and Large-Scale Computers: Performance,
                 Architecture, Applications",
  year =         "1983",
  editor =       "M. Rischitzka",
  pages =        "67--75",
  publisher =    "IMACS/North-Holland Publ. Comp",
}

@Article{sep:Martel:89,
  author =       "C. Martel",
  title =        "A Comparison of Phase and Non-Phase Network Flow
                 Algorithms",
  journal =      "Networks",
  year =         "1989",
  volume =       "19",
  pages =        "691--705",
}

@Article{sep:Martelli:76,
  author =       "A. Martelli",
  title =        "A Gaussian Elimination Algorithm for the Enumeration
                 of Cut Sets in a Graph",
  journal =      "J. Assoc. Comput. Mach.",
  year =         "1976",
  volume =       "23",
  pages =        "58--73",
}

@Article{sep:Matthews:77,
  author =       "L. R. Matthews",
  title =        "Bicircular Matroids",
  journal =      "Quart. J. Math. Oxford Ser. (2)",
  year =         "1977",
  volume =       "28",
  pages =        "213--228",
}

@TechReport{sep:MayNehrlichWeese:88,
  author =       "M. May and W. Nehrlich and M. Weese",
  title =        "Layout-Entwurf, Mathematische Probleme und Verfahren",
  institution =  "Akademie d. Wissenschaften der DDR",
  year =         "1988",
  type =         "Sammelband",
  address =      "Kurstr. 33 Berlin",
  pages =        "396",
}

@TechReport{sep:MazzolaNeebe:84,
  author =       "J. B. Mazzola and A. W. Neebe",
  title =        "Resource Constrained Assignment Scheduling",
  institution =  "Duke University, Fuqua School of Business",
  year =         "1984",
  number =       "8410",
  address =      "Durham, NC 27706",
  pages =        "1--26",
}

@Article{sep:MazzolaNeebe:93,
  author =       "Joseph B. Mazzola and Alan W. Neebe",
  title =        "An Algorithm for the Bottleneck Generalized Assignment
                 Problem",
  journal =      "Computers Ops. Res.",
  volume =       "20",
  number =       "4",
  pages =        "355--362",
  year =         "1993",
}

@Article{sep:McBrideYormark:80,
  author =       "R. D. McBride and J. S. Yormark",
  title =        "An Implicit Enumeration Algorithm for Quadratic
                 Integer Programming",
  journal =      "Management Sci.",
  year =         "1980",
  volume =       "26",
  pages =        "282--296",
}

@TechReport{sep:McCormick:90,
  author =       "S. T. McCormick",
  title =        "A Strongly Polynomial Minimum Mean Cut Cacelling
                 Algorithm for Submodular Flow",
  institution =  "University of British Columbia",
  year =         "1990",
  address =      "Vancouver,Canada",
  pages =        "20",
}

@TechReport{sep:McCormickErvolina:90,
  author =       "S. T. McCormick and T. R. Ervolina",
  title =        "Computing Maximum Mean Cuts",
  institution =  "University of British Columbia",
  year =         "1990",
  address =      "Vancouver,Canada",
  pages =        "23",
}

@Article{sep:McDiarmid:75,
  author =       "C. J. H. McDiarmid",
  title =        "Rado's theorem for polymatroids",
  journal =      "Math. Proc. Cambridge Philos. Soc.",
  year =         "1975",
  volume =       "78",
  pages =        "263--281",
}

@Article{sep:McDiarmid:78,
  author =       "C. J. H. McDiarmid",
  title =        "Blocking, Antiblocking, and Pairs of Matroids and
                 Polymatroids",
  journal =      "J. Combin. Theory Ser. B",
  year =         "1978",
  volume =       "25",
  number =       "Series B",
  pages =        "313--325",
}

@Article{sep:McDiarmid:90,
  author =       "C. McDiarmid",
  title =        "On the Improvement per Iteration in Karmarkar's
                 Algorithms for Linear Programming",
  journal =      "Math. Programming",
  year =         "1990",
  volume =       "46",
  pages =        "299--320",
}

@Article{sep:McLinden:78,
  author =       "L. McLinden",
  title =        "Symmetric Duality for Structured Convex Programs",
  journal =      "Trans. Amer. Math. Soc.",
  year =         "1978",
  pages =        "147--181",
}

@Article{sep:MeantiRinnooyKanStougieVercellis:90,
  author =       "M. Meanti and A. H. G. Rinnooy Kan and L. Stougie and
                 C. Vercellis",
  title =        "A Probabilistic Analysis of the Multiknapsack Value
                 Function",
  journal =      "Math. Programming",
  year =         "1990",
  volume =       "46",
  pages =        "237--247",
}

@Article{sep:Megiddo:74,
  author =       "N. Megiddo",
  title =        "Optimal Flows in Networks with Multiple Sources and
                 Sinks",
  journal =      "Math. Programming",
  year =         "1974",
  volume =       "7",
  pages =        "97--107",
}

@Article{sep:Megiddo:77,
  author =       "N. Megiddo",
  title =        "A good Algorithms for Lexicographically Optimal Flows
                 in Multi-Terminal Networks",
  journal =      "Bull. Amer. Math. Soc. (N.S.)",
  year =         "1977",
  volume =       "83",
  pages =        "407--409",
}

@Article{sep:Megiddo:79,
  author =       "N. Megiddo",
  title =        "Combinatorial Optimization with Rational Objective
                 Functions",
  journal =      "Math. Oper. Res.",
  year =         "1979",
  volume =       "4",
  pages =        "414--424",
}

@TechReport{sep:Megiddo:85,
  author =       "N. Megiddo",
  title =        "A variation on Karmarkar's algorithm",
  institution =  "IBM Research Laboratory",
  year =         "1985",
  address =      "San Jose, CA",
  pages =        "8",
}

@Article{sep:Megiddo:86,
  author =       "N. Megiddo",
  title =        "Pathways to Optimal Set in Linear Programming",
  journal =      "Proceedings of the 7th Mathematical Programming
                 Symposium of Japan",
  year =         "1986",
  pages =        "1--35",
}

@InProceedings{sep:Megiddo:87,
  author =       "N. Megiddo",
  title =        "On the Complexity of Linear Programming",
  booktitle =    "Advances in Economic Theory Fifth World Congress",
  year =         "1987",
  editor =       "T. F. Bewley",
  pages =        "225--268",
  address =      "Cambridge",
  publisher =    "Cambridge University Press",
}

@InProceedings{sep:Megiddo:89,
  author =       "N. Megiddo",
  title =        "Pathways to the optimal set in linear programming",
  year =         "1989",
  pages =        "131--158",
  booktitle =    "Progress in Math. Programming; Interoir point and
                 related Methods; Proc. Conf., Pacific Grove, Cal.
                 1987",
}

@Article{sep:MegiddoShub:89,
  author =       "N. Megiddo and M. Shub",
  title =        "Boundary Behavior of Interior Point Algorithms in
                 Linear Programming",
  journal =      "Math. Oper. Res.",
  year =         "1989",
  volume =       "14",
  number =       "1",
  pages =        "97--146",
}

@Article{sep:MegiddoZemel:86,
  author =       "N. Megiddo and E. Zemel",
  title =        "An 0(n log n) Randomizing Algorithm for the Weighted
                 Euclidean 1-Center Problem",
  journal =      "J. Algorithms",
  year =         "1986",
  volume =       "7",
  pages =        "358--368",
}

@TechReport{sep:Mehrotra:86,
  author =       "S. Mehrotra",
  title =        "A self correcting version of Karmarkar's algorithm",
  institution =  "Columbia University, Dep. of Industrial Engineering
                 and OR",
  year =         "1986",
  address =      "New York, N.Y.",
  pages =        "25",
}

@Article{sep:Mehrotra:91,
  author =       "S. Mehrotra",
  title =        "On Computing the Center of a Convex Quadratically
                 Constrained Set",
  journal =      "Math. Programming",
  year =         "1991",
  number =       "1",
  volume =       "A 50",
  pages =        "81--89",
}

@InProceedings{sep:MehrotraSun:90,
  author =       "S. Mehrotra and J. Sun",
  title =        "An interior point algorithm for solving smooth convex
                 programs based on Newton's method",
  pages =        "265--284",
  booktitle =    "ASM - IMS - SIAM Summer Conf. Contemp. Math. 114",
  year =         "1990",
}

@TechReport{sep:MerchantRao:,
  author =       "D. K. Merchant and M. R. Rao",
  title =        "Majority Decisions and Transitivity: Some Special
                 Cases",
  institution =  "?",
  year =         "19xx",
  pages =        "125--130",
}

@TechReport{sep:Metelsky:92,
  author =       "N. N. Metelsky",
  title =        "Iso-Convecity Based Placement Technique",
  institution =  "Belarussian Academy of Science, Dep. for Mathematical
                 Problems of Design Automation",
  year =         "1992",
  address =      "Minsk/Belarus",
  pages =        "6",
}

@TechReport{sep:Milanov:87,
  author =       "P. B. Milanov",
  title =        "On the Threshold Independence System",
  institution =  "Rhein. Friedrich-Wilhelms-Universit{\"a}t",
  year =         "1989",
  number =       "87487-OR",
  address =      "Bonn",
}

@Article{sep:Miliotis:76,
  author =       "P. Miliotis",
  title =        "Integer Programming Approaches to the Travelling
                 Salesman Problem",
  journal =      "Math. Programming",
  year =         "1976",
  volume =       "10",
  pages =        "367--378",
}

@InProceedings{sep:MilnerWelsh:76,
  author =       "E. C. Milner and D. J. A. Welsh",
  title =        "On the Computational Complexity of Graph Theoretical
                 Properties",
  booktitle =    "Proceedings of the 5th Britisch Combinatorial
                 Conference, Aberdeen",
  year =         "1976",
  editor =       "C. St.J. A. Nash-Williams",
  pages =        "471--488",
  address =      "Congressus Numerantium, 15, Winnipeg",
  publisher =    "Utilitas Mathematica",
}

@Article{sep:Minieka:73,
  author =       "E. Minieka",
  title =        "Maximal, Lexicographic, and Dynamic Network Flows",
  journal =      "Oper. Res.",
  year =         "1973",
  volume =       "21",
  pages =        "517--527",
}

@Article{sep:Minoux:76,
  author =       "M. Minoux",
  title =        "Flots \'{e}quilibr\'{e}s et flots avex
                 s\'{e}curit\'{e}",
  journal =      "EDF Bull. Direction {'E}tudes Rech. S{'e}r. C Math.
                 Inform.",
  year =         "1976",
  volume =       "1",
  number =       "Series C",
  pages =        "5--16",
}

@TechReport{sep:Minoux:82,
  author =       "M. Minoux",
  title =        "A new Polynomial Cutting-Plane Algorithm for Maximum
                 Weight Matchings in General Graphs",
  institution =  "Universit{\'{e}} de Montr\'{e}al, Centre de recherche
                 sur les transport",
  year =         "1982",
  number =       "302",
  address =      "Montr\'{e}al",
  pages =        "47",
}

@Article{sep:Minty:80,
  author =       "G. J. Minty",
  title =        "On Maximal Independent Sets of Vertices in Claw-Free
                 Graphs",
  journal =      "J. Combin. Theory Ser. B",
  year =         "1980",
  volume =       "?",
  number =       "Series B",
  pages =        "284--304",
}

@Article{sep:MirskyPerfect:66,
  author =       "L. Mirsky and H. Perfect",
  title =        "Systems of Representatives",
  journal =      "J. Math. Anal. Appl.",
  year =         "1966",
  volume =       "15",
  pages =        "520--568",
}

@TechReport{sep:MitchelTodd:86,
  author =       "J. E. Mitchel and M. J. Todd",
  title =        "On the Relationship between the Search Directions in
                 the Affine and Projective Variants of Karmarkar's
                 Linear Programming Algorithms",
  institution =  "Cornell University, College of Engineering",
  year =         "1986",
  number =       "725",
  address =      "Ithaca, New York",
  pages =        "22",
}

@Article{sep:MitchelTodd:89,
  author =       "J. E. Mitchel and M. J. Todd",
  title =        "Two Variants of Karmarkar's Linear Programming
                 Algorithm for Problems with some Unrestricted
                 Variables",
  journal =      "SIAM J. Matrix Annal. Appl.",
  year =         "1989",
  number =       "1",
  volume =       "10",
  pages =        "30--38",
}

@Proceedings{sep:MitraTamizYadegarDarby-Dowman:85,
  editor =       "G. Mitra and M. Tamiz and J. Yadegar and K.
                 Darby-Dowman",
  title =        "Experimental Investigation of an Interior Search
                 Algorithm for Linear Programming",
  year =         "1985",
  organization = "Math. Programming Symposium",
  address =      "Boston",
}

@TechReport{sep:MizunoKojima:92,
  author =       "S. Mizuno and M. Kojima",
  title =        "Infeasible-Interior-Point Primal-Dual
                 Potential-Reduction Algorithms for Linear Programming",
  institution =  "Cornell University, College of Engineering",
  year =         "1992",
  number =       "1023",
  address =      "Ithaca, N.Y.",
  pages =        "10",
}

@TechReport{sep:MizunoToddTuncel:92,
  author =       "S. Mizuno and M. J. Todd and Levent Tuncel",
  title =        "Monotonicity of Primal and Dual Objective Values in
                 Primal-Dual Interior-Point Algorithms",
  institution =  "Cornell University",
  year =         "1992",
  number =       "1014",
  address =      "Ithaca, NY",
}

@TechReport{sep:MizunoToddYe:90,
  author =       "S. Mizuno and M. J. Todd and Y. Ye",
  title =        "On Adaptive-Step Primal-Dual Interior-Point Algorithms
                 for Linear Programming",
  institution =  "Cornell University, College of Engineering",
  year =         "1990",
  number =       "944",
  address =      "Ithaca, N.Y.",
  pages =        "20",
}

@TechReport{sep:Moehring:91,
  author =       "R. H. M{\"o}hring",
  title =        "Graph Problems Related to Gate Matrix Layout and {PLA}
                 Folding",
  institution =  "Technische Universit{\"a}t Berlin, FB Mathematik",
  year =         "1991",
  address =      "Berlin",
  pages =        "31",
}

@Article{sep:MonmaMorton:87,
  author =       "C. L. Monma and A. J. Morton",
  title =        "Computational Experience with a Dual Affine Variant of
                 Karmarmar's Method for Linear Programming",
  journal =      "Oper. Res. Lett.",
  year =         "1987",
  volume =       "6",
  pages =        "261--267",
}

@Article{sep:MonmaMunsonPulleyblank:90,
  author =       "C. L. Monma and B. S. Munson and W. R. Pulleyblank",
  title =        "Minimum-Weight Two-Connected Spanning Networks",
  journal =      "Math. Programming",
  year =         "1990",
  volume =       "A 46",
  number =       "2",
  pages =        "153--171",
}

@Article{sep:MonteiroAdler:89a,
  author =       "R. C. Monteiro and I. Adler",
  title =        "Interior path following primal dual algorithms. {I}:
                 Linear programming",
  journal =      "Math. Programming",
  year =         "1989",
  volume =       "A 44",
  number =       "1",
  pages =        "27--41",
}

@Article{sep:MonteiroAdler:89b,
  author =       "R. C. Monteiro and I. Adler",
  title =        "Interoir path following primal dual algorithms. {II}:
                 Convex quadratics programming",
  journal =      "Math. Programming",
  year =         "1989",
  volume =       "Ser. A 44",
  number =       "1",
  pages =        "43--66",
}

@Article{sep:Mueller-Merbach:66,
  author =       "H. M{\"u}ller-Merbach",
  title =        "Die {L}{\"o}sung des Transportproblems auf
                 Rechenautomaten - Ein {ALGOL}-Programm",
  journal =      "Elektronische Datenverarbeitung",
  year =         "1966",
  volume =       "2",
  pages =        "49--56",
}

@Article{sep:Mueller-Merbach:68,
  author =       "H. M{\"u}ller-Merbach",
  title =        "Sensibilit{\"a}tsanalyse von Transportproblemen der
                 linearen Planungsrechnung (mit Algol-Programm)",
  journal =      "Elektronische Datenverarbeitung",
  year =         "1968",
  volume =       "10",
  pages =        "184--188",
}

@InProceedings{sep:Mueller-Merbach:79,
  author =       "H. M{\"u}ller-Merbach",
  title =        "Operations Research - mit oder ohne Zukunftschancen",
  booktitle =    "Festschrift f{\"u}r Prof. R{\"u}hl: Industrial
                 Engineering und Organisations-Entwicklung",
  year =         "1979",
  pages =        "291--311",
  publisher =    "Hanser-Verlag",
}

@Article{sep:Mulvey:78,
  author =       "J. J. Mulvey",
  title =        "Pivot Strategies for Primal-Simplex Network Codes",
  journal =      "J. Assoc. Comput. Mach.",
  year =         "1978",
  volume =       "25",
  pages =        "266--270",
}

@Article{sep:Munro:71,
  author =       "I. Munro",
  title =        "Efficient Determination of the Transitive Closure of a
                 Directed Graph",
  journal =      "Inform. Process. Lett.",
  year =         "1971",
  volume =       "1",
  pages =        "56--58",
}

@Article{sep:MurotaFujishige:87,
  author =       "K. Murota and S. Fujishige",
  title =        "Finding a Homotopy Base for Directed Paths in an
                 Acyclic Graph",
  journal =      "Discrete Appl. Math.",
  year =         "1987",
  volume =       "17",
  pages =        "157--162",
}

@Article{sep:Murty:85,
  author =       "K. G. Murty",
  title =        "Faces of a Polyhedron",
  journal =      "Math. Programming Stud.",
  year =         "1985",
  volume =       "24",
  pages =        "30--42",
}

@Article{sep:MurtyPerin:82,
  author =       "K. G. Murty and C. Perin",
  title =        "A 1-Matching Blossom-Type Algorithm for Edge Covering
                 Problems",
  journal =      "Networks",
  year =         "1982",
  volume =       "12",
  pages =        "379--391",
}

@MastersThesis{sep:Nachtigall:84,
  author =       "K. Nachtigall",
  title =        "Verbandsr{\"a}ume",
  school =       "Hochschule Hildesheim, Institut f{\"u}r Mathematik",
  year =         "1984",
  address =      "Hildesheim",
  pages =        "175",
}

@TechReport{sep:Nachtigall:86,
  author =       "K. Nachtigall",
  title =        "Residuated Lattice Spaces",
  institution =  "Hochschule Hildesheim, Institut f{\"u}r Mathematik",
  year =         "1986",
  address =      "Hildesheim",
  pages =        "37",
}

@PhdThesis{sep:Nachtigall:89,
  author =       "K. Nachtigall",
  title =        "Lineare Abbildungen zwischen Verbandsr{\"a}umen und
                 deren Anwendungen",
  school =       "Universit{\"a}t Hannover, FB Mathematik",
  year =         "1989",
  address =      "Hannover",
  pages =        "158",
}

@Article{sep:NaddefPulleyblank:67,
  author =       "D. Naddef and W. R. Pulleyblank",
  title =        "for the Existence of the Solution of the Multi-Index
                 Transportation Problem",
  journal =      "J. Oper. Res. Soc. Japan",
  year =         "1967",
  volume =       "15",
  pages =        "542--545",
}

@Article{sep:NaddefPulleyblank:81a,
  author =       "D. Naddef and W. R. Pulleyblank",
  title =        "Hamiltonicity and Combinatorial Polyhedra",
  journal =      "J. Combin. Theory Ser. B",
  year =         "1981",
  volume =       "31b",
  pages =        "297--312",
}

@Article{sep:NaddefPulleyblank:81b,
  author =       "D. Naddef and W. R. Pulleyblank",
  title =        "Hamiltonicity and Combinatorial Polyhedra",
  journal =      "J. Combin. Theory Ser. B",
  year =         "1981",
  volume =       "31b",
}

@InProceedings{sep:NaddefPulleyblank:82,
  author =       "D. Naddef and W. Pulleyblank",
  title =        "Ear Decompositions of Elementary Graphs and {GF2}-Rank
                 of Perfect Matchings",
  booktitle =    "Bonn Workshop on Combinatorial Optimization",
  year =         "1982",
  editor =       "A. Bachem and M. Gr{\"o}tschel and B. Korte",
  pages =        "241--260",
  address =      "Annals of Discrete Mathematics, 16, Amsterdam",
  publisher =    "North Holland",
}

@Article{sep:NagamochiIbaraki:89,
  author =       "Hiroshi Nagamochi and Toshihide Ibaraki",
  title =        "On Max-Flow Min-Cut and Integral Flow Properties for
                 Multicommodity Flows in Directed Networks",
  journal =      "Information Processing Letters",
  volume =       "31",
  pages =        "279--285",
  year =         "1989",
}

@Article{sep:Nagler:63,
  author =       "H. Nagler",
  title =        "On a Property of Simplex Tableaux in the
                 Transportation Problem",
  journal =      "Numer. Math.",
  year =         "1963",
  volume =       "4",
  pages =        "398--402",
}

@Article{sep:Nakamura:88a,
  author =       "M. Nakamura",
  title =        "A Note on the Decomposition of Poly-Linking Systems
                 and the Minors of Generalized Polymatroids",
  journal =      "J. Oper. Res. Soc. Japan",
  year =         "1988",
  volume =       "31",
  number =       "2",
  pages =        "496--514",
}

@Article{sep:Nakamura:88b,
  author =       "M. Nakamura",
  title =        "A Note on the Decomposition of Poly-linking Systems
                 and the Minors of Genralized Polymatroids",
  journal =      "J. Oper. Res. Soc. Japan",
  year =         "1988",
  volume =       "31",
  number =       "4",
  pages =        "496--513",
}

@Article{sep:Nakamura:88c,
  author =       "M. Nakamura",
  title =        "Structural Theorems for Submodular Functions,
                 Polymatroids and Polymatroid Intersections",
  journal =      "Graphs Combin.",
  year =         "1988",
  volume =       "4",
  pages =        "257--284",
}

@InProceedings{sep:NakamuraIri:79,
  author =       "M. Nakamura and M. Iri",
  title =        "Fine Structures of Matroid Intersections and their
                 Applications",
  booktitle =    "Proceedings of 1979 International Symposium on
                 Circuits and Systems",
  year =         "1979",
  pages =        "996--999",
}

@Article{sep:NakamuraIri:88,
  author =       "M. Nakamura and M. Iri",
  title =        "Structural theorems for submodular functions,
                 polymatroids and polymatroid intersections",
  journal =      "Graphs Combin.",
  year =         "1988",
  volume =       "4",
  number =       "3",
  pages =        "257--284",
}

@TechReport{sep:Nakayama:92,
  author =       "A. Nakayama",
  title =        "Comments on Zimmermann's paper: On the Complexity of
                 the Dual Method for Maximum Balanced Flows",
  institution =  "Fukushima University, Faculty of Administration and
                 Social Sciences",
  year =         "1992",
  address =      "Fukushima/Japan",
  pages =        "8",
}

@Article{sep:NemhauserSavelsberghSigismondi:94,
  author =       "George L. Nemhauser and Martin W. P. Savelsbergh and
                 Gabriele C. Sigismondi",
  title =        "{MINTO}, a Mixed {INT}eger Optimizer",
  journal =      "Operations Research Letters",
  volume =       "15",
  pages =        "47--58",
  year =         "1994",
}

@Article{sep:NemhauserTrotter:74,
  author =       "G. L. Nemhauser and L. E. Trotter Jr.",
  title =        "Properties of Vertex Packing and Independence System
                 Polyhedra",
  journal =      "Math. Programming",
  year =         "1974",
  volume =       "6",
  pages =        "48--61",
}

@Article{sep:NemhauserWolsey:78,
  author =       "G. L. Nemhauser and L. A. Wolsey",
  title =        "Best Algorithms for Approximating the Maximum of a
                 Submodular Set Function",
  journal =      "Math. Oper. Res.",
  year =         "1978",
  volume =       "3",
  pages =        "177--188",
}

@InProceedings{sep:NemhauserWolsey:81,
  author =       "G. L. Nemhauser and L. A. Wolsey",
  title =        "Maximizing Submodular Set Functions: Formulations and
                 Analysis of Algorithms",
  booktitle =    "Studies on Graphs and Discrete Programming",
  year =         "1981",
  editor =       "P. Hansen",
  pages =        "279--301",
  address =      "Annals of Discrete Mathematics, 11, Amsterdam",
  publisher =    "North Holland",
}

@Article{sep:NemhauserWolsey:90a,
  author =       "G. L. Nemhauser and L. A. Wolsey",
  title =        "A Recursive Procedure for Generating all cuts for 0-1
                 mixed integer programms",
  journal =      "Math. Programming",
  year =         "1990",
  number =       "3",
  volume =       "A 46",
  pages =        "379--390",
}

@Article{sep:NemhauserWolsey:90b,
  author =       "G. L. Nemhauser and L. A. Wolsey",
  title =        "A Recursive Procedure to Generate all Cuts for 0-1
                 Mixed Integer Programs",
  journal =      "Math. Programming",
  year =         "1990",
  volume =       "46",
  pages =        "379--390",
}

@MastersThesis{sep:Neumann:81,
  author =       "M. Neumann",
  title =        "Vertex Packing Probleme in Krallenfreien Graphen",
  school =       "Universit{\"a}t, Anleitung: Prof. Dr. R.E. Burkard",
  year =         "1981",
  address =      "K{\"o}ln",
  pages =        "86",
}

@Article{sep:NickelsRoedderXuZimmermann:85,
  author =       "W. Nickels and W. R{\"o}dder and L. Xu and H.-J.
                 Zimmermann",
  title =        "Intelligent gradient search in linear programming",
  journal =      "European J. Oper. Res.",
  year =         "1985",
  volume =       "22",
  pages =        "293--303",
}

@Article{sep:Niederreiter:91,
  author =       "H. Niederreiter",
  title =        "Recent Trends in Random Number and Random Vector
                 Generation",
  journal =      "Annals of Operations Research",
  year =         "1991",
  volume =       "31",
  pages =        "323--346",
}

@Article{sep:Niepage:77,
  author =       "H.-D. Niepage",
  title =        "Ein {\"U}berdeckungsprinzip zur {L}{\"o}sung freier
                 ganzzahliger Minimumprobleme",
  journal =      "Wiss. Z. Humboldt-Univ. Berlin Math.-Natur. Reihe",
  year =         "1977",
  volume =       "XXVI",
  pages =        "575--581",
}

@TechReport{sep:Noltemeier:74,
  author =       "H. Noltemeier",
  title =        "Ein Algorithmus zur Bestimmung der l{\"a}ngsten
                 Entfernungen in Graphen",
  institution =  "Universit{\"a}t, Lehrstuhl f. OR und
                 Datenverarbeitung",
  year =         "1974",
  number =       "7408",
  address =      "G{\"o}ttingen",
  pages =        "11",
}

@Article{sep:NorbackLove:77,
  author =       "J. P. Norback and R. F. Love",
  title =        "Geometric Approaches to Solving the Traveling Salesman
                 Problem",
  journal =      "Management Sci.",
  year =         "1977",
  volume =       "23",
  pages =        "1208--1223",
}

@Article{sep:Norman:55,
  author =       "R. Z. Norman",
  title =        "On the convex polyhedra of the symmetric traveling
                 salesman problem",
  journal =      "Summer Meeting in Ann Arbor",
  year =         "1955",
  pages =        "559",
}

@TechReport{sep:Oettli:72,
  author =       "W. Oettli",
  title =        "An Iterative Method, Having Linear Rate of
                 Convergence, for Solving a Pair of Dual Linear
                 Programs",
  institution =  "Rhein. Friedr.-Wilh.-Universit{\"a}t",
  year =         "1972",
  address =      "Bonn",
  pages =        "302--311",
}

@Article{sep:Oettli:84,
  author =       "W. Oettli",
  title =        "On a new version of the Hahn-Banach theorem",
  journal =      "Math. Programming",
  year =         "1984",
  pages =        "289--295",
}

@InProceedings{sep:Ohse:78a,
  author =       "D. Ohse",
  title =        "Das Zeit-Umlade- oder
                 Bottleneck-Transshipmentproblem",
  booktitle =    "Proceedings in Operations Research, 7",
  year =         "1978",
  pages =        "409--419",
  address =      "W{\"u}rzburg",
  publisher =    "Physica",
}

@InProceedings{sep:Ohse:78b,
  author =       "D. Ohse",
  title =        "Das Zeit-Umlade- oder
                 Bottleneck-Transshipmentproblem",
  booktitle =    "Proceedings in Operations Research 6",
  year =         "1978",
  pages =        "48--61",
}

@Article{sep:OhyaIriMurota:84,
  author =       "T. Ohya and M. Iri and K. Murota",
  title =        "Improvements of the Incremental Method for the Voronoi
                 Diagram with Computational Comparison of Various
                 Algorithms",
  journal =      "J. Oper. Res. Soc. Japan",
  year =         "1984",
  volume =       "27",
  pages =        "306--337",
}

@Article{sep:Orlin:84a,
  author =       "J. B. Orlin",
  title =        "Minimum Convex Cost Dynamic Network Flows",
  journal =      "Math. Oper. Res.",
  year =         "1984",
  volume =       "9",
  pages =        "190--207",
}

@TechReport{sep:Orlin:84b,
  author =       "J. B. Orlin",
  title =        "Genuinely Polynomial Simplex and Non-Simplex
                 Algorithms for the Minimum Cost Flow Problem",
  institution =  "Mass. Inst. of Technology, Sloan School of
                 Management",
  year =         "1984",
  number =       "1615-84",
  address =      "Cambridge",
  pages =        "39",
}

@Article{sep:Orlin:85,
  author =       "J. B. Orlin",
  title =        "On the Simplex Algorithm for Networks and Generalized
                 Networks",
  journal =      "Math. Programming Stud.",
  year =         "1985",
  volume =       "24",
  pages =        "166--178",
}

@Article{sep:Orlin:88,
  author =       "J. B. Orlin",
  title =        "A Faster Strongly Polynomial Minimum Cost Flow
                 Algorithm",
  journal =      "Oper. Res.",
  year =         "1993",
  volume =       "41",
  number =       "2",
  pages =        "338--350",
}

@TechReport{sep:OrlinAhuja:88a,
  author =       "J. B. Orlin and R. K. Ahuja",
  title =        "New Scaling Algorithms for the Assignment for Minimum
                 Cycle Mean Problems",
  institution =  "Massachusetts Institute of Technology, Operations
                 Research Center",
  year =         "1988",
  number =       "178-88",
  address =      "Cambridge, MA",
  pages =        "27",
}

@Article{sep:OrlinAhuja:90,
  author =       "J. B. Orlin and R. K. Ahuja",
  title =        "New Distance-Directed Algorithms for Maximum Flow and
                 Parametric Maximum Flow Problems",
  journal =      "Naval Research Logistics",
  year =         "1990",
  volume =       "38",
  pages =        "413--430",
}

@TechReport{sep:OrlinGugenheimHammondVandeVate:8,
  author =       "J. Orlin and E. Gugenheim and J. Hammond and J.
                 VandeVate",
  title =        "Linear Matroid Parity Made Almost Easy: An Extended
                 Abstract",
  institution =  "MIT",
  year =         "198x",
  pages =        "9",
}

@TechReport{sep:OrlinVandeVate:83,
  author =       "J. B. Orlin and J. VandeVate",
  title =        "On a {"}Primal{"} Matroid Intersection Algorithm",
  institution =  "Mass. Inst. of Technology, Sloan School of
                 Management",
  year =         "1983",
  number =       "1446-83",
  address =      "Cambridge",
  pages =        "7",
}

@Article{sep:Osborne:87,
  author =       "M. R. Osborne",
  title =        "Dual Barrier Functions with Superfast Rates of
                 Convergence for the Linear Programming Problem",
  journal =      "J. Austral. Math. Soc. Ser. B",
  year =         "1987",
  volume =       "B 29",
  pages =        "39--58",
}

@InProceedings{sep:Padberg:73,
  author =       "M. W. Padberg",
  title =        "Perfect Zero-One Matrices - {II}",
  booktitle =    "Proceedings in Operations Research 3",
  year =         "1973",
  editor =       "P. Gessner and R. Henn and V. Steinecke and H. Todd",
  pages =        "75--83",
  address =      "W{\"u}rzburg",
  publisher =    "Physica-Verlag",
}

@TechReport{sep:Padberg:74a,
  author =       "M. W. Padberg",
  title =        "Perfect Zero-One Matrices",
  institution =  "Universit{\"a}t, Inst. f. {\"O}konometrie und OR",
  year =         "1974",
  number =       "7401-OR",
  address =      "Bonn",
  pages =        "30",
}

@TechReport{sep:Padberg:74b,
  author =       "M. W. Padberg",
  title =        "Characterisations of Totally Unimodular, Balanced and
                 Perfect Matrices",
  institution =  "Universit{\"a}t, Inst. f. {\"O}konometrie und OR",
  year =         "1974",
  number =       "7423-OR",
  address =      "Bonn",
  pages =        "10",
}

@Article{sep:Padberg:86,
  author =       "M. Padberg",
  title =        "A different convergence proof of the projective method
                 for linear programming",
  journal =      "Oper. Res. Lett.",
  year =         "1986",
  volume =       "4",
  pages =        "352--257",
}

@Article{sep:PadbergHong:80,
  author =       "M. W. Padberg and S. Hong",
  title =        "On the Symmetric Travelling Salesman Problem: {A}
                 Computational Study",
  journal =      "Math. Programming Stud.",
  year =         "1980",
  volume =       "12",
  pages =        "78--107",
}

@Article{sep:PadbergRao:74,
  author =       "M. W. Padberg and M. R. Rao",
  title =        "The Travelling Salesman Problem and a Class of
                 Polyhedra of Diameter Two",
  journal =      "Math. Programming",
  year =         "1974",
  volume =       "7",
  pages =        "32--45",
}

@Article{sep:PadbergRinaldi:91,
  author =       "M. Padberg and G. Rinaldi",
  title =        "A Branch-and-Cut Algorithm for the Resolution of
                 Large-Scale Symmetric Traveling Slesman Problems",
  journal =      "SIAM Rev.",
  year =         "1991",
  volume =       "33",
  pages =        "60--100",
}

@Article{sep:Page:63,
  author =       "E. S. Page",
  title =        "A Note on Assignment Problems",
  journal =      "The Computer Journal",
  year =         "1963/64",
  volume =       "6",
  pages =        "241--243",
}

@TechReport{sep:Pallaschke:79,
  author =       "D. Pallaschke",
  title =        "An Algebraic Representation of Classical Systems",
  institution =  "Universit{\"a}t, Inst. f. {\"O}konometrie und OR",
  year =         "1979",
  number =       "79140-OR",
  address =      "Bonn",
  pages =        "21",
}

@Article{sep:Pan:84,
  author =       "V. Y. Pan",
  title =        "How Fast can we solve a System of Linear Inequalities
                 in the Worst and in the Average Cases?",
  journal =      "Meth. Oper. Res.",
  year =         "1984",
  volume =       "51",
  pages =        "107--118",
}

@Article{sep:Pandit:61,
  author =       "S. N. N. Pandit",
  title =        "A New Matrix Calculus",
  journal =      "J. Soc. Indust. Appl. Math.",
  year =         "1961",
  volume =       "9",
  pages =        "632--639",
}

@Article{sep:Papadimitriou:78,
  author =       "C. H. Papadimitriou",
  title =        "The Adjacency Relation of the Traveling Salesman
                 Polytope is {NP}-Complete",
  journal =      "Math. Programming",
  year =         "1978",
  volume =       "4",
  pages =        "312--324",
}

@Article{sep:PapadimitriouSteiglitz:78,
  author =       "C. H. Papadimitriou and K. Steiglitz",
  title =        "Some Examples of Difficult Traveling Salesman
                 Problems",
  journal =      "Oper. Res.",
  year =         "1978",
  volume =       "26",
  pages =        "434--443",
}

@TechReport{sep:PapadimitriouSteiglitz:88,
  author =       "C. H. Papadimitriou and K. Steiglitz",
  title =        "Some Examples of Maximum Flow and Parametric Maximum
                 Flow Problems",
  institution =  "Massachusetts Institute of Technology",
  year =         "1988",
  number =       "192",
  address =      "Cambridge, MA",
  pages =        "1--28",
}

@Article{sep:PapeSchoen:70,
  author =       "U. Pape and B. Sch{\"o}n",
  title =        "Verfahren zur {L}{\"o}sung von Summen- und
                 Engpa\ss{}-Zuordnungsroblemen",
  journal =      "Elektronische Datenverarbeitung",
  year =         "1970",
  volume =       "12",
  pages =        "149--163",
}

@Article{sep:ParkerRarding:84,
  author =       "R. G. Parker and R. L. Rarding",
  title =        "Guaranteed Performance Heuristics for the Bottleneck
                 Traveling Salesman Problem",
  journal =      "Oper. Res. Lett.",
  year =         "1984",
  volume =       "2",
  pages =        "269--272",
}

@Article{sep:Pasch:82,
  author =       "H. P. Pasch",
  title =        "Nonlinear one-parametric minimal cost network flow
                 problems",
  journal =      "OR Spektrum",
  year =         "1982",
  volume =       "4",
  pages =        "129--134",
}

@TechReport{sep:Peeva:,
  author =       "K. Peeva",
  title =        "Systems of Linear Equations over a Bounded Chain",
  institution =  "Center of Appl. Math.",
  year =         "19xx",
  address =      "Sofia",
  pages =        "11",
}

@Article{sep:Peled:77,
  author =       "U. N. Peled",
  title =        "Properties of Facets of Binary Polytopes",
  journal =      "Ann. Disc. Math.",
  year =         "1977",
  volume =       "1",
  pages =        "435--456",
}

@TechReport{sep:Perusch:86,
  author =       "M. Perusch",
  title =        "Simulated Annealing Applied to a Single Machine
                 Scheduling Problem with Sequence Dependent Set up Times
                 and Due dates",
  institution =  "Tech. Univ. Graz, Inst. f{\"u}r Mathematik",
  year =         "1986",
  number =       "86-84",
  address =      "Graz",
  pages =        "14",
}

@Article{sep:Peteanu:67a,
  author =       "V. Peteanu",
  title =        "Sur la Compatibilit\'{e} du Probl\`{e}me Central de
                 {L}'ordonnancement",
  journal =      "Mathematica (Cluj)",
  year =         "1967",
  volume =       "9",
  pages =        "141--146",
}

@Article{sep:Peteanu:67b,
  author =       "V. Peteanu",
  title =        "An Algebra of the Optimal Path in Networks",
  journal =      "Mathematica (Cluj)",
  year =         "1967",
  volume =       "9",
  pages =        "335--342",
}

@Article{sep:Peteanu:69,
  author =       "V. Peteanu",
  title =        "Optimal Paths in Networks and Generalizations ({I})",
  journal =      "Mathematica (Cluj)",
  year =         "1969",
  volume =       "11",
  pages =        "311--327",
}

@Article{sep:Peteanu:70,
  author =       "V. Peteanu",
  title =        "Optimal Paths in Networks and Generalizations ({II})",
  journal =      "Mathematica (Cluj)",
  year =         "1970",
  volume =       "12",
  pages =        "159--186",
}

@Article{sep:Peteanu:72,
  author =       "V. Peteanu",
  title =        "{O} Generalizare a Notiunii de Centru al Unui Graf",
  journal =      "Revista de Analiz\`{a} Numeric\`{a} si theoria
                 Aprocimatiei",
  year =         "1972",
  volume =       "1",
  pages =        "83--86",
}

@InProceedings{sep:Peteanu:73,
  author =       "V. Peteanu",
  title =        "Optimal Paths in Networks and Generalizations {I}.
                 (Perfect Zero-One Matrices {II}.)",
  booktitle =    "Proceedings in Operations Resesrch 3",
  year =         "1973",
  editor =       "P. Gessner and R. Henn and V. Steinecke and H. Todd",
  pages =        "75--83",
  address =      "W{\"u}rzburg",
  publisher =    "Physika-Verlag",
}

@TechReport{sep:PfeifferMiddendorf:88,
  author =       "Pfeiffer Middendorf. M.",
  title =        "Routing Multiterminal Nets via Disjoint Connected
                 {T}-Joins",
  institution =  "Universit{\"a}t Bonn, Institut f{\"u}r {\"O}konometrie
                 und OR",
  year =         "1988",
  number =       "88511-OR",
  address =      "Bonn",
  pages =        "16",
}

@TechReport{sep:PferschyRudolfWoeginger:93,
  author =       "Ulrich Pferschy and R{\"u}diger Rudolf and Gerhard J.
                 Woeginger",
  title =        "Some Geometric Clustering Problems",
  institution =  "Institut f{\"u}r Mathematik",
  year =         "1993",
  number =       "254",
  address =      "Technische Universit{\"a}t Graz",
}

@TechReport{sep:PferschyRudolfWoeginger:94,
  author =       "Ulrich Pferschy and R{\"u}diger Rudolf and Gerhard J.
                 Woeginger",
  title =        "Monge Matrices Make Maximization Manageable",
  institution =  "Institut f{\"u}r Mathematik",
  year =         "1994",
  address =      "Technische Universit{\"a}t Graz",
}

@TechReport{sep:PferschyTuy:92,
  author =       "U. Pferschy and H. Tuy",
  title =        "Linear Programs with an Additional Rand Two Reverse
                 Convex Constraint",
  institution =  "Techn. Univ. Graz, Inst. f. Mathematik",
  year =         "1992",
  number =       "210",
  address =      "Graz",
  pages =        "15",
}

@TechReport{sep:PferschyWoegingerYao:93,
  author =       "Ulrich Pferschy and Gerhard J. Woeginger and En-Yu
                 Yao",
  title =        "Partitioning Graphs into Two Trees",
  institution =  "Institut f{\"u}r Mathematik",
  year =         "1993",
  number =       "263",
  address =      "Technische Universit{\"a}t Graz",
}

@Article{sep:PicardQueyranne:82a,
  author =       "J.-C. Picard and M. Queyranne",
  title =        "Selected Applications of Minimum Cuts in Networks",
  journal =      "Infor",
  year =         "1982",
  volume =       "20",
  number =       "4",
  pages =        "394--422",
}

@Article{sep:PicardQueyranne:82b,
  author =       "J. C. Picard and M. Queyranne",
  title =        "A Network Flow Solution to Some Nonlinear 0-1
                 Programming Problems, with Applications to Graph
                 Theory",
  journal =      "Networks",
  year =         "1982",
  volume =       "12",
  pages =        "141--159",
}

@TechReport{sep:PicardQueyranne:85,
  author =       "J. C. Picard and M. Queyranne",
  title =        "Integer Minimization of a Separable Convex Function
                 Subject to Variable Upper Bound Constraints",
  institution =  "Universit{\'{e}} du Qu\'{e}bec \'{a} Montr\'{e}al",
  year =         "1985",
  address =      "Montreal",
  pages =        "19",
}

@Article{sep:Pierskalla:67,
  author =       "W. P. Pierskalla",
  title =        "The Tri-Substitution Method for the Three-Dimensional
                 Assignment Problem",
  journal =      "CORS-Journal",
  year =         "1967",
  volume =       "5",
  pages =        "71--81",
}

@Article{sep:Pierskalla:68,
  author =       "W. P. Pierskalla",
  title =        "The Multidimensional Assignment Problem",
  journal =      "Oper. Res.",
  year =         "1968",
  volume =       "16",
  pages =        "422--431",
}

@Article{sep:Pinter:86,
  author =       "J. Pint\'{e}r",
  title =        "Global Optimization on Convex Sets",
  journal =      "OR Spektrum",
  year =         "1986",
  volume =       "8",
  pages =        "197--202",
}

@Article{sep:Pinter:88,
  author =       "J. Pint\'{e}r",
  title =        "Branch- and Bound Algorithms for Solving Global
                 Optimization Problems with Lipschitzian Structure",
  journal =      "Optimization",
  year =         "1988",
  volume =       "19",
  pages =        "101--110",
}

@TechReport{sep:Pisaruk:89a,
  author =       "N. N. Pisaruk",
  title =        "Faces of Submodular Functions and Related Topics",
  institution =  "Rhein.-Friedr.-Wilhelms-Universit{\"a}t, Institut
                 f{\"u}r {\"O}konometrie und OR",
  year =         "1989",
  number =       "89615-OR",
  address =      "Bonn",
  pages =        "16",
}

@Article{sep:Pisaruk:89b,
  author =       "N. N. Pisaruk",
  title =        "A representation of a lattice of optimal solutions of
                 the problem of submodular function minimization
                 (Russian)",
  journal =      "Zh. Vychisl. Mat. i Mat. Fiz.",
  year =         "1989",
  volume =       "29",
  pages =        "1426--1431",
}

@Article{sep:Plummer:84,
  author =       "M. D. Plummer",
  title =        "Some Recent Results on Cycle Traversability in
                 Graphs",
  journal =      "Ann. Disc. Math.",
  year =         "1984",
  volume =       "20",
  pages =        "255--262",
}

@Article{sep:PlummerPulleyblank:82,
  author =       "M. D. Plummer and W. R. Pulleyblank",
  title =        "On Proximity to Paths and Cycles in 3-Connected
                 Graphs",
  journal =      "Ars Combin.",
  year =         "1982",
  volume =       "14",
  pages =        "169--185",
}

@Article{sep:PlummerPulleyblank:84,
  author =       "M. D. Plummer and W. R. Pulleyblank",
  title =        "Equi-Matchable Graphs",
  journal =      "Graphs Combin.",
  year =         "1984",
  pages =        "239--254",
}

@TechReport{sep:PochetWolsey:92,
  author =       "Y. Pochet and L. A. Wolsey",
  title =        "Integer Knapsack and Flow Covers with Divisible
                 Coefficients Polyhedra, Optimization and Separation",
  institution =  "Universite Catholique de Louvain",
  year =         "1992",
  number =       "9218",
  address =      "Louvain-La-Neuve/Belgien",
}

@Article{sep:Podinovskii:72,
  author =       "V. V. Podinovskii",
  title =        "Lexicographical Problems of Linear Programming",
  journal =      "Zh. Vychisl. Mat. i Mat. Fiz.",
  year =         "1972",
  volume =       "12",
  pages =        "1568--1571",
}

@Article{sep:Podinowskii:75,
  author =       "V. V. Podinowskii",
  title =        "Multi-Criterion Problems with Uniform Equivalent
                 Criteria",
  journal =      "Zh. Vychisl. Mat. i Mat. Fiz.",
  year =         "1975",
  volume =       "15",
  pages =        "330--344",
}

@TechReport{sep:Poljak:91,
  author =       "S. Poljak",
  title =        "On Existence Theorems",
  institution =  "Rheinische Friedr.-Wilhelms-Universit{\"a}t, Inst.
                 f{\"u}r {\"O}konometrie und OR",
  year =         "1991",
  number =       "91697-OR",
  address =      "Bonn",
  pages =        "13",
}

@TechReport{sep:Poljak:92,
  author =       "S. Poljak",
  title =        "Nonpolyhedral Relaxations of Graph-Bisection
                 Problems",
  institution =  "Techn. Univ. Graz, Inst. f. Mathemathematik",
  year =         "1992",
  number =       "244",
  address =      "Graz",
  pages =        "25",
}

@TechReport{sep:PoljakRendl:91,
  author =       "S. Poljak and F. Rendl",
  title =        "Solving the max-cut problem using eigenvalues",
  institution =  "Techn. Univ. Graz, Inst. f. Mathematik",
  year =         "1991",
  number =       "199",
  address =      "Graz",
  pages =        "31",
}

@TechReport{sep:PoljakRendl:93,
  author =       "Svatopluk Poljak and Franz Rendl",
  title =        "Computational Experiments with Node and Edge
                 Relaxations of the Max - Cut Problem",
  institution =  "Institut f{\"u}r Mathematik",
  year =         "1993",
  number =       "266",
  address =      "Technische Universit{\"a}t Graz",
}

@Article{sep:PollackSharirRote:89,
  author =       "R. Pollack and M. Sharir and G. Rote",
  title =        "Computing the Geodesic Center of a Simple Polygon",
  journal =      "Discrete Comp. Geom.",
  year =         "1989",
  volume =       "4",
  number =       "6",
  pages =        "611--626",
}

@Article{sep:Pollatscheck:76,
  author =       "M. A. Pollatscheck",
  title =        "Personnel Assignment by Multiobjekctive Programming",
  journal =      "Z. Oper. Res. Ser. A-B",
  year =         "1976",
  volume =       "20",
  pages =        "161--170",
}

@Article{sep:Polyak:67,
  author =       "B. T. Polyak",
  title =        "A General Method of Solving Extremum Problems",
  journal =      "Soviet Math. Dokl.",
  year =         "1967",
  volume =       "8",
  pages =        "593--597",
}

@Article{sep:Polyak:69,
  author =       "B. T. Polyak",
  title =        "Minimization of Unsmooth Functionals",
  journal =      "Zh. Vychisl. Mat. i Mat. Fiz.",
  year =         "1969",
  volume =       "9",
  pages =        "509--521",
}

@TechReport{sep:Polyak:88a,
  author =       "R. A. Polyak",
  title =        "Modified Barrier Functions in Linear Programming",
  institution =  "13th International Symposium on Mathematical
                 Programming",
  year =         "1988",
  address =      "Tokyo",
  pages =        "1",
}

@TechReport{sep:Polyak:88b,
  author =       "R. A. Polyak",
  title =        "The Newton Method for Simultaneous Solution of the
                 Dual Pair Linear Programming Problems.",
  institution =  "13th International Symposium on Mathematical
                 Programming",
  year =         "1988",
  address =      "Tokyo",
  pages =        "1",
}

@Article{sep:Polyak:88c,
  author =       "R. A. Polyak",
  title =        "Smooth Optimization Methods for Minimax Problems",
  journal =      "SIAM J. Control Optim.",
  year =         "1988",
  volume =       "36",
  pages =        "1274--1286",
}

@TechReport{sep:Polyak:89a,
  author =       "R. A. Polyak",
  title =        "Modified Barrier Functions",
  institution =  "IBM Thomas J. Watson Research Center",
  year =         "1989",
  number =       "RC 14602",
  address =      "Yorktown Heights, NY",
  pages =        "51",
}

@TechReport{sep:Polyak:89b,
  author =       "R. Polyak",
  title =        "The Nonlinar Rescaling Principle in Linear
                 Programming",
  institution =  "IBM Thomas J. Watson Research Center",
  year =         "1989",
  number =       "RC 15030",
  address =      "Yorktown Heights, NY",
  pages =        "30",
}

@TechReport{sep:Polyak:91,
  author =       "R. Polyak",
  title =        "Modified Barrier Functions (Theory and Methods)",
  institution =  "IBM Thomas J. Watson Research Center",
  year =         "1991",
  number =       "RC 15886",
  address =      "Yorktown Heights, NY",
  pages =        "61",
}

@Article{sep:Ponstein:72,
  author =       "J. Ponstein",
  title =        "On the Maximal Flow Problem with Real Arc Capacities",
  journal =      "Math. Programming",
  year =         "1972",
  volume =       "3",
  pages =        "254--256",
}

@Article{sep:PorteusYormark:72,
  author =       "E. L. Porteus and J. S. Yormark",
  title =        "More on Min-Max Allocation",
  journal =      "Management Sci.",
  year =         "1972",
  volume =       "18",
  pages =        "502--507",
}

@Article{sep:PosnerWu:81,
  author =       "M. E. Posner and C. T. Wu",
  title =        "Linear Max-Min Programming",
  journal =      "Math. Programming",
  year =         "1981",
  volume =       "20",
  pages =        "166--172",
}

@InProceedings{sep:Powell:83,
  author =       "M. J. D. Powell",
  title =        "On the Rate of Convergence of Variable Metric
                 Algorithms for Unconstrained Optimization",
  booktitle =    "Proceedings of the International Congress of
                 Mathematicians",
  year =         "1983",
  pages =        "1525--1539",
  address =      "Warszawa",
}

@TechReport{sep:ProdonLieblingGroeflin:85,
  author =       "A. Prodon and T. M. Liebling and H. Gr{\"o}flin",
  title =        "Steiner's Problem on Two-Trees",
  institution =  "Ecole Polytechnique F\'{e}d\'{e}rale de Lausanne,
                 D\'{e}p. de. Matem.",
  year =         "1985",
  number =       "RO 850315",
  address =      "Lausanne",
  pages =        "24",
}

@Article{sep:Proemel:89,
  author =       "H. J. Pr{\"o}mel",
  title =        "Some Remarks on Natural Orders for Combinatorial
                 Cubes",
  journal =      "Discrete Math.",
  year =         "1989",
  number =       "1/2",
  volume =       "73",
  pages =        "189--198",
}

@TechReport{sep:ProemelVoigt:85,
  author =       "H. J. Pr{\"o}mel and B. Voigt",
  title =        "Graham-Rothschild Parameter sets",
  institution =  "Institut f{\"u}r {\"O}konometrie und Operations
                 Research, Universit{\"a}t Bonn",
  year =         "1985",
  number =       "85403-OR",
  address =      "Bonn",
  pages =        "40",
}

@Article{sep:PudlakTuma:70,
  author =       "P. Pudl\'{a}k and J. T\'{u}ma",
  title =        "Every finite lattice can be embedded in the lattice of
                 all Equivalences over a finite set (Preliminary
                 communication)",
  journal =      "Mathematica (Cluj)",
  year =         "1970",
  volume =       "35",
  pages =        "159--186",
}

@Article{sep:PudlakTuma:77,
  author =       "P. Pudl\'{a}k and J. T\'{u}ma",
  title =        "Every finite lattice can be embedded in the lattice of
                 all Equivalences over a finite set (Preliminary
                 communication)",
  journal =      "Comment. Math. Univ. Carolin.",
  year =         "1977",
  volume =       "18",
  pages =        "409--?",
}

@Article{sep:PudlakTuma:80,
  author =       "P. Pudl\'{a}k and J. T\'{u}ma",
  title =        "Every finite lattice can be embedded in the lattice of
                 all equivalences over a finite set",
  journal =      "to appear in Algebra Universalis,ALGEU",
  year =         "1980",
  pages =        "29",
}

@TechReport{sep:Puetz:78a,
  author =       "W. P{\"u}tz",
  title =        "Numerische Untersuchungen zum Chinesischen
                 Postbotenproblem",
  institution =  "Techn. Univ., Institute f{\"u}r Mathematik",
  year =         "1978",
  address =      "Graz",
  pages =        "9",
}

@TechReport{sep:Puetz:78b,
  author =       "W. P{\"u}tz",
  title =        "Numerische Untersuchungen zum Chinesischen
                 Postbotenproblem",
  institution =  "TU, Inst. f. Mathematik II",
  year =         "1978",
  address =      "Graz",
  pages =        "27",
}

@InProceedings{sep:Pulleyblank:79,
  author =       "W. R. Pulleyblank",
  title =        "Polyhedral Optimization and the Travelling Salesman
                 Problem",
  booktitle =    "Proceedings of the Eighth Manitoba Conference on
                 Numerical Mathematics and Computing",
  year =         "1979",
  editor =       "D. Mac Carthy and H. C. Williams",
  pages =        "51--64",
  organization = "Congressus Numerantium XXII",
  address =      "Winnipeg",
  publisher =    "Utilitas",
}

@Article{sep:Pulleyblank:81a,
  author =       "W. R. Pulleyblank",
  title =        "Total Dual Integrality and b-Matchings",
  journal =      "Oper. Res. Lett.",
  year =         "1981",
  volume =       "1",
  pages =        "28--30",
}

@TechReport{sep:Pulleyblank:81b,
  author =       "W. R. Pulleyblank",
  title =        "On Minimizing Setups in Precedence Constrained
                 Scheduling",
  institution =  "Univ. Bonn, Inst. f. {\"O}konometrie und OR",
  year =         "1981",
  number =       "81185-OR",
  address =      "Bonn",
  pages =        "32",
}

@InProceedings{sep:PulleyblankEdmonds:72,
  author =       "W. Pulleyblank and J. Edmonds",
  title =        "Facets of 1-Matchings Polyhedra",
  booktitle =    "Hypergraph Seminar, Proc. of the 1st Seminar on
                 Hypergraphs, Ohio State Univ., Columbus 1972",
  year =         "1972",
  editor =       "C. Berge and D. Ray-Chaudhuri",
  pages =        "214--242",
  organization = "Lecture Notes in Mathematics, 411",
  address =      "Berlin",
  publisher =    "Springer",
}

@Article{sep:PursgloveBoffey:8x,
  author =       "C. J. Pursglove and T. B. Boffey",
  title =        "Heuristic Improvement Methods: some first Results on
                 Starting Solutions",
  journal =      "?",
  year =         "198x",
  pages =        "15",
}

@TechReport{sep:QiBalas:90,
  author =       "L. Qi and E. Balas",
  title =        "A New Class of Facet-Defining Inequalities for the
                 Three-Index Assignment Polytope",
  institution =  "Carnegie Mellon University",
  year =         "1990",
  number =       "563",
  address =      "Pittsburgh, Pennsylvania",
  pages =        "16",
}

@TechReport{sep:Qin:90,
  author =       "Y. Qin",
  title =        "Optimum Path Problems in Networks",
  institution =  "Wuhan Iron and Steel University, Dep. of Management
                 Engineering",
  year =         "1990",
  address =      "Wuhan, China",
  pages =        "1--5.1.9",
}

@TechReport{sep:Queyranne:92,
  author =       "Maurice Queyranne and Frits Spieksma and Fabio
                 Tardella",
  title =        "A General Class of Greedily Solvable Linear Programs",
  institution =  "University of British Columbia",
  month =        sep,
  year =         "1992",
  address =      "Vancouver,Canada",
  annote =       "Extended Abstract",
}

@InCollection{sep:Radzik:1992,
  author =       "T. Radzik",
  title =        "Minimizing capacity violations in a transshipment
                 network",
  booktitle =    "Proc. 3rd ACM-SIAM Symposium on Foundations of
                 Computer Science",
  year =         "1992",
  pages =        "185--194",
}

@TechReport{sep:RapcsakThang:92,
  author =       "T. Rapcs\'{a}k and T. T. Thang",
  title =        "Polynomial variable metric algorithms for linear
                 programming",
  institution =  "Computer and Automation Institute, Hungarian Academy
                 of Science",
  year =         "1992",
  address =      "Budapest",
  pages =        "14",
}

@Article{sep:Recski:80,
  author =       "A. Recski",
  title =        "Network Theory and Transversal Matroids",
  journal =      "Discrete Appl. Math.",
  year =         "1980",
  volume =       "2",
  pages =        "311--326",
}

@Article{sep:Recski:84,
  author =       "A. Recski",
  title =        "A Network Theory to the Rigidity of Skeletal
                 Structures, Part {I}. Modelling and Interconnection",
  journal =      "Discrete Appl. Math.",
  year =         "1984",
  volume =       "7",
  pages =        "313--324",
}

@TechReport{sep:Reinelt:90,
  author =       "G. Reinelt",
  title =        "{TSPLIB} - {A} Traveling Salesman Problem Library",
  institution =  "Universit{\"a}t Augsburg, Institut f{\"u}r
                 Mathematik",
  year =         "1990",
  number =       "250",
  address =      "Augsburg",
  pages =        "18",
}

@TechReport{sep:RendlVanderbeiWolkowicz:93,
  author =       "Franz Rendl and Robert J. Vanderbei and Henry
                 Wolkowicz",
  title =        "Interior Point Methods for Max - Min Eigenvalue
                 Problems",
  institution =  "Institut f{\"u}r Mathematik",
  year =         "1993",
  number =       "264",
  address =      "Technische Universit{\"a}t Graz",
}

@TechReport{sep:RendlWoeginger:90,
  author =       "F. Rendl and G. Woeginger",
  title =        "Reconstructing Sets of orthogonal Line Segments in the
                 Plane",
  institution =  "Techn. Universit{\"a}t Graz, Institut f{\"u}r
                 Mathematik",
  year =         "1990",
  number =       "160",
  address =      "Graz",
  pages =        "9",
}

@TechReport{sep:RendlWolkowicz:88,
  author =       "F. Rendl and H. Wolkowicz",
  title =        "Applications of Parametric Programming and Eigenvalue
                 Maximization to the Quadratic Assignment Problem",
  institution =  "Techn. Universit{\"a}t Graz",
  year =         "1988",
  number =       "88-113",
  address =      "Graz",
  pages =        "13",
}

@TechReport{sep:RendlWolkowicz:90,
  author =       "F. Rendl and H. Wolkowicz",
  title =        "A Projection Technique for Partitioning the Nodes of a
                 Graph",
  institution =  "Techn. Universit{\"a}t Graz, Institut f{\"u}r
                 Mathematik",
  year =         "1990",
  number =       "169",
  address =      "Graz",
  pages =        "21",
}

@Article{sep:Renegar:88a,
  author =       "J. Renegar",
  title =        "Rudiments of an Average Case Complexity Theory for
                 Piecewise-Linear Path Following Algorithms",
  journal =      "Math. Programming",
  year =         "1988",
  volume =       "40",
  pages =        "113--163",
}

@Article{sep:Renegar:88b,
  author =       "J. Renegar",
  title =        "A Polynomial-Time Algorithm, Based on Newton's Method,
                 for Linear Programming",
  journal =      "Math. Programming",
  year =         "1988",
  volume =       "40",
  pages =        "59--93",
}

@TechReport{sep:RenegarShub:88,
  author =       "J. Renegar and M. Shub",
  title =        "Simplified Complexity Analysis for Newton {LP}
                 Methods",
  institution =  "Cornell University, College of Engineering",
  year =         "1988",
  number =       "807",
  address =      "Ithaca, NY",
  pages =        "27",
}

@TechReport{sep:ResendeVeiga:92,
  author =       "M. G. C. Resende and G. Veiga",
  title =        "An Efficient Implementation of a Network Interior
                 Point Method",
  institution =  "AT \& T Bell Laboratories",
  year =         "1992",
  address =      "Murray Hill, NJ",
  pages =        "39",
}

@Article{sep:RheeTalagrand:89,
  author =       "W.t. Rhee and M. Talagrand",
  title =        "A Sharp Deviation Inequality for the Stochastic
                 Traveling Salesman Problem",
  journal =      "Ann. Probab.",
  year =         "1989",
  volume =       "17",
  pages =        "1--8",
}

@InProceedings{sep:Rial:66,
  author =       "J. F. Rial",
  title =        "The Resolution of Conditional Scheduling Conflicts",
  booktitle =    "Pre-Prints of the Proceedings of the Fourth
                 International Conference of Operational Research,
                 Booklet F-I",
  year =         "1966",
  pages =        "71--92",
  address =      "Boston",
  publisher =    "IFORS (633 -- 640 p.)",
}

@Article{sep:Ribeiro:84,
  author =       "C. Ribeiro",
  title =        "Performance evaluation of vector implementations of
                 combinatorial algorithms",
  journal =      "Parallel Comput.",
  year =         "1984",
  volume =       "1",
  pages =        "287--294",
}

@Article{sep:RicheyParker:85,
  author =       "M. B. Richey and R. G. Parker",
  title =        "An Efficiently Solvable Case of the Minimum Weight
                 Equivalent Subgraph Problem",
  journal =      "Networks",
  year =         "1985",
  volume =       "15",
  pages =        "217--228",
}

@Article{sep:RicheyParker:86,
  author =       "M. B. Richey and R. G. Parker",
  title =        "On Multiple Steiner Subgraph Problems",
  journal =      "Networks",
  year =         "1986",
  volume =       "16",
  pages =        "423--438",
}

@TechReport{sep:Ritter:63,
  author =       "K. Ritter",
  title =        "{\"U}ber Probleme parameterabh{\"a}ngiger
                 Planungsrechnung",
  institution =  "DFVLR",
  year =         "1963",
  number =       "238",
  address =      "Porz-Wahn",
  pages =        "86",
}

@Article{sep:RitterBestBraeuningerRobison:81,
  author =       "K. Ritter and M. J. Best and J. Br{\"a}uninger and S.
                 M. Robinson",
  title =        "A Globally and Quadratically Convergent Algorithm for
                 General Nonlinear Programming Problems",
  journal =      "Computing",
  year =         "1981",
  volume =       "26",
  pages =        "141--153",
}

@Article{sep:RobertFerland:68,
  author =       "P. Robert and J. Ferland",
  title =        "Generalisation De {L}'algorithme de Warshall",
  journal =      "Revue Francaise d'Informatique et de Recherche
                 Op\'{e}rationelle",
  year =         "1968",
  volume =       "2",
  pages =        "71--85",
}

@InProceedings{sep:Roeck:80,
  author =       "H. R{\"o}ck",
  title =        "Scaling Techniques for Minimal Cost Network Flows",
  booktitle =    "Discrete Structures and Algorithms",
  year =         "1980",
  editor =       "U. Pape",
  pages =        "182--191",
  address =      "M{\"u}nchen",
  publisher =    "Hanser",
}

@TechReport{sep:Roedder:7,
  author =       "W. R{\"o}dder",
  title =        "A Duality Theory for Linear Vector Optimum Problems",
  institution =  "RWTH, Lehrstuhl f{\"u}r Unternehmensforschung",
  year =         "197x",
  address =      "Aachen",
  pages =        "405--407",
}

@Article{sep:Roos:75,
  author =       "G. T. Ross",
  title =        "A Branch and Bound Algorithm for the Generalized
                 Assignment Problem",
  journal =      "Math. Programming",
  year =         "1975",
  volume =       "8",
  pages =        "91--103",
}

@TechReport{sep:Roos:84,
  author =       "K. Roos",
  title =        "Karmarkar's Polynomial-Time Method for Linear
                 Programming",
  institution =  "Delt University of Technology",
  year =         "1984",
  address =      "Delft",
  pages =        "1--20",
}

@TechReport{sep:Roos:85a,
  author =       "C. Roos",
  title =        "On Karmarkar's projective method for linear
                 programming",
  institution =  "Delft University of Technology, Dep. of Mathematics
                 and Informatics",
  year =         "1985",
  number =       "85-23",
  address =      "Delft",
  pages =        "63",
}

@TechReport{sep:Roos:85b,
  author =       "C. Roos",
  title =        "A pivoting rule for the simplex method which is
                 related to Karmarkar's potential function",
  institution =  "Delft University of Technology, Dep. of Mathematics
                 and Informatics",
  year =         "1985",
  address =      "Delft",
  pages =        "14",
}

@Article{sep:Roos:89,
  author =       "C. Roos",
  title =        "A new, trajectory following polynomial-time algorithm
                 for the linear programming problem",
  year =         "1989",
  journal =      "J. Optim. Theory Appl.",
  volume =       "63",
  number =       "2",
  pages =        "433--458",
}

@TechReport{sep:Roos:90,
  author =       "C. Roos",
  title =        "A Projective Variant o the Approximate Center Method
                 for Linear Programming",
  institution =  "Delft University of Technology, Dep. of Mathematics
                 and Informatics",
  year =         "1990",
  number =       "90-83",
  address =      "Delft",
  pages =        "25",
}

@TechReport{sep:RoosVial:90a,
  author =       "C. Roos and J.-Ph. Vial",
  title =        "A Polynomial Method of Approximate Centers for Linear
                 Programming",
  institution =  "Delft University of Technology, Dep. of Mathematics
                 and Computer Science",
  year =         "1990",
  address =      "Delft",
  pages =        "21",
  note =         "to appear in Mathematical Programming",
}

@TechReport{sep:RoosVial:90b,
  author =       "C. Roos and J.-Ph. Vial",
  title =        "Lon Steps with the Logarithmic Penalty Barrier
                 function in linear programming",
  year =         "1990",
  journal =      "?",
  pages =        "433--441",
}

@TechReport{sep:Rosenfeld:8,
  author =       "A. Rosenfeld",
  title =        "How many are a Few",
  institution =  "University of Maryland",
  year =         "198x",
  address =      "College Park, MD 20742",
  pages =        "139--143",
}

@Article{sep:RosenkrantzStearnsLewis:77,
  author =       "D. J. Rosenkrantz and R. E. Stearns and P. M. Lewis
                 II",
  title =        "An Analysis of Several Heuristics for the Traveling
                 Salesman Problem",
  journal =      "SIAM J. Comput.",
  year =         "1977",
  volume =       "6",
  pages =        "563--581",
}

@TechReport{sep:Rote:84,
  author =       "G. Rote",
  title =        "The Solution Sets of Extremal Equations",
  institution =  "Techn. Univ. Graz, Institut f{\"u}r Mathematik",
  year =         "1984",
  number =       "S 32/01",
  address =      "Graz",
  pages =        "58",
}

@Article{sep:Rote:85,
  author =       "G. Rote",
  title =        "A Systolic Array for the Algebraic Path Problem
                 (shortest path, matrix inversion)",
  year =         "1985",
  journal =      "Computing",
  volume =       "34",
  pages =        "191--219",
}

@TechReport{sep:Rote:88a,
  author =       "G. Rote",
  title =        "The {N}-line Traveling Salesman Problem",
  institution =  "Techn. Universit{\"a}t Graz",
  year =         "1988",
  number =       "1988-109",
  address =      "Graz",
  pages =        "18",
}

@TechReport{sep:Rote:88b,
  author =       "G. Rote",
  title =        "A Problem of Image Processing with an Application of
                 Matroid Theory",
  institution =  "Techn. Universit{\"a}t Graz",
  year =         "1988",
  number =       "1988-122",
  address =      "Graz",
  pages =        "17",
}

@TechReport{sep:Rote:90a,
  author =       "G. Rote",
  title =        "The Convergence Rate of the Sandwich Algorithm for
                 Approximating Convex Functions",
  institution =  "Techn. Univ. Graz, Institut f{\"u}r Mathematik",
  year =         "1990",
  number =       "18",
  address =      "Graz",
  pages =        "23",
}

@TechReport{sep:Rote:90b,
  author =       "G. Rote",
  title =        "Sequences with subword complexity 2n",
  institution =  "Techn. Univ. Graz, Institut f{\"u}r Mathematik",
  year =         "1990",
  number =       "204",
  address =      "Graz",
  pages =        "15",
}

@Misc{sep:Rote:91,
  author =       "G. Rote",
  title =        "An improved time bound for computing maximum mean
                 cuts",
  howpublished = "presented at the 14th International Symposium on
                 Mathematical Programming",
  year =         "1991",
}

@TechReport{sep:Rote:92,
  author =       "G. Rote",
  title =        "Curves with Increasing Chords",
  institution =  "Techn. Univ. Graz, Institut f{\"u}r Mathematik",
  year =         "1992",
  number =       "245",
  address =      "Graz",
  pages =        "12",
}

@TechReport{sep:RoteRendl:85,
  author =       "G. Rote and F. Rendl",
  title =        "Minimizing the Density of Terminal Assignments in
                 Layout Design",
  institution =  "Technische Universit{\"a}t Graz, Institut f{\"u}r
                 Mathematik",
  year =         "1985",
  number =       "85/64",
  address =      "Graz",
  pages =        "13",
}

@TechReport{sep:RoteTichy:92,
  author =       "G. Rote and R. Tichy",
  title =        "The Dispersion of Point Sequences and Polygonal
                 Approximation of Curves",
  institution =  "TU Graz, Inst. f. Mathematik",
  year =         "1992",
  number =       "242",
  address =      "Graz",
  pages =        "15",
}

@TechReport{sep:RoteVogel:90,
  author =       "G. Rote and A. Vogel",
  title =        "A Heuristic for Decomposing Traffic Matrices in {TDMA}
                 Satellite Communication",
  institution =  "TU Graz, Inst. f. Mathematik",
  year =         "1990",
  number =       "73",
  address =      "Graz",
  pages =        "28",
}

@Article{sep:Rothblum:89,
  author =       "U. G. Rothblum",
  title =        "Generalized Scalings Satisfying Linear Equations",
  journal =      LINAA2,
  year =         "1989",
  volume =       "114/115",
  pages =        "765--783",
}

@TechReport{sep:RothblumSchneider:89a,
  author =       "U. G. Rothblum and H. Schneider",
  title =        "Characterizations of Max-Balanced Flows",
  institution =  "Rutgers University, Center for Operations Research",
  year =         "1989",
  number =       "90-01",
  address =      "New Brunswick, NJ",
  pages =        "23",
}

@Article{sep:RothblumSchneider:89b,
  author =       "U. G. Rothblum and H. Schneider",
  title =        "Scalings of Matrices which have Prespecified Row Sums
                 and Column Sums via Optimization",
  journal =      LINAA2,
  year =         "1989",
  volume =       "114/115",
  pages =        "737--764",
}

@TechReport{sep:RothblumSchneider:90,
  author =       "U. G. Rothblum and H. Schneider",
  title =        "Scaling Matrices to Prescribed Row and Column Maxima",
  institution =  "University of Wisconsin-Madison, Center for the
                 Mathematical Sciences",
  year =         "1990",
  number =       "91-3",
  address =      "Madison, Wisconsin",
  pages =        "23",
}

@TechReport{sep:Roundy:84,
  author =       "R. Roundy",
  title =        "A 98%-Effective Lot-Sizing Rule for a Multi-Product,
                 Multi-Stage Production/Inventory System",
  institution =  "Cornell University",
  year =         "1984",
  number =       "642",
  address =      "Ithaca, New York",
  pages =        "63",
}

@InProceedings{sep:Roy:75,
  author =       "B. Roy",
  title =        "Chemins et Circuits: Enumeration et Optimisation",
  booktitle =    "Combinatorial Programming: Methods and Applications",
  year =         "1975",
  editor =       "B. Roy",
  pages =        "105--136",
  address =      "Dordrecht",
  publisher =    "Reidel",
}

@Article{sep:Rudeanu:72,
  author =       "S. Rudeanu",
  title =        "On Boolean Matrix Equations",
  journal =      "Rev. Roumaine Math. Pures Appl.",
  year =         "1972",
  volume =       "VXII",
  pages =        "1075--1090",
}

@Article{sep:Rudeanu:83,
  author =       "S. Rudeanu",
  title =        "Linear Boolean Equations and Generalized Minterms",
  journal =      "Discrete Math.",
  year =         "1983",
  volume =       "43",
  pages =        "241--248",
}

@TechReport{sep:Rudolf:92,
  author =       "R. Rudolf",
  title =        "Recognition of d-Dimensional Monge Arrays",
  institution =  "Technische Universit{\"a}t Graz",
  year =         "1992",
  number =       "230",
  address =      "Graz",
}

@TechReport{sep:Rudolf:93,
  author =       "R{\"u}diger Rudolf",
  title =        "On Monge Sequences in $d$-dimensional arrays",
  institution =  "Institut f{\"u}r Mathematik",
  year =         "1993",
  number =       "247",
  address =      "Technische Universit{\"a}t Graz",
}

@TechReport{sep:RycerzJegier:8,
  author =       "A. Rycerz and J. Jegier",
  title =        "Investigation of the Simultaneous Solvability of
                 Linear Systems in Zn and {IR}n+",
  institution =  "University of Mining and Metalurgy, Institut of
                 Matematics",
  year =         "198x",
  address =      "Krak\'{o}w, Poland",
  pages =        "10",
}

@Article{sep:Sahba:85,
  author =       "M. Sahba",
  title =        "On the Solution of Nonlinear Inequalities in a Finite
                 Number of Iterations",
  journal =      "Numer. Math.",
  year =         "1985",
  volume =       "46",
  pages =        "229--236",
}

@Article{sep:SahniCho:79,
  author =       "S. Sahni and Y. Cho",
  title =        "Nearly on Line Scheduling of a Uniform Processor
                 System with Release Times",
  journal =      "SIAM J. Comput.",
  year =         "1979",
  volume =       "8",
  pages =        "275--285",
}

@Article{sep:SahniCho:80,
  author =       "S. Sahni and Y. Cho",
  title =        "Scheduling Independent Tasks with Due Times on a
                 Uniform Processor System",
  journal =      "J. Assoc. Comput. Mach.",
  year =         "1980",
  volume =       "27",
  pages =        "550--563",
}

@Article{sep:SahniGonzealez:76,
  author =       "S. Sahni and T. Gonzealez",
  title =        "{P}-Complete Approximation Problems",
  journal =      "J. Assoc. Comput. Mach.",
  year =         "1976",
  volume =       "23",
  pages =        "555--565",
}

@Article{sep:SahniHorowitz:78,
  author =       "S. Sahni and E. Horowitz",
  title =        "Combinatorial Problems: Reducibility and
                 Approximation",
  journal =      "Oper. Res.",
  year =         "1978",
  volume =       "26",
  pages =        "718--759",
}

@TechReport{sep:Saigal:71,
  author =       "R. Saigal",
  title =        "On a Generalization of Leontief Substitution Systems",
  institution =  "University of California, Center for Research in
                 Management Science",
  year =         "1971",
  number =       "CP-325",
  address =      "Berkeley",
  pages =        "10",
}

@Article{sep:Saito:62,
  author =       "T. Sait\`{o}",
  title =        "Ordered idempotent semigroups",
  journal =      "J. Math. Soc. Japan",
  year =         "1962",
  volume =       "14",
  pages =        "150--169",
}

@Article{sep:Saito:63,
  author =       "T. Sait\'{o}",
  title =        "Regular Elements in an Ordered Semigroup",
  journal =      "Pacific J. Math.",
  year =         "1963",
  volume =       "13",
  pages =        "263--295",
}

@TechReport{sep:Saito:7,
  author =       "T. Sait\'{o}",
  title =        "Ordered Completely Regular Semigroups",
  institution =  "Tokyo Gakugei University",
  year =         "197x",
  address =      "Tokyo",
  pages =        "295--308",
}

@Article{sep:Saito:74,
  author =       "T. Sait\`{o}",
  title =        "The Orderability of Idempotent Semigroups",
  journal =      "Semigroup Forum",
  year =         "1974",
  volume =       "7",
  pages =        "264--285",
}

@TechReport{sep:Salamanca:86,
  author =       "A. Salamanca",
  title =        "An inner ellipsoid algorithm for linear programming",
  institution =  "Universidad Polit\'{e}cnica, E.T.S. de Ingenieros
                 Industriales, Dep. of Mathematics",
  year =         "1986",
  number =       "1-ABR/86",
  address =      "Madrid/Spanien",
  pages =        "24",
}

@Article{sep:SarrafzadehLou:93,
  author =       "M. Sarrafzadeh and R. D. Lou",
  title =        "Maximum $k$-Covering of Weighted Transitive Graphs
                 with Applications",
  journal =      "Algorithmica",
  volume =       "9",
  pages =        "84--100",
  year =         "1993",
}

@TechReport{sep:ScheithauerTerno:79,
  author =       "G. Scheithauer and J. Terno",
  title =        "A new Extension Principle Algorithm for the Traveling
                 Salesman Problem",
  institution =  "Technische Univ. Dresden, Sektion Mathematik",
  year =         "1979",
  number =       "07-21-79",
  address =      "Dresden",
  pages =        "16",
}

@TechReport{sep:Schittkowski:8x,
  author =       "K. Schittkowski",
  title =        "{NLPSYS}: {A} data base system to support
                 interactively model building and numerical solution of
                 nonlinear programming problems",
  institution =  "Universit{\"a}t Bayreuth, Mathematisches Institut",
  year =         "198x",
  address =      "Bayreuth",
  pages =        "42",
}

@Article{sep:Schladofsky:84,
  author =       "W. Schladofsky",
  title =        "{TDMA}/{DSI}: Ein neues {\"U}bertragungsverfahren in
                 der Satellitentechnik",
  journal =      "{\"O}sterr. Postrundschau",
  year =         "1984",
  pages =        "6",
}

@TechReport{sep:SchlechtwegGirlichKowaljow:84,
  author =       "M. Schlechtweg and E. Girlich and M. M. Kowaljow",
  title =        "Die submodularen, monotonen Booleschen Funktionen",
  institution =  "Friedr.-Schiller-Universit{\"a}t Jena",
  year =         "1984",
  number =       "N/84/60",
  address =      "Jena",
  pages =        "6",
}

@TechReport{sep:Schmidt:85a,
  author =       "W. Schmidt",
  title =        "Greedoids and Searches in Directed Graphs",
  institution =  "Univ. Bonn, Inst. f{\"u}r {sep:\"O}konometrie und OR",
  year =         "1985",
  number =       "85388-OR",
  address =      "Bonn",
  pages =        "18",
}

@TechReport{sep:Schmidt:85b,
  author =       "W. Schmidt",
  title =        "A Min-Max Theorem for Greedoids",
  institution =  "Univ. Bonn, Inst. f{\"u}r {\"O}konometrie und OR",
  year =         "1985",
  number =       "85396-OR",
  address =      "Bonn",
  pages =        "12",
}

@Article{sep:Schmidt:88,
  author =       "W. Schmidt",
  title =        "A Characterization of undirected branching Greedoids",
  year =         "1988",
  journal =      "J. Combin. Theory Ser. B",
  volume =       "45",
  number =       "2",
  pages =        "160--184",
}

@TechReport{sep:Schneider:85,
  author =       "M. H. Schneider",
  title =        "A Complementary Pivoting Algorithm for Linear Network
                 Problems",
  institution =  "Princeton University, Dep. of Civil Engineering",
  year =         "1985",
  address =      "Princeton, NJ",
  pages =        "37",
}

@Article{sep:Schneider:89,
  author =       "M. H. Schneider",
  title =        "Matrix Scaling, Entropy Minimization, and Conjugate
                 Duality ({I}): Existence Conditions",
  journal =      LINAA2,
  year =         "1989",
  volume =       "114/155",
  pages =        "785--813",
}

@Article{sep:Schneider:90,
  author =       "M. H. Schneider",
  title =        "Matrix Scaling, Entropy Minimization, and Conjugate
                 Duality ({II}): The Dual Problem",
  year =         "1990",
  journal =      "Math. Programming",
  volume =       "Ser.B 48",
  number =       "1",
  pages =        "103--124",
}

@Article{sep:SchneiderSchneider:90,
  author =       "H. Schneider and M. H. Schneider",
  title =        "Towers and Cycle Covers for Max-Balanced Graphs",
  year =         "1990",
  journal =      "Combinatorics, graphtheory and computing",
  pages =        "159--170",
}

@Article{sep:SchneiderSchneider:91,
  author =       "H. Schneider and M. H. Schneider",
  title =        "Max-Balancing Weighted Directed Graphs and Matrix
                 Scaling",
  journal =      "Math. Oper. Res.",
  year =         "1991",
  volume =       "16",
  pages =        "208--220",
}

@Article{sep:Schnorr:78,
  author =       "C.-P. Schnorr",
  title =        "An Algorithm for Transitive Closure with Linear
                 Expected Time",
  journal =      "SIAM J. Comput.",
  year =         "1978",
  volume =       "7",
  pages =        "127--133",
}

@Article{sep:Schnorr:79,
  author =       "C. P. Schnorr",
  title =        "Bottlenecks and Edge Connectivity in Unsymmetrical
                 Networks",
  journal =      "SIAM J. Comput.",
  year =         "1979",
  volume =       "8",
  pages =        "265--274 p.",
}

@Article{sep:Schoch:70,
  author =       "M. Schoch",
  title =        "Ein Erweiterungsprinzip als Konzeption zur
                 {L}{\"o}sung kombinatorischer Optimierunsprobleme",
  journal =      "Math. OG Stat.",
  year =         "1970",
  volume =       "4",
  pages =        "265--280",
}

@Article{sep:Schoen:68,
  author =       "B. Sch{\"o}n",
  title =        "Ein Algol-Programm zur {L}{\"o}sung von
                 Engpa\ss{}zuordnungsproblemen",
  journal =      "EDV",
  year =         "1968",
  volume =       "4",
  pages =        "179--183",
}

@TechReport{sep:Schoensleben:80,
  author =       "P. Sch{\"o}nsleben",
  title =        "Ganzzahlige Polymatroid-Intersektions-Algorithmen",
  institution =  "Eidgen. Techn. Hochschule",
  year =         "1980",
  number =       "6620",
  address =      "Z{\"u}rich",
  pages =        "86",
}

@TechReport{sep:Scholz:77a,
  author =       "K. Scholz",
  title =        "Algebraisierung von Multi-Processor-Systemen",
  institution =  "Techn. Univ., Mathematische Institute",
  year =         "1977",
  address =      "Graz",
  pages =        "5",
}

@TechReport{sep:Scholz:77b,
  author =       "K. Scholz",
  title =        "On Scheduling Multi-Processor Systems with Algebraic
                 Objectives",
  institution =  "Universit{\"a}t, Mathematisches Institut",
  year =         "1977",
  number =       "77-15",
  address =      "K{\"o}ln",
  pages =        "22",
}

@Article{sep:ScholzSchulz:88,
  author =       "A. Scholz and G. Schulz",
  title =        "Strukturelle Analyse von Mehrgr{\"o}\ss{}ensystemen
                 als Vorstufe der Berechnung strukturbeschr{\"a}nkter
                 Regler",
  journal =      "msr, Berlin",
  year =         "1988",
  volume =       "31",
  number =       "3",
  pages =        "115--118",
}

@TechReport{sep:Schrader:81a,
  author =       "R. Schrader",
  title =        "A Note on Approximation Algorithms for Graph
                 Partitioning Problems",
  institution =  "Rhein. Friedr.-Wilh.-Univ., Inst. f. {\"O}konometrie
                 und OR",
  year =         "1981",
  number =       "81187-OR",
  address =      "Bonn",
  pages =        "5",
}

@TechReport{sep:Schrader:81b,
  author =       "R. Schrader",
  title =        "Approximations to Clustering and Subgraph Problems on
                 Trees",
  institution =  "Rhein. Friedr.-Wilh.-Univ., Inst. f. {\"O}konometrie
                 und OR",
  year =         "1981",
  number =       "81202-OR",
  address =      "Bonn",
  pages =        "14",
}

@TechReport{sep:Schrader:81c,
  author =       "R. Schrader",
  title =        "Ellipsoid Methods",
  institution =  "Rhein. Friedr.-Wilh.-Univ., Inst. f. {\"O}konometrie
                 und OR",
  year =         "1981",
  number =       "81174-OR",
  address =      "Bonn",
  pages =        "62",
}

@Article{sep:Schreck:86,
  author =       "H. Schreck",
  title =        "Experiences with an Implementation of Karmarkars
                 {LP}-Algorithm",
  journal =      "Methods Oper. Res.",
  volume =       "54",
  year =         "1986",
  pages =        "535--542",
}

@Article{sep:Schreier:83,
  author =       "H. Schreier",
  title =        "Grundlagen zur Konstruktion kombinatorischer
                 Algorithmen mit Hilfe einer Erzeugungsvorschrift
                 f{\"u}r ganzzahlige Vektoren",
  journal =      "Math. Operationsforsch. Statist. Ser. Optim.",
  year =         "1983",
  volume =       "14",
  pages =        "183--196",
}

@TechReport{sep:Schrijver:81,
  author =       "A. Schrijver",
  title =        "Faculty of Actuarial Science \& Econometrics",
  institution =  "University of Amsterdam, Faculty of Actuarial Science
                 \& Econometrics",
  year =         "1981",
  number =       "AE 17/81",
  address =      "Amsterdam",
  pages =        "5",
}

@TechReport{sep:Schrijver:82,
  author =       "A. Schrijver",
  title =        "Submodular Functions",
  institution =  "University of Amsterdam, Faculty of Actuarial Science
                 \&Econometrics",
  year =         "1982",
  number =       "AE N5/82",
  address =      "Amsterdam",
  pages =        "193",
}

@Article{sep:Schrijver:84,
  author =       "A. Schrijver",
  title =        "Proving Total Dual Integrality with Cross-Free
                 Families - {A} General Framework",
  journal =      "Math. Programming",
  year =         "1984",
  volume =       "29",
  pages =        "15--27",
}

@Article{sep:Schrijver:85,
  author =       "A. Schrijver",
  title =        "The New Linear Programming Method of Karmarkar",
  journal =      "Newsletter (CWI) Centrum voor Wiskunde en
                 Informatica",
  year =         "1985",
  volume =       "8",
  pages =        "14",
}

@InProceedings{sep:Schrijver:86,
  author =       "A. Schrijver",
  title =        "Polyhedral Combinatorics - Some Recent Developments
                 and Results",
  booktitle =    "Proceedings of the international Congress of
                 Mathematicans",
  year =         "1986",
  pages =        "1431--1443",
  address =      "Berkeley, California",
}

@TechReport{sep:Schrijver:88a,
  author =       "A. Schrijver",
  title =        "Disjoint Homotopic Paths and Trees in a Planar Graph.
                 {I}. Description of the Method",
  institution =  "Tilburg University, Department of Econometrics",
  year =         "1988",
  address =      "LE Tilburg, Holland",
  pages =        "3.18",
}

@TechReport{sep:Schrijver:88b,
  author =       "A. Schrijver",
  title =        "Disjoint Homotopic Paths and Trees in a Planar Graph.
                 {II}. Congrectness of the Method",
  institution =  "Tilburg University, Department of Econometrics",
  year =         "1988",
  address =      "LE Tilburg, Holland",
  pages =        "5.7",
}

@TechReport{sep:Schrijver:88c,
  author =       "A. Schrijver",
  title =        "Disjoint Homotopic Paths and Trees in a Planar Graph.
                 {III}. Disjoint Trees",
  institution =  "Tilburg University, Department of Econometrics",
  year =         "1988",
  address =      "LE Tilburg, Holland",
  pages =        "7.5",
}

@Article{sep:Schrijver:91,
  author =       "A. Schrijver",
  title =        "On Total Dual Integrality",
  journal =      LINAA2,
  year =         "1981",
  volume =       "38",
  pages =        "27--32",
}

@TechReport{sep:Schrijver:92,
  author =       "A. Schrijver",
  title =        "Finding k disjoint paths in a directed planar graph",
  institution =  "Mathematical Center and University of Amsterdam",
  year =         "1992",
  address =      "Amsterdam",
  pages =        "7",
}

@TechReport{sep:SchrijverSeymour:91,
  author =       "A Schrijver and P. D. Seymour",
  title =        "Packing {ODD} Path",
  institution =  "Mathematical Center and University of Amsterdam",
  year =         "1991",
  address =      "Amsterdam",
  pages =        "10",
}

@InProceedings{sep:Schroeter:84,
  author =       "N. Schr{\"o}ter",
  title =        "Average-Case Analysis of an Approximative Algorithm
                 for the Knapsack Problem",
  booktitle =    "Methods of Operations Research, 52",
  year =         "1984",
  editor =       "G. Hammer and D. Pallaschke",
  pages =        "455--468",
  address =      "K{\"o}nigstein/Ts.",
  publisher =    "Athen{\"a}um",
}

@Article{sep:SchubertZimmermann:85a,
  author =       "I. S. Schubert and U. Zimmermann",
  title =        "Nonlinear One-Parametric Bottleneck Linear
                 Programming",
  journal =      "Z. Oper. Res. Ser. A-B",
  year =         "1984",
  volume =       "29",
  pages =        "187--202",
}

@Article{sep:SchubertZimmermann:85b,
  author =       "I. S. Schubert and U. Zimmermann",
  title =        "One-Parametric Bottleneck Transportation Problems",
  journal =      "Annals of Operations Research",
  year =         "1985",
  volume =       "4",
  pages =        "343--369",
}

@Article{sep:SchultzMeyer:91,
  author =       "Gary L. Schultz and Robert R. Meyer",
  title =        "An Interior Point Method for Block Angular
                 Optimization",
  journal =      "Computers Ops. Res.",
  volume =       "1",
  number =       "4",
  pages =        "583--602",
  year =         "1991",
}

@Article{sep:Schulz:86,
  author =       "G. Schulz",
  title =        "Ein duales Verfahren zur {L}{\"o}sung des
                 Transportproblems mit zusa{\"a}tzlichen linearen
                 Restriktionen",
  journal =      "Wissenschaftl. Zeitschrift der TU {"}Otto von
                 Guericke{"} Magdeburg",
  year =         "1986",
  volume =       "31",
  pages =        "55--457",
}

@TechReport{sep:Schweigert:8x,
  author =       "D. Schweigert",
  title =        "Linear extensions and efficient Trees",
  institution =  "Universit{\"a}t Kaiserslautern, FB Mathematik",
  year =         "198x",
  address =      "Kaiserslautern",
  pages =        "17",
}

@Article{sep:Seiffart:82,
  author =       "E. Seiffart",
  title =        "Zur Struktur von Grapen zum Zuordnungspolyeder",
  journal =      "Wiss. Z. Tech. Hochsch. Magdeburg",
  year =         "1982",
  volume =       "26",
  pages =        "49--54",
}

@Article{sep:Seiffart:83,
  author =       "E. Seiffart",
  title =        "Graphentheoretische Optimalit{\"a}tsbedingungen und
                 die Vertauschungsnetzplan-Methode bei
                 Vertauschungsnetzpl{\"a}nen in der
                 Permutationsoptimierung",
  journal =      "Wiss. Z. Tech. Hochsch. Magdeburg",
  year =         "1983",
  volume =       "27",
  pages =        "105--110",
}

@Article{sep:Seiffart:85,
  author =       "E. Seiffart",
  title =        "Quasikonvexe Funktionen in der
                 Permutationsoptimierung",
  journal =      "Wiss. Z. Tech. Hochsch. Magdeburg",
  year =         "1985",
  volume =       "29",
  pages =        "85--88",
}

@Misc{sep:Selmer:77,
  author =       "Ernst S. Selmer",
  title =        "On the linear Diophantine Problem of Frobenius",
  month =        sep,
  year =         "1977",
  annote =       "Band 293/294",
}

@Article{sep:Semba:81,
  author =       "I. Semba",
  title =        "Generation of all the Balanced Parenthesis Strings ab
                 Lexicographical Order",
  journal =      "Inform. Process. Lett.",
  year =         "1981",
  volume =       "12",
  pages =        "188--192",
}

@TechReport{sep:SeshanAchazy:,
  author =       "C. R. Seshan and K. K. Achazy",
  title =        "On the Bottleneck Linear Programming Problem",
  institution =  "Indian Institute of Science",
  year =         "xxxx",
  address =      "Bangalore, Indien",
  pages =        "17",
}

@Article{sep:Setiono:93,
  author =       "Rudy Setiono",
  title =        "Interior Dual Least 2-Norm Algorithm for Linear
                 Programs",
  journal =      "SIAM J. Control and Optimization",
  volume =       "31",
  number =       "4",
  pages =        "875--899",
  year =         "1993",
}

@Article{sep:Shanno:88,
  author =       "D. F. Shanno",
  title =        "Computing Karmarkar Projections Quickly",
  year =         "1988",
  journal =      "Math. Programming",
  volume =       "Ser. A 41",
  number =       "1",
  pages =        "61--71",
}

@TechReport{sep:ShannoMarsten:85,
  author =       "D. F. Shanno and R. E. Marsten",
  title =        "On implementing Karmarkar's method",
  institution =  "University of California, Graduate school of
                 Administration",
  year =         "1985",
  number =       "85-1",
  address =      "Davis",
  pages =        "28",
}

@Proceedings{sep:Shapiro:77,
  editor =       "J. F. Shapiro",
  title =        "A Survey of Lagrangean Techniques for Discrete
                 Optimization",
  organization = "Conference on Discrete Optimization",
  year =         "1977",
  address =      "Cancouver",
  pages =        "41",
}

@Article{sep:ShardaSomarajan:86,
  author =       "R. Sharda and C. Somarajan",
  title =        "Comparative Performance of Advanced Microcomputer
                 {sep:LP} Systems",
  year =         "1986",
  journal =      "Comput. Oper. Res.",
  volume =       "13",
  pages =        "131--147",
}

@Article{sep:Sherali:87,
  author =       "H. D. Sherali",
  title =        "Algorithmic Insights and a Convergence Analysis of a
                 Karmarkar-type of Algorithm for Linear Programming
                 Problems",
  year =         "1987",
  journal =      "Naval Research Logistics Quarterly",
  volume =       "34",
  number =       "3",
  pages =        "399--416",
}

@Article{sep:SheraliSkarpnessKim:88,
  author =       "H. D. Sherali and B. O. Skarpness and B. Kim",
  title =        "An Assumption-Free Convergence Analysis for a
                 Perturbation of the Scaling Algorithm for Linear
                 Programs, with Application to the {L1} Esstimation
                 Problem",
  year =         "1988",
  journal =      "Naval Research Logistics Quarterly",
  volume =       "35",
  number =       "5",
  pages =        "473--492",
}

@Article{sep:Shier:73,
  author =       "D. R. Shier",
  title =        "A Decomposition Algorithm for Optimality Problems in
                 Tree-Structured Networks",
  journal =      "Discrete Math.",
  year =         "1973",
  volume =       "6",
  pages =        "175--189",
}

@Article{sep:Shier:76,
  author =       "D. R. Shier",
  title =        "Iterative Methods for Determining the k Shortest Paths
                 in a Network",
  journal =      "Networks",
  year =         "1976",
  volume =       "6",
  pages =        "205--229",
}

@TechReport{sep:ShihHsu:89a,
  author =       "W. K. Shih and W. L. Hsu",
  title =        "An Approximation Algorithm for Coloring Circular-Arc
                 Graphs",
  institution =  "Academia Sinica, Institute of Information Sciences",
  year =         "1989",
  address =      "Sinica, China",
  pages =        "11",
}

@Article{sep:ShihHsu:89b,
  author =       "W. K. Shih and W. L. Hsu",
  title =        "An 0(n log n + m log n) Maximum Weiht Clique Algorithm
                 for Circular-Arc Graphs",
  journal =      "Inform. Process. Lett.",
  year =         "1989",
  volume =       "31",
  pages =        "129--134",
}

@Article{sep:Shimbel:53,
  author =       "A. Shimbel",
  title =        "Structural Parameters of Communication Networks",
  journal =      "Bulletin of Mathematical Biophysics",
  year =         "1953",
  volume =       "15",
  pages =        "501--507",
}

@InProceedings{sep:Shimbel:55,
  author =       "A. Shimbel",
  title =        "Structure in Communication Nets",
  booktitle =    "Proceedings of the Symposium on Information Networks",
  year =         "1955",
  pages =        "199--203",
  address =      "New York",
  publisher =    "Polytechnic Institute of Brooklyn",
}

@Article{sep:Shimbel:y51,
  author =       "A. Shimbel",
  title =        "Applications of Matrix Algebra to Communication Nets",
  journal =      "Bulletin of Mathematical Biophysics",
  year =         "1951",
  volume =       "13",
  pages =        "165--178",
}

@Article{sep:Shub:87,
  author =       "M. Shub",
  title =        "On the Asymptotic Behavior of the Projective Rescaling
                 Algorithm for Linear Programming",
  journal =      "Journal of Complexity",
  year =         "1987",
  volume =       "3",
  pages =        "258--269",
}

@Article{sep:Shvartin:75,
  author =       "S. M. Shvartin",
  title =        "An Algorithm for Planning Transport in Minimum Time",
  journal =      "Zh. Vychisl. Mat. i Mat. Fiz.",
  year =         "1975",
  volume =       "15",
  pages =        "321--329",
}

@Article{sep:Sidney:75,
  author =       "J. B. Sidney",
  title =        "Decompositon Algorithms for Single-Machine Sequencing
                 with Precedence Relations and Deferral Costs",
  journal =      "Oper. Res.",
  year =         "1975",
  volume =       "23",
  pages =        "283--297",
}

@Article{sep:Singer:84a,
  author =       "I. Singer",
  title =        "Surrogate Dual Problems and Surrogate Lagrangians",
  journal =      "J. Math. Anal. Appl.",
  year =         "1984",
  volume =       "98",
  number =       "1",
  pages =        "31--71",
}

@Article{sep:Singer:84b,
  author =       "I. Singer",
  title =        "Optimization by Level Set Methods, {V}: Duality
                 Theorems for Perturbed Optimization Problems",
  journal =      "Math. Operationsforsch. Statist. Ser. Optim.",
  year =         "1984",
  volume =       "15 (1984)",
  number =       "1",
  pages =        "3--36",
}

@Article{sep:Singer:84c,
  author =       "I. Singer",
  title =        "A General Theory of Surrogate Dual and Perturbational
                 Extended Surrogate Dual Optimization Problems",
  journal =      "J. Math. Anal. Appl.",
  year =         "1984",
  volume =       "104",
  pages =        "351--389",
}

@Article{sep:Singer:85,
  author =       "I. Singer",
  title =        "Extensions of Functions of 0-1 Variables and
                 Applications to Combinatorial Optimization",
  journal =      "Numer. Funct. Anal. Optim.",
  year =         "1985",
  volume =       "7",
  pages =        "23--63",
}

@Article{sep:Singer:86,
  author =       "I. Singer",
  title =        "A General Theory of Dual Optimization Problems",
  year =         "1986",
  journal =      "J. Math. Anal. Appl.",
  volume =       "116",
  pages =        "77--130",
}

@Article{sep:Singer:89a,
  author =       "I. Singer",
  title =        "Some Relations between Combinatorial Min-Max
                 Equalities and Lagrangian Duality, via Coupling
                 Functions. {I}: Cardinality Results",
  journal =      "Rev. Roumaine Math. Pures Appl.",
  year =         "1989",
  volume =       "34",
  pages =        "455--491",
}

@Article{sep:Singer:89b,
  author =       "I. Singer",
  title =        "Some Relations between Combinatorial Min-Max
                 Equalities and Lagrangian Duality, via Coupling
                 Functions. {II}: Further Results",
  journal =      "Rev. Roumaine Math. Pures Appl.",
  year =         "1989",
  volume =       "34",
  pages =        "661--692",
}

@TechReport{sep:Skowronska:81,
  author =       "M. Skowronska",
  title =        "Characterization of middle digraphs of multi - and
                 general digraphs",
  institution =  "Wroclaw Univ., Institute of Computer Science",
  year =         "1981",
  number =       "N-99",
  address =      "Wroclaw",
  pages =        "20",
}

@TechReport{sep:Sleator:80,
  author =       "D. D. K. Sleator",
  title =        "An 0(nmlog n) Algorithm for Maximum Network Flow",
  institution =  "Stanford University, Dep. of Computer Science",
  year =         "1980",
  number =       "STAN-CS-80-831",
  address =      "Stanford, CA",
  pages =        "75",
}

@Article{sep:Slominski:77,
  author =       "L. Slominski",
  title =        "An Efficient Approach to the Bottleneck Assignment
                 Problem",
  journal =      "Bull. Acad. Polon. Sci. S{'e}r. Sci. Tech.",
  year =         "1977",
  volume =       "25",
  pages =        "17--(369)--23--(375)",
}

@Article{sep:Slominski:79,
  author =       "L. Slominski",
  title =        "Bottleneck assignment problem: an efficient
                 algorithm",
  journal =      "Arch. Automat. Telemech.",
  year =         "1979",
  volume =       "24",
  pages =        "469--482",
}

@Article{sep:Slominski:82,
  author =       "L. Slominski",
  title =        "Probalistic Analysis of Combinatorial Algorithms: {A}
                 Bibliography with Selected Annotations x",
  journal =      "Computing",
  year =         "1982",
  volume =       "28",
  pages =        "257--268",
}

@Article{sep:Smale:85,
  author =       "Steve Smale",
  title =        "On the Efficiency of Algorithms of Analysis",
  journal =      "Bulletin of the American Mathematical Society",
  volume =       "13",
  number =       "2",
  pages =        "87--121",
  year =         "1985",
}

@Article{sep:Smelyakov:82,
  author =       "S. V. Smelyakov",
  title =        "A Basis of Equivalence Classes of Paths in
                 Optimization Problems",
  journal =      "Kybernetika (Prague)",
  year =         "1982",
  volume =       "4",
  pages =        "51--54",
}

@Article{sep:SolomosDesrosiers:88,
  author =       "M. M. Solomon and J. Desrosiers",
  title =        "Time Window Constrained Routing and Scheduling
                 Problems",
  year =         "1988",
  journal =      "Transportation Sci.",
  volume =       "22",
  number =       "1",
  pages =        "1--13",
}

@InProceedings{sep:Sonnevend:87,
  author =       "Gy. Sonnevend",
  title =        "A New Method for Solving a Set of Linear (Convex)
                 Inequalities and its Applications",
  booktitle =    "Proc. 5th IFAC-IFORS Symp. on {"}Dynamic
                 Modelling...{"}",
  year =         "1987",
  editor =       "B. Martos",
  pages =        "6",
  publisher =    "Pergamon Press",
}

@Article{sep:SonnevendStoer:90,
  author =       "Gy. Sonnevend and J. Stoer",
  title =        "Global Ellipsoidal Approximations and Homotopy Methods
                 for Solving Convec Analytic Programs",
  journal =      "Appl. Math. Optim.",
  year =         "1990",
  volume =       "21",
  pages =        "139--165",
}

@Article{sep:SonnevendStoerZhao:91,
  author =       "G. Sonnevend and J. Stoer and G. Zhao",
  title =        "On the Complexity of Following the Central Path of
                 Linear Programs by Linear Extraplolation {II}",
  year =         "1991",
  journal =      "Math. Programming",
  volume =       "52",
  number =       "3",
  pages =        "527--553",
}

@TechReport{sep:SpieksmaWoeginger:93,
  author =       "Frits C. R. Spieksma and Gerhard J. Woeginger",
  title =        "The Computational Complexity of a Bin Packing Game",
  institution =  "Institut f{\"u}r Mathematik",
  year =         "1993",
  number =       "274",
  address =      "Technische Universit{\"a}t Graz",
}

@TechReport{sep:SpieksmaWoegingerYu:93,
  author =       "Frits C. R. Spieksma and Gerhard J. Woeginger and
                 Zhongliang Yu",
  title =        "Scheduling with Safety Distances",
  institution =  "Institut f{\"u}r Mathematik",
  year =         "1993",
  number =       "268",
  address =      "Technische Universit{\"a}t Graz",
}

@InProceedings{sep:Spielberg:82,
  author =       "K. Spielberg",
  title =        "Some Methods and Applications of Integer Programming",
  booktitle =    "Methods of Operations Research, 45",
  year =         "1982",
  editor =       "R. Henn et al.",
  pages =        "327--344",
  address =      "K{\"o}nigstein/Ts.",
  publisher =    "Athen{\"a}um",
}

@Article{sep:Spira:73,
  author =       "P. M. Spira",
  title =        "A new Algorithm for Finding all Shortest Paths in a
                 Graph of Positive Arcs in Average Time {O}(n2 log2 n)",
  journal =      "SIAM J. Comput.",
  year =         "1973",
  volume =       "2",
  pages =        "28--32",
}

@Article{sep:SpiraPan:75,
  author =       "P. M. Spira and A. Pan",
  title =        "On Finding and Updating Spanning Trees and Shortest
                 Paths",
  journal =      "SIAM J. Comput.",
  year =         "1975",
  volume =       "4",
  pages =        "375--380",
}

@Article{sep:Sreedharan:88,
  author =       "V. P. Sreedharan",
  title =        "A Note on the Modified Gram-Schmidt Process",
  journal =      "Internat. J. Comput. Math.",
  year =         "1988",
  volume =       "24",
  pages =        "277--290",
}

@Article{sep:Srinivasan:71,
  author =       "V. Srinivasan",
  title =        "A Hybrid Algorithm for the one Machine Sequencing
                 Problem to Minimize Total Tardiness",
  journal =      "Naval Research Logistics Quarterly",
  year =         "1971",
  volume =       "18",
  pages =        "317--327",
}

@Article{sep:Srinivasan:72,
  author =       "V. Srinivasan",
  title =        "Accelerated Algorithms for Labeling and Relabeling of
                 Trees, with Applications to Distribution Problems",
  journal =      "J. Assoc. Comput. Mach.",
  year =         "1972",
  volume =       "19",
  pages =        "712--726",
}

@Article{sep:Srinivasan:76,
  author =       "V. Srinivasan",
  title =        "Algorithms for Minimizing Total Cost, Bottleneck Time
                 and Bottleneck Shipment in Transportation Problems",
  journal =      "Naval Research Logistics Quarterly",
  year =         "1976",
  volume =       "23",
  pages =        "567--596",
}

@Article{sep:SrinivasanThompson:72,
  author =       "V. Srinivasan and G. L. Thompson",
  title =        "An Operator Theory of Parametric Programming for the
                 Transportation Problem-{I}",
  journal =      "Naval Research Logistics Quarterly",
  year =         "1972",
  volume =       "19",
  pages =        "205--252",
}

@Article{sep:SrinivasanThompson:73,
  author =       "V. Srinivasan and G. L. Thompson",
  title =        "Benefit-Cost Analysis of Coding Techniques for the
                 Primal Transportation Algorithm",
  journal =      "J. Assoc. Comput. Mach.",
  year =         "1973",
  volume =       "20",
  pages =        "194--213",
}

@Article{sep:SrinivasanThompson:77,
  author =       "V. Srinivasan and G. L. Thompson",
  title =        "Cost Operator Algorithms for the Transportation
                 Problem",
  journal =      "Math. Programming",
  year =         "1977",
  volume =       "12",
  pages =        "372--391",
}

@Article{sep:StanatMago:79,
  author =       "D. F. Stanat and G. A. Mag\'{o}",
  title =        "Minimizing Maximum Flows in Linear Graphs",
  journal =      "Networks",
  year =         "1979",
  volume =       "9",
  pages =        "333--361",
}

@Article{sep:Steihaug:83,
  author =       "T. Steihaug",
  title =        "The Conjugate Gradient Method and Trust Regions in
                 Large Scale Optimization",
  journal =      "SIAM J. Numer. Anal.",
  year =         "1983",
  volume =       "20",
  pages =        "626--637",
}

@Article{sep:Steinberg:61,
  author =       "L. Steinberg",
  title =        "The Backboard Wiring Problem: {A} Placement
                 Algorithm",
  journal =      "SIAM Rev.",
  year =         "1961",
  volume =       "3",
  pages =        "37--50",
}

@Article{sep:Stenzel:69,
  author =       "L. Stenzel",
  title =        "{\"U}ber eine Klasse geordneter Halgruppen mit
                 negativen Elementen",
  journal =      "Wissenschaftliche Zeitschrift",
  year =         "1969",
  volume =       "Jahrgang 13",
  pages =        "411--415",
}

@TechReport{sep:StratmannBurkard:76,
  author =       "K.-H. Stratmann and R. E. Burkard",
  title =        "Numerische Untersuchungen {\"u}ber Quadratische
                 Zuordungsprobleme",
  institution =  "Universit{\"a}t K{\"o}ln , Mathematisches Institut",
  year =         "1976",
  number =       "76-3",
  address =      "K{\"o}ln",
  pages =        "30",
}

@Article{sep:Streit:86,
  author =       "R. L. Streit",
  title =        "Solution of Systems of Complex Linear Equations in the
                 l Norm with Constraints on the Unknowns",
  journal =      "SIAM J. Sci. Statist. Comput.",
  year =         "1986",
  volume =       "7",
  pages =        "132--149",
}

@TechReport{sep:StrykSchlemmer:93,
  author =       "O. von Stryk and M. Schlemmer",
  title =        "Optimal Control of the Industrial Robot Manutec r3*",
  institution =  "Technische Universit{\"a}t M{\"u}nchen",
  year =         "1993",
  number =       "467",
  address =      "M{\"u}nchen",
}

@TechReport{sep:Sugihara:8,
  author =       "K. Sugihara",
  title =        "Program System for the Principal Partition of a
                 Bipartite Graph",
  institution =  "Electrotechnical Laboratory",
  year =         "198x",
  address =      "Ibaraki",
  pages =        "32",
}

@Article{sep:Sugihara:83,
  author =       "K. Sugihara",
  title =        "A Unifying Approach to Descriptive Geometry and
                 Mechanisms",
  journal =      "Discrete Appl. Math.",
  year =         "1983",
  volume =       "5",
  pages =        "313--328",
}

@Article{sep:Sugihara:84,
  author =       "K. Sugihara",
  title =        "Algebraic and Combinatorial Approach to the Analysis
                 of Line Drawings of Polyhedra",
  year =         "1984",
  journal =      "Discrete Appl. Math.",
  volume =       "9",
  pages =        "77--104",
}

@Article{sep:SugiharaIri:8,
  author =       "K. Sugihara and M. Iri",
  title =        "A Mathematical Approach to the Determination of the
                 Structure of Comcepts",
  journal =      "The Matrix and Tensor Quarterly",
  year =         "198x",
  volume =       "30",
  pages =        "62--75",
}

@TechReport{sep:SugiharaIri:89,
  author =       "K. Sugihara and M. Iri",
  title =        "Construction of the Voronoi Diagram for One Million
                 Generators in Single-Precision Arithmetic",
  institution =  "University of Tokyo, Faculty of Engineering",
  year =         "1989",
  address =      "Tokyo",
  pages =        "33",
}

@TechReport{sep:Suhl:86,
  author =       "U. Suhl",
  title =        "Entwicklungstendenzen von Mathematischer
                 Optimierungssoftware",
  institution =  "FR Angewandte Informatik, Freie Universit{\"a}t
                 Berlin",
  year =         "1986",
  address =      "Berlin",
  pages =        "18",
}

@Article{sep:Suhl:94,
  author =       "Uwe H. Suhl",
  title =        "{MOPS}-Mathematical {OPTIMIZATION} System",
  journal =      "European Journal of Operational Research",
  volume =       "72",
  pages =        "312--322",
  year =         "1994",
}

@TechReport{sep:Sutherland:82,
  author =       "W. R. S. Sutherland",
  title =        "Equivalent Linear Optimization Problems",
  institution =  "Dalhousie Univ., Dep. of Mathematics",
  year =         "1982",
  number =       "82-11",
  address =      "Halifax, Nova Scotia/Canada",
  pages =        "12",
}

@TechReport{sep:Svaricek:84,
  author =       "F. Svaricek",
  title =        "Numerische Berechnung der Anzahl von invarianten
                 Nullstellen mittels graphentheoretischer Algorithmen",
  institution =  "Universit{\"a}t - Gesamthochschule - Duisburg",
  year =         "1984",
  number =       "6/84",
  address =      "Duisburg",
  pages =        "17",
}

@Article{sep:Svaricek:86,
  author =       "F. Svaricek",
  title =        "Graphentheoretische Ermittlung der Anzahl von
                 strukturellen und strengen strukturellen invarianten
                 Nullstellen",
  year =         "1986",
  journal =      "Automatisierungstechnik",
  volume =       "34",
  pages =        "488--497",
}

@Article{sep:Swart:85a,
  author =       "E. R. Swart",
  title =        "How {I} Implemented the Karmarkar Algorithm in One
                 Evening",
  journal =      "APL Quote Quad",
  year =         "1985",
  volume =       "3",
  pages =        "13--16",
}

@TechReport{sep:Swart:85b,
  author =       "E. R. Swart",
  title =        "A modified version of the Karmarkar Algorithm",
  institution =  "The University of Guelph",
  year =         "1985",
  address =      "Guelph, Ontario/Canada",
  pages =        "29",
}

@TechReport{sep:Swart:86,
  author =       "E. R. Swart",
  title =        "{P} = {NP}",
  institution =  "Department of Mathematics \& Statistics, University of
                 Guelph",
  year =         "1986",
  address =      "Ontario, Canada",
  pages =        "40",
}

@Article{sep:Syslo:80,
  author =       "M. M. Syslo",
  title =        "Generalizations of the standard travelling salesman
                 problem",
  journal =      "Zastos. Mat.",
  year =         "1980",
  volume =       "16",
  pages =        "621--629",
}

@TechReport{sep:Syslo:81,
  author =       "M. M. Syslo",
  title =        "Graph Theory Conference (Abstracts)",
  institution =  "Wroclaw Univ., Instute of Computer Science",
  year =         "1981",
  number =       "N-89",
  address =      "Wroclaw",
  pages =        "68",
}

@Article{sep:Syslo:83,
  author =       "M. M. Syslo",
  title =        "Adjacency matrix equations and related problems:
                 Research Notes",
  journal =      "Comment. Math. Univ. Carolin.",
  year =         "1983",
  volume =       "24",
  pages =        "211--222",
}

@TechReport{sep:Syslo:85,
  author =       "Syslo M. M.",
  title =        "Remarks on Dillworth partially ordered sets",
  institution =  "Institut f{\"u}r {\"O}konometrie und Operations
                 Research, Universit{\"a}t Bonn",
  year =         "1985",
  number =       "85381-OR",
  address =      "Bonn",
  pages =        "9",
}

@InProceedings{sep:SysloProkurowski:83,
  author =       "M. M. Syslo and A. Proskurowski",
  title =        "On Halin Graphs",
  booktitle =    "Graph Theory",
  year =         "1983",
  editor =       "M. Borowiecki and J. W. Kennedy and M. M. Syslo",
  pages =        "248--256",
  organization = "Lecture Notes in Mathematics, 1018",
  address =      "Berlin",
  publisher =    "Springer",
}

@Article{sep:Szwac:71,
  author =       "W. Szwac",
  title =        "Some Remarks on the Time Transportation Problem",
  journal =      "Naval Research Logistics Quarterly",
  year =         "1971",
  volume =       "18",
  pages =        "473--485",
}

@InProceedings{sep:TaguchiIri:82,
  author =       "A. Taguchi and M. Iri",
  title =        "Continuum Appoximation to Dense Networks and Its
                 Application to the Analysis of Urban Road Networks",
  booktitle =    "Math. Programming Stud.",
  year =         "1982",
  editor =       "J.-L. Goffin and J.-M. Rosseau",
  pages =        "178--217",
  address =      "Amsterdam",
  publisher =    "North-Holland",
}

@Article{sep:Tamir:76,
  author =       "A. Tamir",
  title =        "On Totally Unimodular Matrices",
  journal =      "Networks",
  year =         "1976",
  volume =       "6",
  pages =        "373--382",
}

@Article{sep:Tamir:82,
  author =       "A. Tamir",
  title =        "On the Solution of Discrete Bottleneck Problems",
  journal =      "Discrete Appl. Math.",
  year =         "1982",
  volume =       "4",
  pages =        "299--302",
}

@Article{sep:TamuraTekeharaFukudaFujishigeKojima:88,
  author =       "A. Tamura and H. Tekehara and K. Fukuda and S.
                 Fujishige and M. Kojima",
  title =        "A Dual Interior Primal Simplex Method for Linear
                 Programming",
  year =         "1988",
  journal =      "J. Oper. Res. Soc. Japan",
  volume =       "31",
  number =       "3",
  pages =        "413--430",
}

@Article{sep:Tanabe:80,
  author =       "K. Tanabe",
  title =        "A Geometric Method in Nonlinear Programming 1,2",
  journal =      "J. Optim. Theory Appl.",
  year =         "1980",
  volume =       "30",
  pages =        "181--210",
}

@Article{sep:Tanabe:81,
  author =       "K. Tanabe",
  title =        "Feasibility-Improving Gradient-Acute-Projection
                 Methods: {A} Unified Approach to Nonlinear
                 Programming",
  journal =      "Lecture Notes in Num. Appl. Anal.",
  year =         "1981",
  volume =       "3",
  pages =        "57--76",
}

@Article{sep:Tanabe:85,
  author =       "K. Tanabe",
  title =        "Global Analysis of Continuous Analogues of the
                 Levenberg-Marquardt and Newton-Raphson Methods for
                 Solving Nonlinear Equations",
  journal =      "Ann. Inst. Statist. Math.",
  year =         "1985",
  volume =       "37",
  pages =        "189--203",
}

@TechReport{sep:Tanabe:87a,
  author =       "K. Tanabe",
  title =        "Complementarity-Enforcing Centered Newton Method for
                 Mathematical Programming: Global Method",
  institution =  "The Institute of Statistical Mathematics",
  year =         "1987",
  number =       "5",
  address =      "Tokyo",
  pages =        "118--144",
}

@TechReport{sep:Tanabe:87b,
  author =       "K. Tanabe",
  title =        "Complementarity-Enforcing Centered Newton Method for
                 Mathematical Programming",
  institution =  "Institute of Statistical Mathematics",
  year =         "1987",
  address =      "Tokyo",
  pages =        "32",
}

@TechReport{sep:Tanabe:87c,
  author =       "K. Tanabe",
  title =        "Algorithms for Computing Search Directions of the
                 Interior Point Methods for Linear Programming",
  institution =  "Institue of Statistical Mathematics",
  year =         "1987",
  address =      "Tokyo",
  pages =        "7",
}

@TechReport{sep:Tanabe:88a,
  author =       "K. Tanabe",
  title =        "A Posteriori Error Estimate for an Approcimate
                 Solution of a General Linear Programming Problem",
  institution =  "The Institute of Statistical Mathematics",
  year =         "1988",
  number =       "10",
  address =      "Tokyo",
  pages =        "118--120",
}

@InProceedings{sep:Tanabe:88b,
  author =       "K. Tanabe",
  title =        "Centered Newton Method for Mathematical Programming",
  booktitle =    "Proc. of the 13th IFIP Conference 1987",
  year =         "1988",
  editor =       "M. Iri and K. Yajima",
  pages =        "197--206",
  organization = "System Modelling and Optimization",
  publisher =    "Springer-Verlag",
}

@TechReport{sep:Tanabe:88c,
  author =       "K. Tanabe",
  title =        "Algorithms for Computing Search Directions of the
                 Interior Methods for Linear Programming",
  institution =  "The Institute of Statistical Mathematics",
  year =         "1988",
  number =       "10",
  address =      "Tokyo",
  pages =        "121--128",
}

@Article{sep:Tanabe:88d,
  author =       "K. Tanabe",
  title =        "Continuous Newton-Raphson Method for Solving an
                 Underdetermined System of Nonlinear Equations",
  journal =      "Nonlinear Anal.",
  year =         "1988",
  volume =       "3",
  pages =        "495--503",
}

@Article{sep:Tapiero:72,
  author =       "C. S. Tapiero",
  title =        "{K}-Class Assignments",
  journal =      "R.A.I.R.O.",
  year =         "1972",
  volume =       "3",
  pages =        "41--44",
}

@Article{sep:Tardos:85,
  author =       "E. Tardos",
  title =        "A Strongly Polynomial Minimum Cost Circulation
                 Algorithm",
  year =         "1985",
  journal =      "Combinatorica",
  volume =       "5",
  pages =        "247--255",
}

@Article{sep:Tardos:86,
  author =       "E. Tardos",
  title =        "A Strongly Polynomial Algorithm to Solve Combinatorial
                 Linear Programs",
  year =         "1985",
  journal =      "Oper. Res.",
  volume =       "34",
  pages =        "250--256",
}

@Article{sep:TardosToveyTrick:86,
  author =       "E. Tardos and Tovey C. A. and Trick Michael A.",
  title =        "Layered Augmenting Path Algorithms",
  year =         "1986",
  journal =      "Math. Oper. Res.",
  volume =       "11",
  pages =        "362--370",
}

@Article{sep:Tarjan:72,
  author =       "R. Tarjan",
  title =        "Depth-First Search and Linear Graph Algorithms",
  journal =      "SIAM J. Comput.",
  year =         "1972",
  volume =       "1",
  pages =        "146--160",
}

@Article{sep:Tarjan:75a,
  author =       "R. E. Tarjan",
  title =        "Efficiency of a Good But Not Linear Set Union
                 Algorithm",
  journal =      "J. Assoc. Comput. Mach.",
  year =         "1975",
  volume =       "22",
  pages =        "215--225",
}

@TechReport{sep:Tarjan:75b,
  author =       "R. E. Tarjan",
  title =        "Solving Path Problems on Directed Graphs",
  institution =  "Stanford Univ., Computer Science Dep.",
  year =         "1975",
  address =      "Stanford",
  pages =        "45",
}

@Article{sep:Tarjan:75c,
  author =       "R. E. Tarjan",
  title =        "Finding Optimum Branchings",
  journal =      "Networks",
  year =         "1975",
  volume =       "7",
  pages =        "25--35",
}

@TechReport{sep:Tarjan:8a,
  author =       "R. E. Tarjan",
  title =        "Graph Theory and Gaussian Elimination",
  institution =  "Stanford Univ., Computer Science Dep.",
  year =         "198x",
  address =      "Stanford",
  pages =        "1",
}

@TechReport{sep:Tarjan:8b,
  author =       "R. E. Tarjan",
  title =        "Sparse Matrix Computations",
  institution =  "?",
  year =         "198x",
  pages =        "19",
}

@TechReport{sep:Tarnowski:92,
  author =       "A. Tarnowski",
  title =        "Exact Polynomial Algorithm for Special Case of the
                 Two-Dimensional Cutting Stock Problem: {A} Guillotine
                 Pallet Loading Problem",
  institution =  "Belarusian State University, Department of
                 Mathematical Problems in CAD",
  year =         "1992",
  number =       "9205",
  address =      "Minsk, Belarus.",
  pages =        "28",
}

@Article{sep:TegzeVlach:88,
  author =       "M. Tegze and M. Vlach",
  title =        "Improved Bounds for the Range of Lateness on a Single
                 Machine",
  year =         "1988",
  journal =      "J. Oper. Res. Soc. Japan",
  volume =       "39",
  number =       "7",
  pages =        "675--680",
}

@TechReport{sep:Telley:89,
  author =       "H. Telley",
  title =        "Modelisation et Simulation Bidimensionnelle de la
                 Croissance des Polycristaux",
  institution =  "Ecole Polytechnique Federale de Lausanne",
  year =         "1989",
  number =       "780",
  address =      "Lausanne",
  pages =        "197",
}

@TechReport{sep:TerlakyZhang:91,
  author =       "T. Terlaky and S. Zhang",
  title =        "A Survey on Pivot Rules for Linear Programming",
  institution =  "Delft University of Technology, Faculty of Technical
                 Mathematics and Informatik",
  year =         "1991",
  number =       "91-99",
  address =      "Delft",
  pages =        "31",
}

@TechReport{sep:Teschke:78,
  author =       "L. Teschke",
  title =        "Algebraische Untersuchungen zur Theorie der konvexen
                 Optimierung",
  institution =  "Techn. Hochschule Ilmenau",
  year =         "1978",
  address =      "Ilmenau",
  pages =        "108",
}

@Article{sep:TeschkeHeidekrueger:76a,
  author =       "L. Teschke and G. Heidekr{\"u}ger",
  title =        "Zweifach assoziative {R}{\"a}ume,
                 Verbindungsr{\"a}ume, Konvexit{\"a}tsr{\"a}ume und
                 verallgemeinerte Konvexit{\"a}tsr{\"a}ume",
  journal =      "Wissenschaftliche Zeitschrift der PH
                 {"}N.K.Krupskaja{"}, Halle",
  year =         "1976",
  volume =       "14",
  pages =        "21--24",
}

@Proceedings{sep:TeschkeHeidekrueger:76b,
  editor =       "L. Teschke and G. Heidekr{\"u}ger",
  title =        "Trennung in verallgemeinerten
                 Konvexit{\"a}tsr{\"a}umen",
  year =         "1976",
  pages =        "73--76",
  organization = "21. Internationales wissenschaftliches Kolloquium",
  address =      "Ilmenau",
  publisher =    "TH Ilmenau",
}

@Article{sep:TeschkeZimmermann:79,
  author =       "L. Teschke and K. Zimmermann",
  title =        "Extremale Algebren und verallgemeinerte
                 Konvexit{\"a}tsr{\"a}ume",
  journal =      "Ekonom.-Mat. Obzor",
  year =         "1979",
  volume =       "15",
  pages =        "74--84",
}

@TechReport{sep:Thach:89,
  author =       "P. T. Thach",
  title =        "An Efficient Method for Min Convave Cost Flow Problems
                 under Circuitless Single-Source Uncapacitated
                 Networks",
  institution =  "Techn. Univ. Graz, Inst. f. Mathematik",
  year =         "1989",
  number =       "1989-147",
  address =      "Graz",
  pages =        "34",
}

@TechReport{sep:ThachBurkard:89a,
  author =       "P. T. Thach and R. E. Burkard",
  title =        "Numerical Experiments on an Efficient Method for the
                 Min Concave Cost Flow Problem over Circuitless,
                 Singe-Source, Uncapacitated Networks",
  institution =  "Techn. Univ. Graz, Inst. f. Mathematik",
  year =         "1989",
  number =       "1989-150",
  address =      "Graz",
  pages =        "10",
}

@TechReport{sep:ThachBurkard:89b,
  author =       "P. T. Thach and R. E. Burkard",
  title =        "Reverse Convex Programs Dealing with the Product of
                 two Linear Funktions",
  institution =  "Techn. Univ. Graz, Inst. f. Mathematik",
  year =         "1989",
  number =       "1989-153",
  address =      "Graz",
  pages =        "16",
}

@TechReport{sep:ThachBurkardOettli:91,
  author =       "P. T. Thach and R. E. Burkard and W. Oettli",
  title =        "Mathematical Programs with a Two-Dimensional Reverse
                 Convex Constraint",
  institution =  "TU Graz, Inst. f. Mathematik",
  year =         "1991",
  number =       "172",
  address =      "Graz",
  pages =        "15",
}

@Article{sep:Thakur:78,
  author =       "L. S. Thakur",
  title =        "Error Analysis for Convex Separable Programs: The
                 Piecewise Linear Approximationa and the Bounds on the
                 Optimal Objective Value",
  journal =      "SIAM J. Appl. Math.",
  year =         "1978",
  volume =       "34",
  pages =        "704--394",
}

@Article{sep:Thieu:88,
  author =       "T. V. Thieu",
  title =        "A Note on the Solution of Bilinear Programming
                 Problems by Reduction to Concave Minimization",
  year =         "1988",
  journal =      "Math. Programming",
  volume =       "41",
  number =       "2",
  pages =        "249--260",
}

@InProceedings{sep:Thompson:81,
  author =       "G. L. Thompson",
  title =        "A Recursive Method for Solving Assignment Problems",
  booktitle =    "Studies on Graphs and Discrete Programming",
  year =         "1981",
  editor =       "P. Hansen",
  pages =        "319--343",
  address =      "Amsterdam",
  publisher =    "North-Holland",
}

@Book{sep:Tietz:00,
  author =       "B. Tietz",
  title =        "Handw{\"o}rterbuch der Absatzwirtschaft",
  publisher =    "Poeschel Verl.",
  year =         "0000",
  address =      "Stuttgart",
  series =       "Sonderdruck aus HWA 44",
  pages =        "1377--1407",
}

@Article{sep:Tind:74,
  author =       "J. Tind",
  title =        "Blocking and Antiblocking Sets ({A} Polarity)",
  journal =      "Math. Programming",
  year =         "1974",
  volume =       "6",
  pages =        "157--166",
}

@TechReport{sep:TindWolsey:78,
  author =       "J. Tind and L. A. Wolsey",
  title =        "A Unifying Framework for Duality Theory in
                 Mathematical Programming",
  institution =  "Center for Operations Research \& Econometrics",
  year =         "1978",
  number =       "7834",
  address =      "Louvain-La-Neuve",
  pages =        "24",
}

@TechReport{sep:Tinhofer:84,
  author =       "G. Tinhofer",
  title =        "Probalistische Ans{\"a}tze in der diskreten
                 Optimierung",
  institution =  "Mathematisch-Statistische Sektion in der
                 Forschungsgesellschaft Joanneum, Graz",
  year =         "1984",
  number =       "230",
  pages =        "55",
}

@TechReport{sep:Todd:86,
  author =       "M. J. Todd",
  title =        "Exploiting Special Structure in Karmarkar's Linear
                 Programming Algorithm",
  institution =  "Cornell University, College of Engineering",
  year =         "1986",
  number =       "720",
  address =      "Ithaca, New York",
  pages =        "35",
}

@TechReport{sep:Todd:87,
  author =       "M. J. Todd",
  title =        "Two Variants of Karmarkar's Linear Programming
                 Algorithm for Problems with some Unrestricted
                 Variables",
  institution =  "Cornell University, College of Engineering",
  year =         "1987",
  number =       "741",
  address =      "Ithaca, New York",
  pages =        "21",
}

@Article{sep:Todd:88a,
  author =       "M. J. Todd",
  title =        "Polynomial Algorithms for Linear Programming",
  year =         "1988",
  volume =       "302",
  journal =      "Lect. Notes Econ. Math. Syst.",
  pages =        "49--66",
}

@Article{sep:Todd:88b,
  author =       "M. J. Todd",
  title =        "Improved Bounds and Containing Ellipsoids in
                 Karmarkar's Linear Programming Algorithm",
  year =         "1988",
  volume =       "4",
  journal =      "Math. Oper. Res.",
  pages =        "650--659",
}

@TechReport{sep:Todd:88c,
  author =       "M. J. Todd",
  title =        "On Anstreicher's Combined Phase {I}-Phase {II}
                 Projective Algorithm for Linear Programming",
  institution =  "Cornell University",
  year =         "1988",
  number =       "776",
  address =      "Ithaca/New York",
  pages =        "23",
}

@TechReport{sep:Todd:89,
  author =       "M. J. Todd",
  title =        "Probalistic Models for Linear Programming",
  institution =  "Cornell University, College of Engineering",
  year =         "1989",
  number =       "836",
  address =      "Ithaca, NY",
  pages =        "46",
}

@Article{sep:Todd:90a,
  author =       "M. J. Todd and Y. Ye",
  title =        "A Centered Projective Algorithm for Linear
                 Programming",
  year =         "1990",
  journal =      "Math. Oper. Res.",
  volume =       "15",
  number =       "3",
  pages =        "508--529",
}

@Article{sep:Todd:90b,
  author =       "M. J. Todd",
  title =        "A Dantzig - Wolfe - like variant of Karmarkar's
                 interior point linear programming algorithm",
  year =         "1990",
  journal =      "Oper. Res.",
  volume =       "38",
  number =       "6",
  pages =        "1006--1018",
}

@TechReport{sep:Todd:90c,
  author =       "M. J. Todd",
  title =        "A Low Complexity Interior-Point Algorithm for Linear
                 Programming",
  institution =  "Cornell University, College of Engineering",
  year =         "1990",
  number =       "903",
  address =      "Ethaca, New York",
  pages =        "18",
}

@TechReport{sep:Todd:90d,
  author =       "M. J. Todd",
  title =        "Combining Phase {I} and Phase {II} in a Potential
                 Reduction Algorithm for Linear Programming",
  institution =  "Cornell University, School of OR and Industrial
                 Engineering",
  year =         "1990",
  number =       "907",
  address =      "Ithaca, New York",
  pages =        "27",
}

@TechReport{sep:Todd:90e,
  author =       "M. J. Todd",
  title =        "Todd's Low-Complexity Algorithm is a
                 Predictor-Corrector Path-Following Method",
  institution =  "Cornell University, School of OR and Industrial
                 Engineering",
  year =         "1990",
  number =       "952",
  address =      "Ithaca, NY",
  pages =        "12",
}

@TechReport{sep:Todd:91a,
  author =       "M. J. Todd",
  title =        "Interior-Point Algorithms for Semi-Infinite
                 Programming",
  institution =  "Cornell University, College of Engineering",
  year =         "1991",
  number =       "978",
  address =      "Ithaca, NY",
  pages =        "36",
}

@TechReport{sep:Todd:91b,
  author =       "M. J. Todd",
  title =        "Playing wiht Interior Points",
  institution =  "Cornell University, School of OR and Industrial
                 Engineering",
  year =         "1991",
  address =      "Ithaca, NY",
  pages =        "9",
}

@TechReport{sep:Todd:92,
  author =       "M. J. Todd",
  title =        "Another Derivation of the Karmarkar Direction for
                 Linear Programming",
  institution =  "Cornell University",
  year =         "1992",
  number =       "995",
  address =      "Ithaca, NY",
}

@TechReport{sep:Todd:93a,
  author =       "M. J. Todd",
  title =        "A Lower Bound on the Number of Iterations of
                 Primal-Dual Interior-Point Methods for Linear
                 Programming",
  institution =  "Cornell University",
  year =         "1993",
  number =       "1050",
  address =      "Ithaca, NY",
}

@TechReport{sep:Todd:93b,
  author =       "M. J. Todd",
  title =        "Analysis of Interior-Point Methods for Linear
                 Programming Problems with Variable Upper Bounds",
  institution =  "Cornell University, School of OR and Industrial
                 Engineering",
  year =         "1993",
  number =       "1044",
  address =      "Ithaca, NY",
  pages =        "30",
}

@Article{sep:ToddBurrell:85,
  author =       "M. J. Todd and B. P. Burrell",
  title =        "An Extension of Karmarkar's Algorithm for Linear
                 Programming using Dual Variables",
  journal =      "Algorithmica",
  year =         "1985",
  volume =       "1",
  pages =        "409--424",
}

@TechReport{sep:ToddVial:90,
  author =       "M. J. Todd and J.-P. Vial",
  title =        "Projected Scaled Steepest Descent in
                 Kojima-Mizuno-Yoshise's Potential Reduction Algorithm
                 for the Linear Complementarity Problem",
  institution =  "Cornell University, School of OR and Industrial
                 Engineering",
  year =         "1990",
  number =       "950",
  address =      "Ithaca, NY",
  pages =        "13",
}

@TechReport{sep:ToddWang:89,
  author =       "M. J. Todd and Y. Wang",
  title =        "On Combined Phase 1-Phase 2 Projective Methods for
                 Linear Programming",
  institution =  "Cornell University, College of Engineering",
  year =         "1989",
  number =       "877",
  address =      "Ithaca, NY",
  pages =        "28",
}

@Article{sep:Tomescu:68,
  author =       "I. Tomescu",
  title =        "Sur {L}'Algorithme Matriciel de {B}. Roy",
  journal =      "R.I.R.O.",
  year =         "1968",
  volume =       "2",
  pages =        "87--91",
}

@Article{sep:Tomizawa:71,
  author =       "N. Tomizawa",
  title =        "On Some Techniques Useful for Solution of
                 Transportation Network Problems",
  journal =      "Networks",
  year =         "1971",
  volume =       "1",
  pages =        "173--194",
}

@TechReport{sep:Tomizawa:82,
  author =       "N. Tomizawa",
  title =        "The Theory of Hedron Space",
  institution =  "Tokyo Institute of Technology, Graduate School of
                 Science and Engineering",
  year =         "1982",
  address =      "Yokohama",
  pages =        "26",
}

@Article{sep:TomizawaFujishige:82,
  author =       "N. Tomizawa and S. Fujishige",
  title =        "Historical Survey of Extensions of the Concept of
                 Principal Partition and their Unifying Generalization
                 to Hypermatroids",
  journal =      "Proceedings International Symposium on Circuits and
                 Systems",
  year =         "1982",
  volume =       "14",
  pages =        "142--145",
}

@Article{sep:Tomlin:87,
  author =       "J. A. Tomlin",
  title =        "An Experimental Approach to Karmarkar's Projective
                 Method for Linear Programming",
  journal =      "Math. Programming Stud.",
  year =         "1987",
  volume =       "31",
  pages =        "175",
}

@Article{sep:Tomlin:89,
  author =       "J. A. Tomlin",
  title =        "The Influences of Algorithmic and Hardware
                 Developments on Computational Mathematical
                 Programming",
  journal =      "Math. Programming, Proc. 13th. Int. Symp., Tokyo,
                 Japan 1988; Math. Appl., Jap. Ser. 6",
  year =         "1989",
  pages =        "159--175",
}

@TechReport{sep:Tood:88,
  author =       "M. J. Todd",
  title =        "Recent Developments and new Directions in Linear
                 Programming",
  institution =  "Cornell University, College of Engineering",
  year =         "1988",
  number =       "827",
  address =      "Ithaca, NY",
  pages =        "49",
}

@Article{sep:Topkis:78,
  author =       "D. M. Topkis",
  title =        "Minimizing a Submodular Function on a Lattice",
  journal =      "Oper. Res.",
  year =         "1978",
  volume =       "26",
  pages =        "305--321",
}

@TechReport{sep:Topkis:80,
  author =       "D. M. Topkis",
  title =        "Supermodular Optimization Games",
  institution =  "Bell Laboratories",
  year =         "1980",
  address =      "Holmdel/New Jersey",
  pages =        "49",
}

@Article{sep:Topkis:83,
  author =       "D. M. Topkis",
  title =        "Activity Selection Games and the Minimum Cut Problem",
  journal =      "Networks",
  year =         "1983",
  volume =       "13",
  pages =        "93--106",
}

@Article{sep:Toth:87,
  author =       "G. F. T\'{o}th",
  title =        "Kugelpackungen mit Vorgegebenen Nachbarnzahlen",
  journal =      "Studia Sci. Math. Hungar.",
  year =         "1987",
  volume =       "22",
  pages =        "79--82",
}

@TechReport{sep:ToveyTrick:83,
  author =       "C. A. Tovey and M. A. Trick",
  title =        "An {O}(m4d) Algorithm for the Maximum Polymatroidal
                 Flow Problem",
  institution =  "Georgia Institute of Technology, School of Industrial
                 and Systems Engineering",
  year =         "1983",
  address =      "Atlanta",
  pages =        "15",
}

@TechReport{sep:TrotterMonma:82,
  author =       "L. E. Trotter jr. and C. L. Monma",
  title =        "Lectures on Duality in Combinatorial Optimization -
                 Charging Case - Filing Case",
  institution =  "Bell Laboratories",
  year =         "1982",
  pages =        "35",
}

@InProceedings{sep:TruemperChandrasekaran:77,
  author =       "K. Truemper and R. Chandrasekaran",
  title =        "Local Unimodularity of Matrix-Vector Pairs",
  booktitle =    "Operations Research Verfahren XXV, Methods of
                 Opeations Research",
  year =         "1977",
  editor =       "R. Henn and P. Kall and B. Korte and O. Krafft et
                 al.",
  pages =        "233--235",
  address =      "Meisenheim",
  publisher =    "Hain",
}

@TechReport{sep:TsoKleinschmidtMitterreiterGraham:90,
  author =       "M. Tso and P. Kleinschmidt and I. Mitterreiter and J.
                 Graham",
  title =        "An Efficient Transportation Algorithm for Automatic
                 Chromosome Karyotyping",
  institution =  "Universit{\"a}t Passau, Fakult{\"a}t f{\"u}r
                 Mathematik und Informatik",
  year =         "1990",
  number =       "MIP-9016",
  address =      "Passau",
  pages =        "19",
}

@Article{sep:Tsuchiya:91,
  author =       "T. Tsuchiya",
  title =        "Global Convergence Property of the Affine Scaling
                 Methods for Primal Degenerate Linear Programming
                 Problems",
  year =         "1991",
  journal =      "Math. Oper. Res.",
  volume =       "52",
  number =       "3",
  pages =        "377--404",
}

@Article{sep:TsuchiyaTanabe:90,
  author =       "T. Tsuchiya and K. Tanabe",
  title =        "Local Convergence Properties of New Methods in Linear
                 Programming",
  journal =      "J. Oper. Res. Soc. Japan",
  volume =       "1",
  year =         "1990",
  pages =        "22--45",
}

@Proceedings{sep:TuckerNehring:79,
  title =        "Constructive Proof of a General Duality Theorem for
                 Linear Inequalities and Equations",
  year =         "1979",
  editor =       "A. W. Tucker and E. Nehring",
  pages =        "5",
  organization = "10th International Symposium on Mathematical
                 Programming",
  address =      "Montreal",
}

@Article{sep:Tuncel:94,
  author =       "Levent Tuncel",
  title =        "On the Complexity of Preflow-Push Algorithms for
                 Maximum-Flow Problems",
  journal =      "Algorithmica",
  volume =       "11",
  pages =        "353--359",
  year =         "1994",
}

@Article{sep:Tutte:51,
  author =       "W. T. Tutte",
  title =        "The Factors of Graphs",
  journal =      "?",
  year =         "1951",
  pages =        "314--327",
}

@Article{sep:Tutte:65a,
  author =       "W. T. Tutte",
  title =        "Lectures on Matroids",
  journal =      "J. Res. Nat. Bur. Standards",
  year =         "1965",
  volume =       "69B",
  pages =        "47",
}

@Article{sep:Tutte:65b,
  author =       "W. T. Tutte",
  title =        "Menger's Theorem for Matroids",
  journal =      "J. Res. Nat. Bur. Standards",
  year =         "1965",
  volume =       "69B",
  pages =        "49--53",
}

@Article{sep:Tuy:85,
  author =       "H. Tuy",
  title =        "Concave Minimization under Linear Constraints with
                 Special Structure",
  journal =      "Optimization",
  year =         "1985",
  volume =       "16",
  pages =        "335--352",
}

@TechReport{sep:Tuy:90,
  author =       "H. Tuy",
  title =        "The Complementary Convex Structure in Global
                 Optimization",
  institution =  "Technische Universit{\"a}t Graz, Institut f{\"u}r
                 Mathematik",
  year =         "1990",
  number =       "167",
  address =      "Graz",
  pages =        "20",
}

@Article{sep:TuyKhatchaturovUtkin:87,
  author =       "H. Tuy and V. Khatchaturov and S. Utkin",
  title =        "A Class of Exhaustive Cone Splitting Procedures in
                 Conical Algorithms for Concave Minimization",
  year =         "1987",
  journal =      "Optimization",
  volume =       "18",
  pages =        "791--807",
}

@Article{sep:TuyThieuThai:85,
  author =       "H. Tuy and T. V. Thieu and NG. Q. Thai",
  title =        "A Conical Algorithm for Globally Minimizing a Concave
                 Function over a closed Convex Set",
  journal =      "Math. Oper. Res.",
  year =         "1985",
  volume =       "10",
  pages =        "498--514",
}

@TechReport{sep:VanLint:8,
  author =       "van Lint",
  title =        "Was hei\ss{}t heute gut codieren",
  institution =  "?",
  year =         "198x",
  address =      "Eindhoven",
  pages =        "10",
}

@TechReport{sep:VanLoon:,
  author =       "J. N. M. Loon van",
  title =        "Irreducibly Inconistent Systems of Linear
                 Inequalities",
  institution =  "Koninklijke Militare Academie",
  year =         "19x",
  address =      "Breda/Netherlands",
  pages =        "16",
}

@Article{sep:VanMaaren81,
  author =       "H. van Maaren",
  title =        "A degree theorem and decision methods for algebras of
                 affine forms",
  journal =      "Proceedings of the Koninglijke Nederlandse Adademie
                 von Wetenschappen",
  year =         "1981",
  volume =       "Series A",
  number =       "84",
  pages =        "315--324",
}

@PhdThesis{sep:VanMaaren:79,
  author =       "none",
  title =        "Algebraic Simplices in Modules (on concepts of closure
                 and generalizations of convexity)",
  school =       "Rijksuniversiteit te Utrecht",
  year =         "1979",
  address =      "Utrecht",
  pages =        "138",
}

@Article{sep:VanMaaren:81,
  author =       "H. van Maaren and H. J. P. de Smet",
  title =        "Extremal point, separation and Carath\'{e}odory, Helly
                 and Radon numbers in non-real linear spaces",
  journal =      "Proceedings of the Koninklijke Nederlandse Akademie
                 von Wetenschappen",
  year =         "1981",
  volume =       "Series A",
  number =       "84",
  pages =        "207--218",
}

@Article{sep:VanMaarenSmet:81,
  author =       "H. van Maaren and H. J. P. de Smet",
  title =        "Polynomials in algebras of linear forms",
  journal =      "Proc. of the Koninklijke Nederlandse Akademie van
                 Wetenschappen",
  year =         "1981",
  volume =       "84",
  pages =        "195--205",
}

@Article{sep:VanderbeiMeketonFreedman:86,
  author =       "R. J. Vanderbei and M. S. Meketon and B. A. Freedman",
  title =        "A Modification of Karmarkar's Linear Programming
                 Algorithm",
  journal =      "Algorithmica",
  year =         "1986",
  volume =       "1",
  pages =        "395--408",
}

@TechReport{sep:VasilkovKovalev:92,
  author =       "D. Vasilkov and M. Kovalev",
  title =        "Optimization and the Canonical Order",
  institution =  "Belarusian State University, Department of
                 Mathematical Problems in CAD",
  year =         "1992",
  number =       "9202",
  address =      "Minsk, Belarus.",
  pages =        "22",
}

@PhdThesis{sep:Vazirani:84,
  author =       "V. V. Vazirani",
  title =        "Maximum Matchings without Blossoms",
  school =       "University of California",
  year =         "1984",
  address =      "Berkeley",
  pages =        "42",
}

@Article{sep:Veinott:68,
  author =       "A. F. Veinott jr",
  title =        "Extreme Points of Leontief Substitution Systems",
  journal =      LINAA2,
  year =         "1968",
  volume =       "1",
  pages =        "181--194",
}

@Article{sep:Vial:88,
  author =       "J. P. Vial",
  title =        "A Fully Polynomial Time Projective Method",
  journal =      "Oper. Res. Lett.",
  year =         "1988",
  volume =       "7",
  pages =        "15--19",
}

@Article{sep:Vial:89a,
  author =       "J.-P. Vial",
  title =        "A Unified Approach to Projective Algorithms for Linear
                 Programming",
  journal =      "Optimazation, Proc.5th. French - German Conf.,
                 Varetz/Fr. 1988; Lect. Notes Math. 1405",
  year =         "1989",
  pages =        "191--220",
}

@InProceedings{sep:Vial:89b,
  author =       "J.-Ph. Vial",
  title =        "Approximate projection in a projective method for the
                 linar feasibility problem",
  booktitle =    "Progress in Mathematical Programming, Chapter 4",
  year =         "1989",
  editor =       "N. Megiddo",
  pages =        "65--78",
  address =      "New York",
  publisher =    "Springer-Verlag",
}

@Article{sep:Vizvari:84,
  author =       "B. Vizv\'{a}ri",
  title =        "On the Connection of the Frobenius Problem and the
                 Knapsack Problem",
  journal =      "Finite and infinite sets, 6th. Hung. Combin. Colloq.,
                 Eger/Hun. 1981, Vol. II; Colloq. Math. Soc. Janos
                 Bolyai",
  year =         "1984",
  volume =       "37",
  pages =        "799--819",
}

@Article{sep:Vizvari:87,
  author =       "B. Vizv\'{a}ri",
  title =        "An Application of Gomory Cuts in Number Theory",
  journal =      "Period. Math. Hungar.",
  year =         "1987",
  volume =       "18",
  pages =        "213--228",
}

@TechReport{sep:Vizvari:89,
  author =       "B. Vizv\'{a}ri",
  title =        "On the Optimality of the Greedy Solutions of the
                 General Knapsack Problems",
  institution =  "Hungarian Academy of Sciences, Computer and Automation
                 Institute",
  year =         "1989",
  address =      "Budapest",
  pages =        "23",
}

@Article{sep:Vlach:67,
  author =       "M. Vlach",
  title =        "Branch and bound method for the three-index assignment
                 problem",
  journal =      "Ekonom.-Mat. Obzor",
  year =         "1967",
  volume =       "3",
  pages =        "181--191",
}

@InProceedings{sep:Vlach:76,
  author =       "M. Vlach",
  title =        "Conditions for the Existence of a Solution to the
                 Multi-Index Transportation Problems",
  booktitle =    "Survey of Mathematical Programming, 9th International
                 Mathematical Programming Symposium Budapest",
  year =         "1976",
  editor =       "A. Pr\'{e}kopa",
  pages =        "109--119",
  organization = "Akad\'{e}mia Kiad\'{o}",
  address =      "Budapest",
  publisher =    "Verl. d. Ungar. Akademie der Wissenschaften",
}

@Article{sep:VlachMoravek:,
  author =       "Vlach Mor\`{a}vek H.",
  title =        "On the Necessary Conditet Recherches",
  journal =      "?",
  year =         "xxxx",
  volume =       "?",
  number =       "Serie C",
  pages =        "5--16",
}

@Article{sep:VlachMoravek:67,
  author =       "Vlach Mor\`{a}vek H.",
  title =        "On the Necessary Conditions for the Existence of the
                 Solution of the Multi-Index Transportation Problem",
  journal =      "Oper. Res.",
  year =         "1967",
  volume =       "15",
  pages =        "542--545",
}

@TechReport{sep:Volpentesta:81,
  author =       "A. Volpentesta",
  title =        "Row Circular Matrices and Related Polyhedra",
  institution =  "Univ. di Pisa, Dipartimento di ricerca operativa e
                 scienze statistiche",
  year =         "1981",
  address =      "Pisa",
  pages =        "28",
}

@Article{sep:Vorobev:63,
  author =       "N. N. Vorob'ev",
  title =        "The Extremal Matrix Algebra",
  journal =      "Soviet Math. Dokl.",
  year =         "1963",
  volume =       "4",
  pages =        "1220--1223",
}

@Article{sep:Vorobev:67,
  author =       "N. N. Vorob'ev",
  title =        "Ekstremalnaja algebra polozitelnich matriz",
  journal =      "Elektron. Informationsverarb. Kybernet.",
  year =         "1967",
  volume =       "3",
  pages =        "39--71",
  note =         "Russisch-{\"U}bersetzung",
}

@Article{sep:Vorobev:70,
  author =       "N. N. Vorob'ev",
  title =        "Ekstremalnaja algebra neotrizatelnich matriz.
                 (Eigenvalue)",
  journal =      "Elektron. Informationsverarb. Kybernet.",
  year =         "1970",
  volume =       "6",
  pages =        "303--312",
  note =         "Russisch-{\"U}bersetzung",
}

@TechReport{sep:WaescherGau:94,
  author =       "Gerhard W{\"a}scher and Thomas Gau",
  title =        "Generating Almost Optimal Solutions for the Integer
                 One-dimensional Cutting Stock Problem",
  institution =  "Technische Universit{\"a}t Braunschweig",
  year =         "1994",
  number =       "94/06",
  address =      "Braunschweig",
}

@Article{sep:Wagner:76,
  author =       "R. A. Wagner",
  title =        "A Shortest Path Algorithm for Edge-Sparse Graphs",
  journal =      "J. Assoc. Comput. Mach.",
  year =         "1976",
  volume =       "23",
  pages =        "50--57",
}

@TechReport{sep:WagnerWeihe:92,
  author =       "D. Wagner and K. Weihe",
  title =        "A Linear-Time Algorithm for Edge-Disjoint Paths in
                 Planar Graphs",
  institution =  "Technische Universit{\"a}t Berlin, FB Mathematik",
  year =         "1992",
  number =       "344",
  address =      "Berlin",
  pages =        "18",
}

@TechReport{sep:Wagneur:88a,
  author =       "E. Wagneur",
  title =        "The Classification Problems for Moduloids of Finite
                 Type. 2. Classifications of simple pseudo-modules",
  institution =  "GERAD, Ecole des Hautes Etudes Commerciales",
  year =         "1988",
  address =      "Montr\'{e}al/Canada",
  pages =        "11",
}

@TechReport{sep:Wagneur:88b,
  author =       "E. Wagneur",
  title =        "The Classification Problem for Moduloids of Finite
                 Type. {I}. Dimension and Weak Dimension",
  institution =  "GERAD, Ecole des Hautes Etudes Commerciales",
  year =         "1988",
  address =      "Montr\'{e}al/Canada",
  pages =        "18",
}

@TechReport{sep:Wagneur:89,
  author =       "E. Wagneur",
  title =        "Moduloids and Pseudomodules",
  institution =  "MacGill University, GERAD",
  year =         "1989",
  pages =        "13",
}

@Article{sep:Walk:75,
  author =       "M. Walk",
  title =        "Dualit{\"a}t von Transport- und Potentialaufgaben in
                 Banachr{\"a}umen",
  journal =      "Proceedings of Tbilisi University",
  year =         "1975",
  volume =       "A 9 (157)",
  pages =        "13--18",
}

@TechReport{sep:Walk:77,
  author =       "M. Walk",
  title =        "Verallgemeinerte Str{\"o}me und Spannungen auf
                 Graphen, Teil {I} und {II}",
  institution =  "Friedr.-Schiller-Univ., Sekt. Mathematik",
  year =         "1977",
  number =       "9 (M) 77",
  address =      "Jena",
  pages =        "20",
}

@Proceedings{sep:Walk:79,
  title =        "Dualit{\"a}t verallgemeinerter Transport- und
                 Potentialprobleme",
  year =         "1979",
  editor =       "M. Walk",
  pages =        "75--77",
  organization = "24. Intern. Wiss. Koll.",
  address =      "Ilmenau",
  publisher =    "TH Ilmenau",
}

@Article{sep:Walk:80a,
  author =       "M. Walk",
  title =        "Optimale Programme f{\"u}r Multistr{\"o}me auf
                 endlichen gerichteten Graphen",
  journal =      "Wiss. Ztschr. Friedrich-Schiller-Univ. Jena,
                 Math.Naturwiss. R.",
  year =         "1980",
  volume =       "29. Jg",
  number =       "H. 2",
  pages =        "319--325",
}

@Article{sep:Walk:80b,
  author =       "M. Walk",
  title =        "Dualit{\"a}t eines verallgemeinerten Transport- und
                 Potentialproblems",
  journal =      "Math. Operationsforsch. Statist. Ser. Optim.",
  year =         "1980",
  volume =       "11",
  pages =        "465--472",
}

@Proceedings{sep:WalkVerbesek:73,
  editor =       "M. Walk and W. Verbesek",
  title =        "Eine Verallgemeinerung des Transport- und
                 Potentialproblems auf endlichen gerichteten Graphen",
  year =         "1973",
  pages =        "69--71",
  organization = "18. Intern. Wiss. Koll.",
  address =      "Ilmenau",
  publisher =    "TH Ilmenau",
}

@Proceedings{sep:WalkVerbesek:76,
  editor =       "M. Walk and W. Verbesek",
  title =        "Verallgemeinerte Str{\"o}me und Spannungen {\"u}ber
                 endlichen gerichteten Graphen",
  year =         "1976",
  pages =        "65--67",
  organization = "21. Intern. Wiss. Koll.",
  address =      "Ilmenau",
  publisher =    "TH Ilmenau",
}

@TechReport{sep:Wallacher:90,
  author =       "C. Wallacher",
  title =        "A combinatorial interior point method for network flow
                 problems",
  institution =  "TU Braunschweig, Abt. f. Mathematische Optimierung",
  year =         "1990",
  address =      "Braunschweig",
  pages =        "13",
}

@Article{sep:Walukiewicz:81a,
  author =       "S. Walukiewicz",
  title =        "Ellipsoidal Algorithm for Linear Programming (Lecture
                 Notes)",
  journal =      "IIASA Collab. Proc. Ser. CP-81-S1",
  year =         "1981",
  pages =        "547--577",
}

@Article{sep:Walukiewicz:81b,
  author =       "S. Walukiewicz",
  title =        "Some aspects of integer programming duality",
  journal =      "European J. Oper. Res.",
  year =         "1981",
  volume =       "7",
  pages =        "196--202",
}

Article{sep:WeberLiebling:86,
  author =       "M. Weber and Th.M. Liebling",
  title =        "Euclidean Matching Problems and the Metropolis
                 Algorithm",
  journal =      "Z. Oper. Res. Ser. A-B",
  year =         "1986",
  volume =       "30",
  pages =        "A 85--A 110",
}

@Misc{sep:Waterman:93,
  author =       "Michael S. Waterman",
  title =        "Applications of Combinatorics to Molecular Biology",
  annote =       "33 pages",
}

@TechReport{sep:Weicker:74,
  author =       "R. Weicker",
  title =        "Effizienz von Algorithmen",
  institution =  "Universit{\"a}t, Inst. f. Informatik",
  year =         "1974",
  type =         "Vorlesungsskript",
  address =      "Hamburg",
  pages =        "85",
}

@Article{sep:Weinberger:76,
  author =       "D. B. Weinberger",
  title =        "Transversal Matroid Intersections and Related
                 Packings",
  journal =      "Math. Programming",
  year =         "1976",
  volume =       "11",
  pages =        "164--176",
}

@Proceedings{sep:Werner:81,
  title =        "Altes und Neues zur rationalen Interpolation",
  year =         "1981",
  editor =       "H. von Werner",
  pages =        "27",
  organization = "10. {\"o}sterr. Mathematiker-Kongress",
  address =      "Insbruck",
}

@Article{sep:Werner:86,
  author =       "F. Werner",
  title =        "On the Method of Interchanging Networks for
                 Permutation Problems",
  journal =      "Optimization",
  year =         "1986",
  volume =       "17",
  pages =        "629--642",
}

@TechReport{sep:Werner:88a,
  author =       "F. Werner",
  title =        "On Some Deterministic Polynomial Interation Methods
                 for the Permutation Flow Shop Problem",
  institution =  "Techn. Universit{\"a}t {"}Otto von Guericke",
  year =         "1988",
  address =      "Magdeburg",
  pages =        "26",
}

@Article{sep:Werner:88b,
  author =       "F. Werner",
  title =        "Ein adaptives stochastisches Suchverfahren f{\"u}r
                 spezielle Reihenfolgeprobleme",
  journal =      "Ekonom.-Mat. Obzor",
  year =         "1988",
  volume =       "24",
  number =       "1",
  pages =        "50--67",
}

@Article{sep:Werner:88c,
  author =       "F. Werner",
  title =        "Zu einigen Nachbarschaftsstrukturen f{\"u}r
                 Iterationsverfahren zur n{\"a}herungsweisen
                 {L}{\"o}sung spezieller Reihenfolgeprobleme",
  journal =      "Optimization",
  year =         "1988",
  volume =       "19",
  pages =        "539--556",
}

@Article{sep:Werner:92,
  author =       "F. Werner",
  title =        "On the Heuristic Solution of the Permutation Flow Shop
                 Problem by Path Algorithms",
  journal =      "Computers Ops Res.Models of Operations Research",
  volume =       "20",
  number =       "7",
  pages =        "707--722",
  year =         "1993",
}

@Article{sep:Werner:93,
  author =       "F. Werner",
  title =        "A Branch and Bound Algorithm for Minimizing Weighted
                 Completion Times with Deadlines",
  journal =      "Optimization",
  volume =       "28",
  pages =        "187--199",
  year =         "1993",
}

@TechReport{sep:Werra:74,
  author =       "D. de Werra",
  title =        "A Survey of Coloring Problems",
  institution =  "Ecole Polytechnique F\'{e}d\'{e}rale de Lausanne,
                 D\'{e}p. de Math\'{e}matiques",
  year =         "1974",
  address =      "Lausanne",
  pages =        "26",
}

@Article{sep:Werra:89,
  author =       "D. de Werra",
  title =        "Generalized Edge Packings",
  journal =      "Math. Programming",
  year =         "1989",
  volume =       "44",
  pages =        "235--245",
}

@Article{sep:WildKarwanKarwan:93,
  author =       "Bill Wild Jr. and Kirk R. Karwan and Mark H. Karwan",
  title =        "The Multiple Bottleneck Transportation Problem",
  journal =      "Computers Ops. Res.",
  volume =       "20",
  number =       "3",
  pages =        "261--274",
  year =         "1993",
}

@Article{sep:Wilson:73,
  author =       "R. J. Wilson",
  title =        "An Introduction to Matroid Theory",
  journal =      "Amer. Math. Monthly",
  year =         "1973",
  volume =       "80",
  pages =        "500--525",
}

@Article{sep:Wingo:85,
  author =       "D. R. Wingo",
  title =        "Globally Minimizing Polynomials without Evaluating
                 Derivatives",
  journal =      "Internat. J. Comput. Math.",
  year =         "1985",
  volume =       "17",
  pages =        "287--294",
}

@TechReport{sep:Witzgall:7,
  author =       "C. Witzgall",
  title =        "On One-Row Linear Programs",
  institution =  "National Bureau of Standards, Applied Mathematics
                 Division",
  year =         "197x",
  address =      "Washington",
  pages =        "25",
}

@Article{sep:Witzgall:70,
  author =       "C. Witzgall",
  title =        "On Complementary Polar Conical Sets",
  journal =      "J. Res. Nat. Bur. Standards",
  year =         "1970",
  volume =       "74B",
  pages =        "99--113",
}

@Article{sep:WitzgallZahn:65,
  author =       "C. Witzgall and C. T. Zahn jr.",
  title =        "Modification of Edmonds' Maximum Matching Algorithm",
  journal =      "J. of Research of th National Bureau of Standards-B.
                 Mathematics and Mathematical Physics",
  year =         "1965",
  volume =       "69B",
  pages =        "91--98",
}

@TechReport{sep:Woeginger:92a,
  author =       "G. J. Woeginger",
  title =        "Computing Maximum Valued Regions",
  institution =  "Techn. Univ. Graz, Inst. f{\"u}r Mathematik",
  year =         "1992",
  number =       "236",
  address =      "Graz",
  pages =        "13",
}

@TechReport{sep:Woeginger:92b,
  author =       "G. J. Woeginger",
  title =        "On-line Scheduling of Jobs with fixed Start and End
                 Times",
  institution =  "Techn. Univ. Graz, Inst. f{\"u}r Mathematik",
  year =         "1992",
  number =       "229",
  address =      "Graz",
  pages =        "13",
}

@TechReport{sep:WoegingerYu:92,
  author =       "G. J. Woeginger and Z.-L. Yu",
  title =        "A Heuristic for Preemptive Scheduling with Set-Up
                 Times",
  institution =  "Techn. Univ. Graz, Inst. f{\"u}r Mathematik",
  year =         "1992",
  number =       "207",
  address =      "Graz",
  pages =        "9",
}

@Article{sep:Wolfe:65,
  author =       "P. Wolfe",
  title =        "The Composite Simplex Algorithm",
  journal =      "SIAM Rev.",
  year =         "1965",
  volume =       "7",
  pages =        "42--54",
}

@Article{sep:Wolfe:75,
  author =       "P. Wolfe",
  title =        "A Method of Conjugate Subgradients for Minimizing
                 Nondifferentiable Functions",
  journal =      "Math. Programming Stud.",
  year =         "1975",
  volume =       "3",
  pages =        "145--173",
}

@Article{sep:Wolsey:75,
  author =       "L. A. Wolsey",
  title =        "Faces for a Linear Inequality in 0-1 Variables",
  journal =      "Math. Programming",
  year =         "1975",
  volume =       "8",
  pages =        "165--178",
}

@Article{sep:Wolsey:80,
  author =       "L. A. Wolsey",
  title =        "Heuristic Analysis, Linear Programming and Branch and
                 Bound",
  journal =      "Math. Programming Stud.",
  year =         "1980",
  volume =       "13",
  pages =        "121--134",
}

@Article{sep:Wolsey:81,
  author =       "L. A. Wolsey",
  title =        "Integer Programming Duality: {A} View of some recent
                 Developments",
  journal =      "Math. Programming",
  year =         "1981",
  volume =       "20",
  pages =        "173--195",
}

@Article{sep:Wongseelashote:76,
  author =       "A. Wongseelashote",
  title =        "An Algebra for Determining all Path-Values in a
                 Network with Application to {K}-Shortest-Paths
                 Problems",
  journal =      "Networks",
  year =         "1976",
  volume =       "6",
  pages =        "307--334",
}

@Article{sep:Wongseelashote:79,
  author =       "A. Wongseelashote",
  title =        "Semirings and Path Spaces",
  journal =      "Discrete Math.",
  year =         "1979",
  volume =       "26",
  pages =        "55--78",
}

@Article{sep:Woodall:77,
  author =       "D. R. Woodall",
  title =        "A Note on Rank Functions and Integer Programming",
  journal =      "Discrete Math.",
  year =         "1977",
  volume =       "17",
  pages =        "215--218",
}

@Article{sep:WuPosner:78,
  author =       "C. T. Wu and M. E. Posner",
  title =        "A Note on Programming Problem with Maximin Objective
                 Function",
  journal =      "Opsearch",
  year =         "1978",
  volume =       "15",
  pages =        "117--119",
}

@Article{sep:WuestefeldZimmermann:80,
  author =       "A. W{\"u}stefeld and U. Zimmermann",
  title =        "Nonlinear One-Parametric Linear Programming and
                 {T}-Norm Transportation Problems",
  journal =      "Naval Research Logistics Quarterly",
  year =         "1980",
  volume =       "27",
  pages =        "187--197",
}

@TechReport{sep:WykKnuth:79,
  author =       "C. Wyk van and D. E. Knuth",
  title =        "A Programming and Problems-Solving Seminar",
  institution =  "Stanford University, Computer Science Department",
  year =         "1979",
  number =       "STAN-CS-79-707",
  address =      "Stanford",
  pages =        "83",
}

@Article{sep:Yamamoto:87,
  author =       "Y. Yamamoto",
  title =        "A Path Following Algorithm for Stationary Point
                 Problems",
  journal =      "J. Oper. Res. Soc. Japan",
  year =         "1987",
  volume =       "30",
  pages =        "181--199",
}

@Article{sep:Yamamoto:89,
  author =       "Y. Yamamoto",
  title =        "Fixed Point Algorithms for Stationary Point Problems",
  journal =      "Mathematical Programming, Proc. 13th. Int. Symp.,
                 Tokyo/Japan 1988; Math. Appl. Jap. Ser.6",
  year =         "1989",
  pages =        "283--307",
}

@TechReport{sep:Ye:85,
  author =       "Y. Ye",
  title =        "Recovering the Shadow Price in Projection Methods of
                 Linear Programming",
  institution =  "Stanford University, Engineering-Economic Systems
                 Department",
  year =         "1985",
  address =      "Stanford, California",
  pages =        "9",
}

@Article{sep:Ye:87,
  author =       "Y. Ye",
  title =        "Karmarkar's Algorithm and the Ellipsoid Method",
  journal =      "Oper. Res. Lett.",
  year =         "1987",
  volume =       "6",
  pages =        "177--182",
}

@Article{sep:Ye:91,
  author =       "Y. Ye",
  title =        "Comparative Analysis of Affine Scaling Algorithms
                 Based on Simplifying Assumptions",
  journal =      "Math. Programming",
  year =         "1991",
  volume =       "52",
  pages =        "405--414",
}

@Article{sep:Ye:92,
  author =       "Yinyu Ye",
  title =        "A Potential Reduction Algorithms Allowing Column
                 Generation",
  journal =      "Siam J. Optimization",
  volume =       "2",
  number =       "1",
  pages =        "7--20",
  year =         "1992",
}

@Article{sep:YeKojima:87,
  author =       "Y. Ye and M. Kojima",
  title =        "Recovering Optimal Dual Solutions in Karmarkar's
                 Polynomial Algorithm for Linear Programming",
  journal =      "Math. Programming",
  year =         "1987",
  volume =       "39",
  pages =        "305--317",
}

@Article{sep:YeTodd:90,
  author =       "Y. Ye and M. Todd",
  title =        "Containing and Shrinking Ellipsoids in the
                 Path-Following Algorithm",
  year =         "1990",
  journal =      "Math. Programming",
  volume =       "A 47",
  number =       "1",
  pages =        "1--9",
}

@Article{sep:Yen:71,
  author =       "J. Y. Yen",
  title =        "Finding the k Shortest Loopless Paths in a Network",
  journal =      "Management Sci.",
  year =         "1971",
  volume =       "17",
  pages =        "712--716",
}

@Article{sep:Yoeli:61,
  author =       "M. Yoeli",
  title =        "A Note on a Generalization of Boolean Matrix Theory",
  journal =      "Amer. Math. Monthly",
  year =         "1961",
  volume =       "68",
  pages =        "552--557",
}

@TechReport{sep:You:8,
  author =       "Z. You",
  title =        "On Line Search Times of Direction Set Algorithms",
  institution =  "Xi'an Jiaotong University",
  year =         "198x",
  address =      "China",
  pages =        "2",
}

@TechReport{sep:YouXu:8,
  author =       "Z. You and C. Xu",
  title =        "Stepsize Analysis for Descent Methods",
  institution =  "Xi'Jiaotong University",
  year =         "198x",
  address =      "China",
  pages =        "3",
}

@TechReport{sep:Young:76,
  author =       "H. P. Young",
  title =        "On Permutations and Permutation Polytopes",
  institution =  "International Institute for Applid Systems Analysis",
  year =         "1976",
  address =      "Laxenburg",
  pages =        "19",
}

@Article{sep:YoungTarjanOrlin:91,
  author =       "N. E. Young and R. E. Tarjan and J. B. Orlin",
  title =        "Faster Parametric Shortest Path and Minimum Balance
                 Algorithms",
  year =         "1990",
  journal =      "Networks",
  volume =       "2",
  pages =        "205--221",
}

@Article{sep:Yue:82,
  author =       "M. Yue",
  title =        "On a p-Increasing Family of Point-To-Set Maps",
  journal =      "Chin. Ann. of Math",
  year =         "1982",
  volume =       "3",
  pages =        "403--414",
}

@Article{sep:YueHan:84,
  author =       "M. Yue and J. Han",
  title =        "A Unified Approach to the Feasible Direction Methods
                 for Nonlinear Programming with Linear Constraints",
  journal =      ACTMS1,
  year =         "1984",
  volume =       "1",
  pages =        "63--75",
}

@Article{sep:Zeitlin:81,
  author =       "Z. Zeitlin",
  title =        "Integer Allocation Problems of Min-Max Type with
                 Quasiconvex Separable Functions",
  journal =      "Oper. Res.",
  year =         "1981",
  volume =       "29",
  pages =        "207--211",
}

@TechReport{sep:Zemel:84,
  author =       "E. Zemel",
  title =        "A Linear Time Randomizing Algorithm for Local Roots
                 and Optima of Ranked Functions",
  institution =  "Center for Mathematical Studies in Economics and
                 Management Science",
  year =         "1984",
  number =       "614",
  address =      "Evanston",
  pages =        "13",
}

@Article{sep:Zemel:86,
  author =       "E. Zemel",
  title =        "Random Binary Search: {A} Randomizing Algorithm for
                 Global Optimization in {R1}",
  year =         "1986",
  journal =      "Math. Oper. Res.",
  volume =       "11",
  pages =        "651--662",
}

@TechReport{sep:ZhaoStoer:90,
  author =       "G. Zhao and J. Stoer",
  title =        "Estimating the complexity of path-following methods
                 for solving linear program by curvature integrals",
  institution =  "Universit{\"a}t, Inst. f. Angew. Mathematik u.
                 Statistik",
  year =         "1990",
  number =       "225",
  address =      "W{\"u}rzburg",
  pages =        "17",
}

@TechReport{sep:Zietak:80a,
  author =       "K. Zietak",
  title =        "Rozwiazanie w normie Lp nieliniowego r\'{o}wnania
                 macieruzowego {XY} = {A}",
  institution =  "Wroclaw University, Int. of Computer Science",
  year =         "1980",
  number =       "N-84",
  address =      "Wroclaw",
  pages =        "11",
}

@TechReport{sep:Zietak:80b,
  author =       "K. Zietak",
  title =        "{O} punkcie stacjonarnym minimaksowego zadania dla
                 nieliniowego r\'{o}wnania macierzowego {XY} = {A}",
  institution =  "Wroclaw University, Inst. of Computer Science",
  year =         "1980",
  number =       "N-83",
  address =      "Wroclaw",
  pages =        "11",
}

@TechReport{sep:Zietak:81a,
  author =       "K. Zietak",
  title =        "Zwiazek miedzy rozwiazaniami w normach lp i Czebyszewa
                 r\'{o}wnania macierzowego {XY}={A}",
  institution =  "Wroclaw University, Inst. of Computer Science",
  year =         "1981",
  number =       "N-106",
  address =      "Wroclaw",
  pages =        "8",
}

@TechReport{sep:Zietak:81b,
  author =       "K. Zietak",
  title =        "{O} zbieznosci algorytmu {P} wyznaczania rozwiazania w
                 normie lp nadokreslonego nieliniowego r\'{o}wnania
                 macierzoweg {XY}={A}",
  institution =  "Wroclaw University, Inst. of Computer Science",
  year =         "1981",
  number =       "N-105",
  address =      "Wroclaw",
  pages =        "8",
}

@TechReport{sep:Zietak:82,
  author =       "K. Zietak",
  title =        "The Chebyshev approximation of a rectangular matrix by
                 matrices of smaller rank as the limit of
                 lp-approximation",
  institution =  "Wroclaw University, Inst. of Computer Science",
  year =         "1982",
  number =       "N-113",
  address =      "Wroclaw",
  pages =        "11",
}

@TechReport{sep:Zietak:83,
  author =       "K. Zietak",
  title =        "The lp-solution of the linear matrix equation
                 {AX}+{YB}={C}",
  institution =  "Wroclaw University, Inst. of Computer Science",
  year =         "1983",
  number =       "N-119",
  address =      "Wroclaw",
  pages =        "13",
}

@Article{sep:Zietak:88,
  author =       "K. Zietak",
  title =        "Evaluation of coefficients of a double Chebyshev
                 series of the function g(p(x+y))",
  year =         "1982",
  journal =      "Zastos. Mat.",
  volume =       "20",
  number =       "1",
  pages =        "137--140",
}

@Article{sep:ZimmermanJuhnke:77,
  author =       "K. Zimmermann and F. Juhnke",
  title =        "Lineare Gleichungs- und Ungleichungssysteme auf
                 extemalen Algebren",
  journal =      "Wiss. Z. Tech. Hochsch. Magdeburg",
  year =         "1977",
  volume =       "23",
  pages =        "103--106",
}

@Article{sep:Zimmermann:73a,
  author =       "K. Zimmermann",
  title =        "Some properties of the systems of extremal linear
                 inequalities",
  journal =      "Ekonom.-Mat. Obzor",
  year =         "1973",
  volume =       "9",
  pages =        "212--227",
  note =         "Russisch",
}

@Article{sep:Zimmermann:73b,
  author =       "K. Zimmermann",
  title =        "Solution of some optimization problems in extremal
                 vector space",
  journal =      "Ekonom.-Mat. Obzor",
  year =         "1973",
  volume =       "9",
  pages =        "336--351",
  note =         "Russisch",
}

@Article{sep:Zimmermann:74a,
  author =       "K. Zimmermann",
  title =        "Solution of an optimization problem in extremal vector
                 space",
  journal =      "Ekonom.-Mat. Obzor",
  year =         "1974",
  volume =       "10",
  pages =        "298--321",
  note =         "Russisch",
}

@Article{sep:Zimmermann:74b,
  author =       "K. Zimmermann",
  title =        "Conjugate optimization problems and algorithms in the
                 extremal vector space",
  journal =      "Ekonom.-Mat. Obzor",
  year =         "1974",
  volume =       "10",
  pages =        "428--439",
  note =         "Russisch",
}

@Article{sep:Zimmermann:76a,
  author =       "K. Zimmermann",
  title =        "Extremaln i Algebra",
  journal =      "Vyzkumn\`{a} publicace Ekonomicko-matematick\'{e}
                 Laboratorie pri Ekonomick\'{e}m \'{u}stava CSAV",
  year =         "1976",
  volume =       "46",
  pages =        "127",
}

@Article{sep:Zimmermann:76b,
  author =       "K. Zimmermann",
  title =        "Einige Aufgaben auf dem extremalen Vektorraum",
  journal =      "Unternehmensforschung und angewandte Statistik",
  year =         "1976",
  volume =       "55",
  pages =        "T284--T286",
}

@Article{sep:Zimmermann:77a,
  author =       "K. Zimmermann",
  title =        "A general Separation theorem in extremal algebras",
  journal =      "Ekonom.-Mat. Obzor",
  year =         "1977",
  volume =       "13",
  pages =        "179--200",
}

@Article{sep:Zimmermann:77b,
  author =       "U. Zimmermann",
  title =        "Some Partial Orders Related to Boolean Optimization
                 and the Greedy Algorithm",
  journal =      "Ann. Disc. Math.",
  year =         "1977",
  volume =       "1",
  pages =        "539--550",
}

@InProceedings{sep:Zimmermann:78a,
  author =       "U. Zimmermann",
  title =        "Duality and the Algebraic Matroid Intersection
                 Problem",
  booktitle =    "Operations Research Verfahren, 28, Second Symposium on
                 OR, Aachen",
  year =         "1978",
  editor =       "R. Henn and P. Kall and H. Koenig and B. Korte and O.
                 Kraft et al.",
  pages =        "285--296",
  address =      "Meisenheim",
  publisher =    "Hain",
}

@InProceedings{sep:Zimmermann:78b,
  author =       "U. Zimmermann",
  title =        "Threshold Methods for Boolean Optimization Problems
                 with Separable Objectives",
  booktitle =    "Optimization Techniques, Proceedings of the 8th IFIP
                 Conference on Optimization Techniques, W{\"u}rzburg
                 1977, Part 2",
  year =         "1978",
  editor =       "J. Stoer",
  pages =        "289--298",
  organization = "Lecture Notes in Control and Information Sciences, 7",
  address =      "Berlin (usw.)",
  publisher =    "Springer",
}

@Article{sep:Zimmermann:79a,
  author =       "K. Zimmermann",
  title =        "A generalization of convex functions",
  journal =      "Ekonom.-Mat. Obzor",
  year =         "1979",
  volume =       "15",
  pages =        "147--158",
}

@Article{sep:Zimmermann:79b,
  author =       "K. Zimmermann",
  title =        "Linearit{\"a}t und Verallgemeinerungen der
                 Konvexit{\"a}t",
  journal =      "Math. Operationsforsch. Statist. Ser. Optim.",
  year =         "1979",
  volume =       "10",
  pages =        "17--25",
}

@Article{sep:Zimmermann:79c,
  author =       "U. Zimmermann",
  title =        "On Some Extremal Optimization Problems",
  journal =      "Ekonom.-Mat. Obzor",
  year =         "1979",
  volume =       "15",
  pages =        "438--442",
}

@TechReport{sep:Zimmermann:79d,
  author =       "U. Zimmermann",
  title =        "A primal dual method for algebraic linear
                 programming",
  institution =  "Mathematisches Institut der Universit{\"a}t zu
                 K{\"o}ln",
  year =         "1979",
  number =       "16",
  address =      "K{\"o}ln",
  pages =        "13",
}

@InProceedings{sep:Zimmermann:79e,
  author =       "U. Zimmermann",
  title =        "Duality Principles and the Algebraic Transportation
                 Problem.",
  booktitle =    "Numerische Methoden bei Graphentheoretischen und
                 Kombinatorischen Problemen, Band 2, Oberwolfach 1978,
                 ISNM 46",
  year =         "1979",
  editor =       "L. Collatz and G. Meinardus and W. Wetterling",
  pages =        "234--255",
  address =      "Basel, Boston, Stuttgart",
  publisher =    "Birkh{\"a}user",
}

@InProceedings{sep:Zimmermann:79f,
  author =       "U. Zimmermann",
  title =        "Matroid Intersection Problems with Generalized
                 Opbjectives",
  booktitle =    "Survey of Mathematical Programming, Volume 2",
  year =         "1979",
  editor =       "A. Prekopa",
  pages =        "383--392",
  address =      "Amsterdam",
  publisher =    "North Holland",
}

@Article{sep:Zimmermann:8x,
  author =       "U. Zimmermann",
  title =        "An Algebraic Approach to Extremal Optimization
                 Problems",
  journal =      "Methods of Operations Research",
  year =         "198x",
  volume =       "37",
  pages =        "295--298",
}

@Article{sep:Zimmermann:80a,
  author =       "U. Zimmermann",
  title =        "Duality for Algebraic Linear Programming",
  journal =      LINAA2,
  year =         "1980",
  volume =       "32",
  pages =        "9--31",
}

@InProceedings{sep:Zimmermann:80b,
  author =       "U. Zimmermann",
  title =        "Linear Optimization for Linear and Bottleneck
                 Objectives with one Nonlinear Parameter",
  booktitle =    "Optimization Techniques, Part II",
  year =         "1980",
  editor =       "K. Iracki and K. Malanowski and P. Walukiewicz",
  pages =        "211--222",
  organization = "Lecture Notes in Control and Information Sciences,
                 23",
  address =      "Berlin",
  publisher =    "Springer",
}

@Article{sep:Zimmermann:81a,
  author =       "K. Zimmermann",
  title =        "Convexity in Semimodules",
  journal =      "Extended Abstract to appear in Methods of Operations
                 Research, Athe{\"a}um et al.",
  year =         "1981",
  pages =        "25",
}

@InProceedings{sep:Zimmermann:81b,
  author =       "U. Zimmermann",
  title =        "Some Remarks on Algebraic Path Problems",
  booktitle =    "Method of Operations Research 40",
  year =         "1981",
  editor =       "R. E. Burkard and T. Ellinger",
  pages =        "445--449",
  address =      "K{\"o}nigstein",
  publisher =    "Anton Hain Meisenheim",
}

@Article{sep:Zimmermann:82a,
  author =       "U. Zimmermann",
  title =        "Minimization on Submodular Flows",
  journal =      "Discrete Appl. Math.",
  year =         "1982",
  volume =       "4",
  pages =        "303--323",
}

@Proceedings{sep:Zimmermann:82b,
  title =        "Augmenting Circuit Methods for Submodular Flow
                 Problems",
  year =         "1982",
  editor =       "U. Zimmermann",
  pages =        "401--439",
  organization = "Colloquia Mathematica Societatis J\'{a}nos Bolyai, 40.
                 Matroid Theory",
  address =      "Szeged, Hungary",
}

@Article{sep:Zimmermann:82c,
  author =       "U. Zimmermann",
  title =        "Minimization of some Nonlinear Functions over
                 Polymatroidal Network Flows",
  journal =      "Ann. Disc. Math.",
  year =         "1982",
  volume =       "16",
  pages =        "287--309",
}

@Article{sep:Zimmermann:84,
  author =       "U. Zimmermann",
  title =        "Minimization of Combined Objective Functions on
                 Integral Submodular Flows",
  journal =      "Ann. Disc. Math.",
  year =         "1984",
  volume =       "19",
  pages =        "363--382",
}

@Article{sep:Zimmermann:86a,
  author =       "U. Zimmermann",
  title =        "Sharing Problems",
  journal =      "Optimization",
  year =         "1986",
  volume =       "17",
  pages =        "31--47",
}

@Article{sep:Zimmermann:86b,
  author =       "U. Zimmermann",
  title =        "Duality for Balanced Submodular Flows",
  journal =      "Discrete Appl. Math.",
  year =         "1986",
  volume =       "15",
  pages =        "365--376",
}

@Article{sep:Zimmermann:86c,
  author =       "U. Zimmermann",
  title =        "Linear and Combinatorial Sharing Problems",
  journal =      "Discrete Appl. Math.",
  year =         "1986",
  volume =       "15",
  pages =        "85--104",
}

@InCollection{sep:Zimmermann:88,
  author =       "Uwe Zimmermann",
  title =        "On Recent Developments in Linar Programming",
  booktitle =    "International Series in Linear Programming",
  publisher =    "Birkh{\"a}user",
  year =         "1988",
  volume =       "84",
  pages =        "333--390200",
}

@Proceedings{sep:Zimmermann:89a,
  title =        "A sevice points location problem with min-max distance
                 optimality criterium",
  year =         "1989",
  editor =       "K. Zimmermann",
  address =      "Ulm",
  publisher =    "Universit{\"a}t Ulm",
  note =         "Preprint eines Vortrags auf einem Symposium der
                 Universit{\"a}t Ulm",
}

@TechReport{sep:Zimmermann:89b,
  author =       "U. Zimmermann",
  title =        "Negative Circuits for Flows and Submodular Flows",
  institution =  "TU Braunschweig, Abt. f. Mathematische Optimierung",
  year =         "1989",
  address =      "Braunschweig",
  pages =        "13",
}

@Article{sep:Zowe:84,
  author =       "J. Zowe",
  title =        "Nondifferentiable Optimization - {A} Motivation and a
                 Short Introduction into the Subgradient - and the
                 Bundle Concept",
  journal =      "Paper to appear in ASI Proceedings on Computational
                 Mathematical Programming",
  year =         "1984",
  pages =        "34",
}