Adam N. Letchford

	2012
47		Adam N. Letchford, Saeideh D. Nasiri, Dirk Oliver Theis: Compact Formulations of the Steiner Traveling Salesman Problem and Related Problems CoRR abs/1203.3854: (2012)
46		Adam N. Letchford, Sebastian J. Miller: Fast bounding procedures for large instances of the Simple Plant Location Problem. Computers & OR 39(5): 985-990 (2012)
45		Adam N. Letchford, Michael M. Sørensen: Binary positive semidefinite matrices and associated integer polytopes. Math. Program. 131(1-2): 253-271 (2012)
44		Laura Galli, Konstantinos Kaparis, Adam N. Letchford: Complexity results for the gap inequalities for the max-cut problem. Oper. Res. Lett. 40(3): 149-152 (2012)
	2011
43		Monia Giandomenico, Adam N. Letchford, Fabrizio Rossi, Stefano Smriglio: A New Approach to the Stable Set Problem Based on Ellipsoids. IPCO 2011: 223-234
42		Alberto Caprara, Adam N. Letchford, Juan José Salazar González: Decorous Lower Bounds for Minimum Linear Arrangement. INFORMS Journal on Computing 23(1): 26-40 (2011)
41		Corinne Feremans, Martine Labbé, Adam N. Letchford, Juan José Salazar González: Generalized network design polyhedra. Networks 58(2): 125-136 (2011)
40		Laura Galli, Konstantinos Kaparis, Adam N. Letchford: Gap inequalities for non-convex mixed-integer quadratic programs. Oper. Res. Lett. 39(5): 297-300 (2011)
39		Adam N. Letchford, Sebastian Pokutta, Andreas S. Schulz: On the membership problem for the {0, 1/2}-closure. Oper. Res. Lett. 39(5): 301-304 (2011)
	2010
38		Adam N. Letchford: Integer Quadratic Quasi-polyhedra. IPCO 2010: 258-270
37		Alberto Caprara, Adam N. Letchford, Juan José Salazar González: Lower Bounds for the Minimum Linear Arrangement of a Graph. Electronic Notes in Discrete Mathematics 36: 843-849 (2010)
36		Konstantinos Kaparis, Adam N. Letchford: Separation algorithms for 0-1 knapsack polytopes. Math. Program. 124(1-2): 69-91 (2010)
35		Alberto Caprara, Adam N. Letchford: New techniques for cost sharing in combinatorial optimization games. Math. Program. 124(1-2): 93-118 (2010)
34		Laura Galli, Adam N. Letchford: Small bipartite subgraph polytopes. Oper. Res. Lett. 38(5): 337-340 (2010)
	2009
33		Richard W. Eglese, Adam N. Letchford: General Routing Problem. Encyclopedia of Optimization 2009: 1252-1254
32		Adam N. Letchford, Amar Oukil: Exploiting sparsity in pricing routines for the capacitated arc routing problem. Computers & OR 36(7): 2320-2327 (2009)
31		Monia Giandomenico, Adam N. Letchford, Fabrizio Rossi, Stefano Smriglio: An application of the Lovász-Schrijver M(K, K) operator to the stable set problem. Math. Program. 120(2): 381-401 (2009)
30		Samuel Burer, Adam N. Letchford: On Nonconvex Quadratic Programming with Box Constraints. SIAM Journal on Optimization 20(2): 1073-1089 (2009)
	2008
29		Adam N. Letchford, Michael M. Sørensen: Binary Positive Semidefinite Matrices and Associated Integer Polytopes. IPCO 2008: 125-139
28		Adam N. Letchford, Nicholas A. Pearson: Good triangulations yield good tours. Computers & OR 35(2): 638-647 (2008)
27		Alistair R. Clark, Richard W. Eglese, Adam N. Letchford, Michael B. Wright: Preface. Discrete Applied Mathematics 156(3): 289-290 (2008)
26		Adam N. Letchford, Nicholas A. Pearson: Exploiting planarity in separation routines for the symmetric traveling salesman problem. Discrete Optimization 5(2): 220-230 (2008)
25		André R. S. Amaral, Alberto Caprara, Adam N. Letchford, Juan José Salazar González: A New Lower Bound for the Minimum Linear Arrangement of a Graph. Electronic Notes in Discrete Mathematics 30: 87-92 (2008)
24		Konstantinos Kaparis, Adam N. Letchford: Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem. European Journal of Operational Research 186(1): 91-103 (2008)
23		Adam N. Letchford, Gerhard Reinelt, Dirk Oliver Theis: Odd Minimum Cut Sets and b-Matchings Revisited. SIAM J. Discrete Math. 22(4): 1480-1487 (2008)
	2007
22		Adam N. Letchford, Andrea Lodi: The traveling salesman problem: a book review. 4OR 5(4): 315-317 (2007)
21		Jon Lee, Adam N. Letchford: Mixed integer programming. Discrete Optimization 4(1): 1-2 (2007)
	2006
