default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlan J. Hoffman
Person information
- affiliation: IBM Research, Yorktown Heights, New York, USA
- award (1992): John von Neumann Theory Prize
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[j34]Alan J. Hoffman, Chai Wah Wu:
A Simple Proof of a Generalized Cauchy - Binet Theorem. Am. Math. Mon. 123(9): 928-930 (2016)- 2010
- [p1]Alan J. Hoffman, Joseph B. Kruskal:
Integral Boundary Points of Convex Polyhedra. 50 Years of Integer Programming 2010: 49-76
2000 – 2009
- 2008
- [j33]Egon Balas, Alan J. Hoffman, S. Thomas McCormick:
A Special Issue in Memory of George B. Dantzig. Discret. Optim. 5(2): 145-150 (2008) - 2007
- [j32]Alan J. Hoffman:
What the transportation problem did for me. Ann. Oper. Res. 149(1): 117-120 (2007) - 2006
- [j31]Alan J. Hoffman:
Gersgorin variations II: On themes of Fan and Gudkov. Adv. Comput. Math. 25(1-3): 1-6 (2006) - 2003
- [j30]Brenda L. Dietrich, Alan J. Hoffman:
On greedy algorithms, partially ordered sets, and submodular functions. IBM J. Res. Dev. 47(1): 25-30 (2003) - 2002
- [j29]Alan J. Hoffman, Kate Jenkins, Tim Roughgarden:
On a game in directed graphs. Inf. Process. Lett. 83(1): 13-16 (2002) - [j28]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
- [j27]Alan J. Hoffman, Baruch Schieber:
The edge versus path incidence matrix of series-parallel graphs and greedy packing. Discret. Appl. Math. 113(2-3): 275-284 (2001) - [j26]Alan J. Hoffman:
On a Problem of Zaks. J. Comb. Theory A 93(2): 371-377 (2001)
1990 – 1999
- 1996
- [j25]Dominique de Werra, Alan J. Hoffman, Nadimpalli V. R. Mahadev, Uri N. Peled:
Restrictions and Preassignments in Preemptive open Shop Scheduling. Discret. Appl. Math. 68(1-2): 169-188 (1996) - [j24]Ulrich Faigle, Alan J. Hoffman, Walter Kern:
A Characterization of Nonnegative Box-Greedy Matrices. SIAM J. Discret. Math. 9(1): 1-6 (1996) - 1995
- [j23]Osman Güler, Alan J. Hoffman, Uriel G. Rothblum:
Approximations to Solutions to Systems of Linear Inequalities. SIAM J. Matrix Anal. Appl. 16(2): 688-696 (1995) - 1994
- [j22]Shmuel Winograd, Alan J. Hoffman:
Preface. IBM J. Res. Dev. 38(3): 242 (1994) - [j21]Eric V. Denardo, Alan J. Hoffman, Todd Mackenzie, William R. Pulleyblank:
A nonlinear allocation problem. IBM J. Res. Dev. 38(3): 301-306 (1994) - 1993
- [j20]Ilan Adler, Alan J. Hoffman, Ron Shamir
:
Monge and Feasibility Sequences in General Flow Problems. Discret. Appl. Math. 44(1-3): 21-38 (1993) - [j19]Wolfgang W. Bein, Peter Brucker, Alan J. Hoffman:
Series parallel composition of greedy linear programming problems. Math. Program. 62: 1-14 (1993) - [j18]Alan J. Hoffman, Arthur F. Veinott Jr.:
Staircase transportation problems with superadditive rewards and cumulative capacities. Math. Program. 62: 199-213 (1993) - 1992
- [j17]Alan J. Hoffman:
On simple combinatorial optimization problems. Discret. Math. 106-107: 285-289 (1992) - [j16]Earl R. Barnes, Alan J. Hoffman, Uriel G. Rothblum:
Optimal partitions having disjoint convex and conic hulls. Math. Program. 54: 69-86 (1992) - 1991
- [j15]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
- [j14]Alan J. Hoffman, Alan C. Tucker:
Greedy packing and series-parallel graphs. J. Comb. Theory A 47(1): 6-15 (1988) - [j13]Alan J. Hoffman:
On greedy algorithms for series parallel graphs. Math. Program. 40(1-3): 197-204 (1988) - 1986
- [j12]Alan J. Hoffman, Carl W. Lee:
On the Cone of Nonnegative Circuits. Discret. Comput. Geom. 1: 229-239 (1986) - 1985
- [j11]George B. Dantzig, Alan J. Hoffman, T. C. Hu:
Triangulations (tilings) and certain block triangular matrices. Math. Program. 31(1): 1-14 (1985) - 1984
- [j10]Michael Held, Alan J. Hoffman, Ellis Lane Johnson, Philip Wolfe:
Aspects of the Traveling Salesman Problem. IBM J. Res. Dev. 28(4): 476-486 (1984) - 1983
- [j9]Alan J. Hoffman:
Extending Greene's Theorem to Directed Graphs. J. Comb. Theory A 34(1): 102-107 (1983) - 1981
- [j8]Heinz Gröflin, Alan J. Hoffman:
On matroid intersections. Comb. 1(1): 43-47 (1981) - 1980
- [j7]Paul Erdös, Siemion Fajtlowicz, Alan J. Hoffman:
Maximum degree in graphs of diameter 2. Networks 10(1): 87-90 (1980)
1970 – 1979
- 1977
- [j6]Alan J. Hoffman, D. E. Schwartz:
On partitions of a partially ordered set. J. Comb. Theory B 23(1): 3-13 (1977) - [j5]Ronald L. Graham, Alan J. Hoffman, H. Hosoya:
On the distance matrix of a directed graph. J. Graph Theory 1(1): 85-88 (1977) - 1974
- [j4]Alan J. Hoffman:
A generalization of max flow - min cut. Math. Program. 6(1): 352-359 (1974) - 1973
- [j3]Alan J. Hoffman:
On Copositive Matrices with - 1, 0, 1 Entries. J. Comb. Theory A 14(3): 302-309 (1973)
1960 – 1969
- 1968
- [c2]Alan J. Hoffman:
Bounds for the rank and eigenvalues of a matrix. IFIP Congress (1) 1968: 111-113 - 1962
- [c1]Alan J. Hoffman:
Large Linear Programs. IFIP Congress 1962: 173-176 - 1960
- [j2]Alan J. Hoffman:
On the Exceptional Case in a Characterization of the Arcs of a Complete Graph. IBM J. Res. Dev. 4(5): 487-496 (1960) - [j1]Alan J. Hoffman, Robert R. Singleton:
On Moore Graphs with Diameters 2 and 3. IBM J. Res. Dev. 4(5): 497-504 (1960)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
