Alan J. Hoffman

According to our database1, Alan J. Hoffman authored at least 35 papers between 1960 and 2010.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of one.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2010
Integral Boundary Points of Convex Polyhedra.
Proceedings of the 50 Years of Integer Programming 1958-2008, 2010

2008
A Special Issue in Memory of George B. Dantzig.
Discrete Optimization, 2008

2006
Gersgorin variations II: On themes of Fan and Gudkov.
Adv. Comput. Math., 2006

2003
On greedy algorithms, partially ordered sets, and submodular functions.
IBM Journal of Research and Development, 2003

2002
On the submodular matrix representation of a digraph.
Theor. Comput. Sci., 2002

On a game in directed graphs.
Inf. Process. Lett., 2002

2001
On a Problem of Zaks.
J. Comb. Theory, Ser. A, 2001

The edge versus path incidence matrix of series-parallel graphs and greedy packing.
Discrete Applied Mathematics, 2001

1996
A Characterization of Nonnegative Box-Greedy Matrices.
SIAM J. Discrete Math., 1996

Restrictions and Preassignments in Preemptive open Shop Scheduling.
Discrete Applied Mathematics, 1996

1995
Approximations to Solutions to Systems of Linear Inequalities.
SIAM J. Matrix Analysis Applications, 1995

1994
Preface.
IBM Journal of Research and Development, 1994

A nonlinear allocation problem.
IBM Journal of Research and Development, 1994

1993
Staircase transportation problems with superadditive rewards and cumulative capacities.
Math. Program., 1993

Series parallel composition of greedy linear programming problems.
Math. Program., 1993

Monge and Feasibility Sequences in General Flow Problems.
Discrete Applied Mathematics, 1993

1992
Optimal partitions having disjoint convex and conic hulls.
Math. Program., 1992

On simple combinatorial optimization problems.
Discrete Mathematics, 1992

1991
Linear programming with spheres and hemispheres of objective vectors.
Math. Program., 1991

1988
On greedy algorithms for series parallel graphs.
Math. Program., 1988

Greedy packing and series-parallel graphs.
J. Comb. Theory, Ser. A, 1988

1986
On the Cone of Nonnegative Circuits.
Discrete & Computational Geometry, 1986

1985
Triangulations (tilings) and certain block triangular matrices.
Math. Program., 1985

1984
Aspects of the Traveling Salesman Problem.
IBM Journal of Research and Development, 1984

1983
Extending Greene's Theorem to Directed Graphs.
J. Comb. Theory, Ser. A, 1983

1981
On matroid intersections.
Combinatorica, 1981

1980
Maximum degree in graphs of diameter 2.
Networks, 1980

1977
On the distance matrix of a directed graph.
Journal of Graph Theory, 1977

On partitions of a partially ordered set.
J. Comb. Theory, Ser. B, 1977

1974
A generalization of max flow - min cut.
Math. Program., 1974

1973
On Copositive Matrices with - 1, 0, 1 Entries.
J. Comb. Theory, Ser. A, 1973

1968
Bounds for the rank and eigenvalues of a matrix.
Proceedings of the Information Processing, Proceedings of IFIP Congress 1968, Edinburgh, UK, 5-10 August 1968, Volume 1, 1968

1962
Large Linear Programs.
Proceedings of the Information Processing, Proceedings of the 2nd IFIP Congress 1962, Munich, Germany, August 27, 1962

1960
On Moore Graphs with Diameters 2 and 3.
IBM Journal of Research and Development, 1960

On the Exceptional Case in a Characterization of the Arcs of a Complete Graph.
IBM Journal of Research and Development, 1960


  Loading...