20		Lisa Fleischer, Adam N. Letchford, Andrea Lodi: Polynomial-Time Separation of a Superclass of Simple Comb Inequalities. Math. Oper. Res. 31(4): 696-713 (2006)
19		Adam N. Letchford, Juan José Salazar González: Projection results for vehicle routing. Math. Program. 105(2-3): 251-274 (2006)
18		Monia Giandomenico, Adam N. Letchford: Exploring the Relationship Between Max-Cut and Stable Set Relaxations. Math. Program. 106(1): 159-175 (2006)
	2005
17		Adam N. Letchford, Nicholas A. Pearson: A fast algorithm for minimum weight odd circuits and cuts in planar graphs. Oper. Res. Lett. 33(6): 625-628 (2005)
	2004
16		Adam N. Letchford, Gerhard Reinelt, Dirk Oliver Theis: A Faster Exact Separation Algorithm for Blossom Inequalities. IPCO 2004: 196-205
15		Jens Lysgaard, Adam N. Letchford, Richard W. Eglese: A new branch-and-cut algorithm for the capacitated vehicle routing problem. Math. Program. 100(2): 423-445 (2004)
14		Adam N. Letchford: Book review. Oper. Res. Lett. 32(4): 393-394 (2004)
	2003
13		Adam N. Letchford, Andrea Lodi: Primal separation algorithms. 4OR 1(3): 209-224 (2003)
12		Alberto Caprara, Adam N. Letchford: On the separation of split cuts and related inequalities. Math. Program. 94(2-3): 279-294 (2003)
11		Adam N. Letchford: Binary clutter inequalities for integer programs. Math. Program. 98(1-3): 201-221 (2003)
	2002
10		Adam N. Letchford, Andrea Lodi: Polynomial-Time Separation of Simple Comb Inequalities. IPCO 2002: 93-108
9		Adam N. Letchford, Richard W. Eglese, Jens Lysgaard: Multistars, partial multistars and the capacitated vehicle routing problem. Math. Program. 94(1): 21-40 (2002)
8		Adam N. Letchford: Totally tight Chvátal-Gomory cuts. Oper. Res. Lett. 30(2): 71-73 (2002)
7		Adam N. Letchford, Andrea Lodi: Strengthening Chvátal-Gomory cuts and Gomory fractional cuts. Oper. Res. Lett. 30(2): 74-82 (2002)
	2001
6		Adam N. Letchford, Andrea Lodi: An Augment-and-Branch-and-Cut Framework for Mixed 0-1 Programming. Combinatorial Optimization 2001: 119-133
5		Adam N. Letchford, André R. S. Amaral: Analysis of upper bounds for the Pallet Loading Problem. European Journal of Operational Research 132(3): 582-593 (2001)
4		Adam N. Letchford: On Disjunctive Cuts for Combinatorial Optimization. J. Comb. Optim. 5(3): 299-315 (2001)
	2000
3		Adam N. Letchford: Separating a Superclass of Comb Inequalities in Planar Graphs. Math. Oper. Res. 25(3): 443-454 (2000)
	1999
2		Alberto Caprara, Matteo Fischetti, Adam N. Letchford: On the Separation of Maximally Violated mod-k Cuts. IPCO 1999: 87-98
1		Adam N. Letchford: The general routing polyhedron: A unifying framework. European Journal of Operational Research 112(1): 122-133 (1999)

Coauthor Index

1	André R. S. Amaral	[5] [25]
2	Samuel Burer	[30]
3	Alberto Caprara	[2] [12] [25] [35] [37] [42]
4	Alistair R. Clark	[27]
5	Richard W. Eglese	[9] [15] [27] [33]
6	Corinne Feremans	[41]
7	Matteo Fischetti	[2]
8	Lisa Fleischer	[20]
9	Laura Galli	[34] [40] [44]
10	Monia Giandomenico	[18] [31] [43]
11	Juan José Salazar González	[19] [25] [37] [41] [42]
12	Konstantinos Kaparis	[24] [36] [40] [44]
13	Martine Labbé	[41]
14	Jon Lee	[21]
15	Andrea Lodi	[6] [7] [10] [13] [20] [22]
16	Jens Lysgaard	[9] [15]
17	Sebastian J. Miller	[46]
18	Saeideh D. Nasiri	[47]
19	Amar Oukil	[32]
20	Nicholas A. Pearson	[17] [26] [28]
21	Sebastian Pokutta	[39]
22	Gerhard Reinelt	[16] [23]
23	Fabrizio Rossi	[31] [43]
24	Andreas S. Schulz	[39]
25	Stefano Smriglio	[31] [43]
26	Michael M. Sørensen	[29] [45]
27	Dirk Oliver Theis	[16] [23] [47]
28	Michael B. Wright	[27]

Colors in the list of coauthors

Last update Fri Jun 1 15:44:53 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page