Combinatorial optimization

[1]  Francesco Maffioli,et al.  Heuristically guided algorithm for k-parity matroid problems , 1978, Discret. Math..

[2]  Robert E. Tarjan,et al.  Finding optimum branchings , 1977, Networks.

[3]  Robert E. Tarjan,et al.  Finding Minimum Spanning Trees , 1976, SIAM J. Comput..

[4]  Robert E. Tarjan,et al.  A Combinatorial Problem Which Is Complete in Polynomial Space , 1976, JACM.

[5]  Ronald L. Graham,et al.  Some NP-complete geometric problems , 1976, STOC '76.

[6]  M. Iri,et al.  AN ALGORITHM FOR FINDING AN OPTIMAL "INDEPENDENT ASSIGNMENT" , 1976 .

[7]  Francesco Maffioli,et al.  Bounds for 3-Matroid Intersection Problems , 1975, Inf. Process. Lett..

[8]  Norman Zadeh.  More pathological examples for network flow problems , 1973, Math. Program..

[9]  Jack Edmonds,et al.  Matching, Euler tours and the Chinese postman , 1973, Math. Program..

[10]  Richard C. Grinold,et al.  Calculating Maximal Flows in a Network with Positive Gains , 1973, Oper. Res..

[11]  Sukhamay Kundu,et al.  A matroid generalization of a theorem of Mendelsohn and Dulmage , 1973, Discret. Math..

[12]  J. D. Murchland,et al.  Historical note on optimum spanning arborescences , 1973, Networks.

[13]  Jean François Maurras,et al.  Optimization of the flow through networks with gains , 1972, Math. Program..

[14]  John J. Jarvis,et al.  Maximal Flow with Gains through a Special Network , 1972, Oper. Res..

[15]  H. Gabow.  An efficient implementation of Edmonds'' maximum matching algorithm. , 1972 .

[16]  E. Lawler.  A PROCEDURE FOR COMPUTING THE K BEST SOLUTIONS TO DISCRETE OPTIMIZATION PROBLEMS AND ITS APPLICATION TO THE SHORTEST PATH PROBLEM , 1972 .

[17]  Norman Zadeh,et al.  Theoretical Efficiency of the Edmonds-Karp Algorithm for Computing Maximal Flows , 1972, JACM.

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

[19]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[20]  J. Y. Yen.  Finding the K Shortest Loopless Paths in a Network , 1971 .

[21]  S. E. Dreyfus,et al.  The steiner problem in graphs , 1971, Networks.

[22]  Richard M. Karp,et al.  A simple derivation of Edmonds' algorithm for optimum branchings , 1971, Networks.

[23]  T. A. Dowling,et al.  MATCHING THEORY FOR COMBINATORIAL GEOMETRIES , 1970 .

[24]  Dominic Welsh,et al.  On Matroid Theorems of Edmonds and Rado , 1970 .

[25]  L. Weinberg,et al.  A constructive graph-theoretic solution of the Shannon switching game , 1970 .

[26]  James Turner,et al.  A Survey of Progress in Graph Theory in the Soviet Union , 1970 .

[27]  Frank Harary,et al.  Matroids versus graphs , 1969 .

[28]  F. Roberts.  Random minimal trees , 1968 .

[29]  D. Gale.  Optimal assignments in an ordered set: An application of matroid theory , 1968 .

[30]  D. Welsh.  Kruskal's theorem for matroids , 1968, Mathematical Proceedings of the Cambridge Philosophical Society.

[31]  D.J.A. Welsh.  On Dependence in Matroids , 1967, Canadian Mathematical Bulletin.

[32]  E. Cockayne.  On the Steiner Problem , 1967, Canadian Mathematical Bulletin.

[33]  F. Glover.  Maximum matching in a convex bipartite graph , 1967 .

[34]  K. Onaga.  Dynamic Programming of Optimum Flows in Lossy Communication Nets , 1966 .

[35]  M. Klein.  A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems , 1966 .

[36]  M. Hanan,et al.  On Steiner’s Problem with Rectilinear Distance , 1966 .

[37]  William Prager,et al.  Flow in networks with amplification and coupling , 1966, Unternehmensforschung.

[38]  D. R. Fulkerson,et al.  Transversals and Matroid Partition , 1965 .

[39]  W. T. Tutte.  Lectures on matroids , 1965 .

[40]  Jack Edmonds,et al.  Lehmans switching game and a theorem of Tutte and Nash-Williams , 1965 .

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

[42]  J. Edmonds.  Minimum partition of a matroid into independent subsets , 1965 .

[43]  Alfred Lehman,et al.  A Solution of the Shannon Switching Game , 1964 .

[44]  C. Nash-Williams.  Decomposition of Finite Graphs Into Forests , 1964 .

[45]  T. C. Hu,et al.  Multi-Terminal Network Flows , 1961 .

[46]  F. P. Palermo.  A network minimization problem , 1961 .

[47]  Z. A. Melzak.  On the Problem of Steiner , 1961, Canadian Mathematical Bulletin.

[48]  W. T. Tutte.  On the Problem of Decomposing a Graph into n Connected Factors , 1961 .

[49]  C. Nash-Williams.  Edge-disjoint spanning trees of finite graphs , 1961 .

[50]  Robert G. Busacker,et al.  A PROCEDURE FOR DETERMINING A FAMILY OF MINIMUM-COST NETWORK FLOW PATTERNS , 1960 .

[51]  D. R. Fulkerson,et al.  An Out-of-Kilter Method for Minimal-Cost Flow Problems , 1960 .

[52]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[53]  W. T. Tutte.  Matroids and graphs , 1959 .

[54]  R. Z. Norman,et al.  An algorithm for a minimum cover of a graph , 1959 .

[55]  James E. Kelley,et al.  Critical-path planning and scheduling , 1899, IRE-AIEE-ACM '59 (Eastern).

[56]  R. Prim.  Shortest connection networks and some generalizations , 1957 .

[57]  C Berge,et al.  TWO THEOREMS IN GRAPH THEORY. , 1957, Proceedings of the National Academy of Sciences of the United States of America.

[58]  E. Ventura.  Revue de Recherche Operationnelle. , 1957 .

[59]  Peter Elias,et al.  A note on the maximum flow through a network , 1956, IRE Trans. Inf. Theory.

[60]  A. Orden.  The Transhipment Problem , 1956 .

[61]  D. R. Fulkerson,et al.  Maximal Flow Through a Network , 1956, Canadian Journal of Mathematics.

[62]  Claude E. Shannon,et al.  Game playing machines , 1955 .

[63]  W. T. Tutte.  A Short Proof of the Factor Theorem for Finite Graphs , 1954, Canadian Journal of Mathematics.

[64]  W. T. Tutte.  The Factors of Graphs , 1952, Canadian Journal of Mathematics.

[65]  R. P. Dilworth,et al.  A DECOMPOSITION THEOREM FOR PARTIALLY ORDERED SETS , 1950 .

[66]  W. T. Tutte.  The Factorization of Linear Graphs , 1947 .

[67]  E. L. Lawler.  POLYNOMIAL BOUNDED AND ( APPARENTLY ) NON POLYNOMIAL BOUNDED MATROID COMPUTATIONS , .