Leslie E. Trotter Jr.

Affiliations:
  • Cornell University, Ithaca, NY, USA


According to our database1, Leslie E. Trotter Jr. authored at least 31 papers between 1974 and 2009.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2009
Teaching Computational Discrete Optimization at the Undergraduate Level.
INFORMS Trans. Educ., 2009

2003
On the capacitated vehicle routing problem.
Math. Program., 2003

On the maximum feasible subsystem problem, IISs and IIS-hypergraphs.
Math. Program., 2003

2001
Branch, Cut, and Price: Sequential and Parallel.
Proceedings of the Computational Combinatorial Optimization, 2001

1999
Some Structural and Algorithmic Properties of the Maximum Feasible Subsystem Problem.
Proceedings of the Integer Programming and Combinatorial Optimization, 1999

1997
Fully Parallel Generic Branch-and-Cut.
Proceedings of the Eighth SIAM Conference on Parallel Processing for Scientific Computing, 1997

1996
Cardinality-restricted Chains and Antichains in Partially ordered Sets.
Discret. Appl. Math., 1996

1995
Stability critical graphs and ranks facets of the stable set polytope.
Discret. Math., 1995

1993
Stability Critical Graphs and Even Subdivisions of <i>K</i><sub>4</sub>.
J. Comb. Theory, Ser. B, 1993

1991
A topological characterization for closed sets under polar duality in Q<sup>n</sup>.
Math. Program., 1991

1990
Stability Critical Graphs and Even Subdivisions of K_4.
Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference, 1990

1989
Node-Packing Problems with Integer Rounding Properties.
SIAM J. Discret. Math., 1989

On Abstract Integral Dependence.
Math. Oper. Res., 1989

An Abstract Linear Duality Model.
Math. Oper. Res., 1989

A generalization of Robacker's theorem.
Discret. Math., 1989

1988
On randomized stopping points and perfect graphs.
J. Comb. Theory, Ser. B, 1988

1987
Packing and covering with integral feasible flows in integral supply-demand networks.
Math. Program., 1987

Hermite Normal Form Computation Using Modulo Determinant Arithmetic.
Math. Oper. Res., 1987

Two easy duality theorems for product partial orders.
Discret. Appl. Math., 1987

1983
Algorithmic graph theory and perfect graphs, by Martin C. Golumbic, Academic, New York, 284 pp. Price: $34.00.
Networks, 1983

1982
Finite checkability for integer rounding properties in combinatorial programming problems.
Math. Program., 1982

1981
On stable set polyhedra for <i>K</i><sub>1, 3</sub>-free graphs.
J. Comb. Theory, Ser. B, 1981

1980
Related Necessary Conditions for Completing Partial Latin Squares.
J. Comb. Theory, Ser. A, 1980

1979
On perfect graphs and polyhedra with (0, 1)-valued extreme points.
Math. Program., 1979

Graphical properties related to minimal imperfection.
Discret. Math., 1979

1977
Line perfect graphs.
Math. Program., 1977

1975
Vertex packings: Structural properties and algorithms.
Math. Program., 1975

When the Greedy Solution Solves a Class of Knapsack Problems.
Oper. Res., 1975

A class of facet producing graphs for vertex packing polyhedra.
Discret. Math., 1975

1974
Properties of vertex packing and independence system polyhedra.
Math. Program., 1974

An Algorithm for the Bounded Variable Integer Programming Problem.
J. ACM, 1974


  Loading...