Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Alan J. Hoffman
2000 – 2009
- 2008
[j25]Egon Balas, Alan J. Hoffman, S. Thomas McCormick: A Special Issue in Memory of George B. Dantzig. Discrete Optimization 5(2): 145-150 (2008)- 2006
[j24]Alan J. Hoffman: Gersgorin variations II: On themes of Fan and Gudkov. Adv. Comput. Math. 25(1-3): 1-6 (2006)- 2003
[j23]Brenda L. Dietrich, Alan J. Hoffman: On greedy algorithms, partially ordered sets, and submodular functions. IBM Journal of Research and Development 47(1): 25-30 (2003)- 2002
[j22]Alan J. Hoffman, Kate Jenkins, Tim Roughgarden: On a game in directed graphs. Inf. Process. Lett. 83(1): 13-16 (2002)
[j21]Arlette Gaillard, Heinz Gröflin, Alan J. Hoffman, William R. Pulleyblank: On the submodular matrix representation of a digraph. Theor. Comput. Sci. 287(2): 563-570 (2002)- 2001
[j20]Alan J. Hoffman, Baruch Schieber: The edge versus path incidence matrix of series-parallel graphs and greedy packing. Discrete Applied Mathematics 113(2-3): 275-284 (2001)
[j19]
1990 – 1999
- 1996
[j18]Dominique de Werra, Alan J. Hoffman, Nadimpalli V. R. Mahadev, Uri N. Peled: Restrictions and Preassignments in Preemptive open Shop Scheduling. Discrete Applied Mathematics 68(1-2): 169-188 (1996)
[j17]Ulrich Faigle, Alan J. Hoffman, Walter Kern: A Characterization of Nonnegative Box-Greedy Matrices. SIAM J. Discrete Math. 9(1): 1-6 (1996)- 1994
[j16]Shmuel Winograd, Alan J. Hoffman: Preface. IBM Journal of Research and Development 38(3): 242 (1994)
[j15]Eric V. Denardo, Alan J. Hoffman, Todd Mackenzie, William R. Pulleyblank: A nonlinear allocation problem. IBM Journal of Research and Development 38(3): 301-306 (1994)- 1993
[j14]Ilan Adler, Alan J. Hoffman, Ron Shamir: Monge and Feasibility Sequences in General Flow Problems. Discrete Applied Mathematics 44(1-3): 21-38 (1993)
[j13]Wolfgang W. Bein, Peter Brucker, Alan J. Hoffman: Series parallel composition of greedy linear programming problems. Math. Program. 62: 1-14 (1993)
[j12]Alan J. Hoffman, Arthur F. Veinott Jr.: Staircase transportation problems with superadditive rewards and cumulative capacities. Math. Program. 62: 199-213 (1993)- 1992
[j11]Alan J. Hoffman: On simple combinatorial optimization problems. Discrete Mathematics 106-107: 285-289 (1992)
[j10]E. R. Barnes, Alan J. Hoffman, Uriel G. Rothblum: Optimal partitions having disjoint convex and conic hulls. Math. Program. 54: 69-86 (1992)- 1991
[j9]B. Curtis Eaves, Alan J. Hoffman, Hui Hu: Linear programming with spheres and hemispheres of objective vectors. Math. Program. 51: 1-16 (1991)
1980 – 1989
- 1988
[j8]Alan J. Hoffman, Alan C. Tucker: Greedy packing and series-parallel graphs. J. Comb. Theory, Ser. A 47(1): 6-15 (1988)- 1986
[j7]Alan J. Hoffman, Carl W. Lee: On the Cone of Nonnegative Circuits. Discrete & Computational Geometry 1: 229-239 (1986)- 1984
[j6]Michael Held, Alan J. Hoffman, Ellis Lane Johnson, Philip Wolfe: Aspects of the Traveling Salesman Problem. IBM Journal of Research and Development 28(4): 476-486 (1984)- 1983
[j5]Alan J. Hoffman: Extending Greene's Theorem to Directed Graphs. J. Comb. Theory, Ser. A 34(1): 102-107 (1983)- 1981
[j4]- 1980
[j3]Paul Erdös, Siemion Fajtlowicz, Alan J. Hoffman: Maximum degree in graphs of diameter 2. Networks 10(1): 87-90 (1980)
1970 – 1979
- 1977
[j2]Alan J. Hoffman, D. E. Schwartz: On partitions of a partially ordered set. J. Comb. Theory, Ser. B 23(1): 3-13 (1977)- 1973
[j1]Alan J. Hoffman: On Copositive Matrices with - 1, 0, 1 Entries. J. Comb. Theory, Ser. A 14(3): 302-309 (1973)
1960 – 1969
- 1968
[c2]- 1962
[c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-01-26 20:09 CET by the dblp team



