default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLeslie E. Trotter Jr.
Person information
- affiliation: Cornell University, Ithaca, NY, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
[j27]Andreas Alpers
, Leslie E. Trotter Jr.:
Teaching Computational Discrete Optimization at the Undergraduate Level. INFORMS Trans. Educ. 9(2): 63-69 (2009)- 2003
- [j26]Ted K. Ralphs, L. Kopman, William R. Pulleyblank, Leslie E. Trotter Jr.:
On the capacitated vehicle routing problem. Math. Program. 94(2-3): 343-359 (2003) - [j25]Edoardo Amaldi, Marc E. Pfetsch, Leslie E. Trotter Jr.:
On the maximum feasible subsystem problem, IISs and IIS-hypergraphs. Math. Program. 95(3): 533-554 (2003) - 2001
- [c4]Laszlo Ladányi, Ted K. Ralphs, Leslie E. Trotter Jr.:
Branch, Cut, and Price: Sequential and Parallel. Computational Combinatorial Optimization 2001: 223-260
1990 – 1999
- 1999
- [c3]Edoardo Amaldi, Marc E. Pfetsch, Leslie E. Trotter Jr.:
Some Structural and Algorithmic Properties of the Maximum Feasible Subsystem Problem. IPCO 1999: 45-59 - 1997
- [c2]Marta Eso, Laszlo Ladányi, Ted K. Ralphs, Leslie E. Trotter Jr.:
Fully Parallel Generic Branch-and-Cut. PP 1997 - 1996
- [j24]Henry Shum, Leslie E. Trotter Jr.:
Cardinality-restricted Chains and Antichains in Partially ordered Sets. Discret. Appl. Math. 65(1-3): 421-439 (1996) - 1995
- [j23]Edward C. Sewell, Leslie E. Trotter Jr.:
Stability critical graphs and ranks facets of the stable set polytope. Discret. Math. 147(1-3): 247-255 (1995) - 1993
- [j22]Edward C. Sewell, Leslie E. Trotter Jr.:
Stability Critical Graphs and Even Subdivisions of K4. J. Comb. Theory B 59(1): 74-84 (1993) - 1991
- [j21]Mark Hartmann, Leslie E. Trotter Jr.:
A topological characterization for closed sets under polar duality in Qn. Math. Program. 49: 281-283 (1991) - 1990
- [c1]Edward C. Sewell, Leslie E. Trotter Jr.:
Stability Critical Graphs and Even Subdivisions of K_4. IPCO 1990: 457-466
1980 – 1989
- 1989
- [j20]Shailesh K. Tipnis, Leslie E. Trotter Jr.:
A generalization of Robacker's theorem. Discret. Math. 74(1-2): 245-252 (1989) - [j19]Donna Crystal Llewellyn, Leslie E. Trotter Jr.:
On Abstract Integral Dependence. Math. Oper. Res. 14(4): 626-638 (1989) - [j18]P. C. P. Carvalho, Leslie E. Trotter Jr.:
An Abstract Linear Duality Model. Math. Oper. Res. 14(4): 639-663 (1989) - [j17]Shailesh K. Tipnis, Leslie E. Trotter Jr.:
Node-Packing Problems with Integer Rounding Properties. SIAM J. Discret. Math. 2(3): 407-412 (1989) - 1988
- [j16]Robert C. Dalang, Leslie E. Trotter Jr., Dominique de Werra:
On randomized stopping points and perfect graphs. J. Comb. Theory B 45(3): 320-344 (1988) - 1987
- [j15]Leslie E. Trotter Jr., Douglas B. West:
Two easy duality theorems for product partial orders. Discret. Appl. Math. 16(3): 283-286 (1987) - [j14]Paul D. Domich, R. Kannan, Leslie E. Trotter Jr.:
Hermite Normal Form Computation Using Modulo Determinant Arithmetic. Math. Oper. Res. 12(1): 50-59 (1987) - [j13]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): 231-239 (1987) - 1983
- [j12]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): 304-305 (1983) - 1982
- [j11]Stephen Baum, Leslie E. Trotter Jr.:
Finite checkability for integer rounding properties in combinatorial programming problems. Math. Program. 22(1): 141-147 (1982) - 1981
- [j10]Rick Giles, Leslie E. Trotter Jr.:
On stable set polyhedra for K1, 3-free graphs. J. Comb. Theory B 31(3): 313-326 (1981) - 1980
- [j9]Rick Giles, T. Oyama, Leslie E. Trotter Jr.:
Related Necessary Conditions for Completing Partial Latin Squares. J. Comb. Theory A 29(1): 20-31 (1980)
1970 – 1979
- 1979
- [j8]Robert G. Bland, H.-C. Huang, Leslie E. Trotter Jr.:
Graphical properties related to minimal imperfection. Discret. Math. 27(1): 11-22 (1979) - [j7]Clyde L. Monma, Leslie E. Trotter Jr.:
On perfect graphs and polyhedra with (0, 1)-valued extreme points. Math. Program. 17(1): 239-242 (1979) - 1977
- [j6]Leslie E. Trotter Jr.:
Line perfect graphs. Math. Program. 12(1): 255-259 (1977) - 1975
- [j5]Leslie E. Trotter Jr.:
A class of facet producing graphs for vertex packing polyhedra. Discret. Math. 12(4): 373-388 (1975) - [j4]Michael J. Magazine, George L. Nemhauser, Leslie E. Trotter Jr.:
When the Greedy Solution Solves a Class of Knapsack Problems. Oper. Res. 23(2): 207-217 (1975) - [j3]George L. Nemhauser, Leslie E. Trotter Jr.:
Vertex packings: Structural properties and algorithms. Math. Program. 8(1): 232-248 (1975) - 1974
- [j2]Leslie E. Trotter Jr., C. M. Shetty:
An Algorithm for the Bounded Variable Integer Programming Problem. J. ACM 21(3): 505-513 (1974) - [j1]George L. Nemhauser, Leslie E. Trotter Jr.:
Properties of vertex packing and independence system polyhedra. Math. Program. 6(1): 48-61 (1974)
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-07-04 22:21 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:
