Leslie E. Trotter Jr.

Publication Activity (10 Years)

Years Active: 1974-2009
Publications (10 Years): 0

Publications

Andreas Alpers, Leslie E. Trotter Jr.
Teaching Computational Discrete Optimization at the Undergraduate Level. INFORMS Trans. Educ. 9 (2) (2009)
Edoardo Amaldi, Marc E. Pfetsch, Leslie E. Trotter Jr.
On the maximum feasible subsystem problem, IISs and IIS-hypergraphs. Math. Program. 95 (3) (2003)
Ted K. Ralphs, L. Kopman, William R. Pulleyblank, Leslie E. Trotter Jr.
On the capacitated vehicle routing problem. Math. Program. 94 (2-3) (2003)
Laszlo Ladányi, Ted K. Ralphs, Leslie E. Trotter Jr.
Branch, Cut, and Price: Sequential and Parallel. Computational Combinatorial Optimization (2001)
Edoardo Amaldi, Marc E. Pfetsch, Leslie E. Trotter Jr.
Some Structural and Algorithmic Properties of the Maximum Feasible Subsystem Problem. IPCO (1999)
Marta Eso, Laszlo Ladányi, Ted K. Ralphs, Leslie E. Trotter Jr.
Fully Parallel Generic Branch-and-Cut. PPSC (1997)
Henry Shum, Leslie E. Trotter Jr.
Cardinality-restricted Chains and Antichains in Partially ordered Sets. Discret. Appl. Math. 65 (1-3) (1996)
Edward C. Sewell, Leslie E. Trotter Jr.
Stability critical graphs and ranks facets of the stable set polytope. Discret. Math. 147 (1-3) (1995)
Edward C. Sewell, Leslie E. Trotter Jr.
. J. Comb. Theory, Ser. B 59 (1) (1993)
Mark Hartmann, Leslie E. Trotter Jr.
. Math. Program. 49 (1991)
Edward C. Sewell, Leslie E. Trotter Jr.
Stability Critical Graphs and Even Subdivisions of K_4. IPCO (1990)
P. C. P. Carvalho, Leslie E. Trotter Jr.
An Abstract Linear Duality Model. Math. Oper. Res. 14 (4) (1989)
Donna Crystal Llewellyn, Leslie E. Trotter Jr.
On Abstract Integral Dependence. Math. Oper. Res. 14 (4) (1989)
S. K. Tipnis, Leslie E. Trotter Jr.
A generalization of Robacker's theorem. Discret. Math. 74 (1-2) (1989)
S. K. Tipnis, Leslie E. Trotter Jr.
Node-Packing Problems with Integer Rounding Properties. SIAM J. Discret. Math. 2 (3) (1989)
Robert C. Dalang, Leslie E. Trotter Jr., Dominique de Werra
On randomized stopping points and perfect graphs. J. Comb. Theory, Ser. B 45 (3) (1988)
Leslie E. Trotter Jr., Douglas B. West
Two easy duality theorems for product partial orders. Discret. Appl. Math. 16 (3) (1987)
Paul D. Domich, R. Kannan, Leslie E. Trotter Jr.
Hermite Normal Form Computation Using Modulo Determinant Arithmetic. Math. Oper. Res. 12 (1) (1987)
Robert E. Bixby, Odile M.-C. Marcotte, Leslie E. Trotter Jr.
Packing and covering with integral feasible flows in integral supply-demand networks. Math. Program. 39 (3) (1987)
Leslie E. Trotter Jr.
Algorithmic graph theory and perfect graphs, by Martin C. Golumbic, Academic, New York, 284 pp. Price: $34.00. Networks 13 (2) (1983)
Stephen Baum, Leslie E. Trotter Jr.
Finite checkability for integer rounding properties in combinatorial programming problems. Math. Program. 22 (1) (1982)
Rick Giles, Leslie E. Trotter Jr.
-free graphs. J. Comb. Theory, Ser. B 31 (3) (1981)
Rick Giles, T. Oyama, Leslie E. Trotter Jr.
Related Necessary Conditions for Completing Partial Latin Squares. J. Comb. Theory, Ser. A 29 (1) (1980)
Robert G. Bland, H.-C. Huang, Leslie E. Trotter Jr.
Graphical properties related to minimal imperfection. Discret. Math. 27 (1) (1979)
Clyde L. Monma, Leslie E. Trotter Jr.
On perfect graphs and polyhedra with (0, 1)-valued extreme points. Math. Program. 17 (1) (1979)
Leslie E. Trotter Jr.
Line perfect graphs. Math. Program. 12 (1) (1977)
George L. Nemhauser, Leslie E. Trotter Jr.
Vertex packings: Structural properties and algorithms. Math. Program. 8 (1) (1975)
Michael J. Magazine, George L. Nemhauser, Leslie E. Trotter Jr.
When the Greedy Solution Solves a Class of Knapsack Problems. Oper. Res. 23 (2) (1975)
Leslie E. Trotter Jr.
A class of facet producing graphs for vertex packing polyhedra. Discret. Math. 12 (4) (1975)
George L. Nemhauser, Leslie E. Trotter Jr.
Properties of vertex packing and independence system polyhedra. Math. Program. 6 (1) (1974)
Leslie E. Trotter Jr., C. M. Shetty
An Algorithm for the Bounded Variable Integer Programming Problem. J. ACM 21 (3) (1974)