Djeumou Fomeni, Franklin; Kaparis, Konstantinos; Letchford, Adam N. A cut-and-branch algorithm for the quadratic knapsack problem. (English) Zbl 1510.90224 Discrete Optim. 44, Part 2, Article ID 100579, 18 p. (2022). MSC: 90C27 90C10 90C09 90C20 90C57 PDFBibTeX XMLCite \textit{F. Djeumou Fomeni} et al., Discrete Optim. 44, Part 2, Article ID 100579, 18 p. (2022; Zbl 1510.90224) Full Text: DOI Link
Kaparis, Konstantinos; Letchford, Adam N.; Mourtos, Ioannis Generalised 2-circulant inequalities for the max-cut problem. (English) Zbl 1525.90361 Oper. Res. Lett. 50, No. 2, 122-128 (2022). MSC: 90C27 90C57 PDFBibTeX XMLCite \textit{K. Kaparis} et al., Oper. Res. Lett. 50, No. 2, 122--128 (2022; Zbl 1525.90361) Full Text: DOI
Galli, Laura; Letchford, Adam N. A separation algorithm for the simple plant location problem. (English) Zbl 1525.90247 Oper. Res. Lett. 49, No. 4, 610-615 (2021). MSC: 90B80 90C27 90B06 90C10 90C57 PDFBibTeX XMLCite \textit{L. Galli} and \textit{A. N. Letchford}, Oper. Res. Lett. 49, No. 4, 610--615 (2021; Zbl 1525.90247) Full Text: DOI
Letchford, Adam N.; Ventura, Paolo Strengthened clique-family inequalities for the stable set polytope. (English) Zbl 1525.90366 Oper. Res. Lett. 49, No. 4, 586-589 (2021). MSC: 90C27 05C69 90C57 PDFBibTeX XMLCite \textit{A. N. Letchford} and \textit{P. Ventura}, Oper. Res. Lett. 49, No. 4, 586--589 (2021; Zbl 1525.90366) Full Text: DOI
Dokka, Trivikram; Letchford, Adam N.; Hasan Mansoor, M. On the complexity of surrogate and group relaxation for integer linear programs. (English) Zbl 1525.90275 Oper. Res. Lett. 49, No. 4, 530-534 (2021). MSC: 90C10 90C57 PDFBibTeX XMLCite \textit{T. Dokka} et al., Oper. Res. Lett. 49, No. 4, 530--534 (2021; Zbl 1525.90275) Full Text: DOI
Letchford, Adam N.; Vu, Anh N. Facets from gadgets. (English) Zbl 1458.90640 Math. Program. 185, No. 1-2 (A), 297-314 (2021). MSC: 90C57 90C27 PDFBibTeX XMLCite \textit{A. N. Letchford} and \textit{A. N. Vu}, Math. Program. 185, No. 1--2 (A), 297--314 (2021; Zbl 1458.90640) Full Text: DOI Link
Letchford, Adam N.; Rossi, Fabrizio; Smriglio, Stefano The stable set problem: clique and nodal inequalities revisited. (English) Zbl 1458.90550 Comput. Oper. Res. 123, Article ID 105024, 16 p. (2020). MSC: 90C27 90C10 90C35 90C57 PDFBibTeX XMLCite \textit{A. N. Letchford} et al., Comput. Oper. Res. 123, Article ID 105024, 16 p. (2020; Zbl 1458.90550) Full Text: DOI Link
Letchford, Adam N.; Souli, Georgia Lifting the knapsack cover inequalities for the knapsack polytope. (English) Zbl 1479.90140 Oper. Res. Lett. 48, No. 5, 607-611 (2020). MSC: 90C11 90C57 PDFBibTeX XMLCite \textit{A. N. Letchford} and \textit{G. Souli}, Oper. Res. Lett. 48, No. 5, 607--611 (2020; Zbl 1479.90140) Full Text: DOI Link
Kaparis, Konstantinos; Letchford, Adam N.; Mourtos, Ioannis On matroid parity and matching polytopes. (English) Zbl 1443.05030 Discrete Appl. Math. 284, 322-331 (2020). MSC: 05B35 52B40 90C57 PDFBibTeX XMLCite \textit{K. Kaparis} et al., Discrete Appl. Math. 284, 322--331 (2020; Zbl 1443.05030) Full Text: DOI Link
Letchford, Adam N.; Souli, Georgia Valid inequalities for mixed-integer programmes with fixed charges on sets of variables. (English) Zbl 1525.90442 Oper. Res. Lett. 48, No. 3, 240-244 (2020). MSC: 90C57 90C11 PDFBibTeX XMLCite \textit{A. N. Letchford} and \textit{G. Souli}, Oper. Res. Lett. 48, No. 3, 240--244 (2020; Zbl 1525.90442) Full Text: DOI Link
Letchford, Adam N.; Souli, Georgia New valid inequalities for the fixed-charge and single-node flow polytopes. (English) Zbl 1476.90355 Oper. Res. Lett. 47, No. 5, 353-357 (2019). MSC: 90C57 90C11 PDFBibTeX XMLCite \textit{A. N. Letchford} and \textit{G. Souli}, Oper. Res. Lett. 47, No. 5, 353--357 (2019; Zbl 1476.90355) Full Text: DOI Link
Letchford, Adam N.; Souli, Georgia On lifted cover inequalities: a new lifting procedure with unusual properties. (English) Zbl 1476.90285 Oper. Res. Lett. 47, No. 2, 83-87 (2019). MSC: 90C27 90C57 PDFBibTeX XMLCite \textit{A. N. Letchford} and \textit{G. Souli}, Oper. Res. Lett. 47, No. 2, 83--87 (2019; Zbl 1476.90285) Full Text: DOI Link
Kaparis, Konstantinos; Letchford, Adam N. A note on the 2-circulant inequalities for the MAX-cut problem. (English) Zbl 1452.90269 Oper. Res. Lett. 46, No. 4, 443-447 (2018). MSC: 90C27 90C57 PDFBibTeX XMLCite \textit{K. Kaparis} and \textit{A. N. Letchford}, Oper. Res. Lett. 46, No. 4, 443--447 (2018; Zbl 1452.90269) Full Text: DOI Link
Fairbrother, Jamie; Letchford, Adam N. Projection results for the \(k\)-partition problem. (English) Zbl 1387.90213 Discrete Optim. 26, 97-111 (2017). MSC: 90C27 90C22 90C57 05C85 PDFBibTeX XMLCite \textit{J. Fairbrother} and \textit{A. N. Letchford}, Discrete Optim. 26, 97--111 (2017; Zbl 1387.90213) Full Text: DOI
Letchford, Adam N.; Salazar-González, Juan-José Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem. (English) Zbl 1346.90709 Eur. J. Oper. Res. 251, No. 1, 74-84 (2016). MSC: 90C27 90B10 90C57 PDFBibTeX XMLCite \textit{A. N. Letchford} and \textit{J.-J. Salazar-González}, Eur. J. Oper. Res. 251, No. 1, 74--84 (2016; Zbl 1346.90709) Full Text: DOI Link
Giandomenico, Monia; Letchford, Adam N.; Rossi, Fabrizio; Smriglio, Stefano Ellipsoidal relaxations of the stable set problem: theory and algorithms. (English) Zbl 1330.90093 SIAM J. Optim. 25, No. 3, 1944-1963 (2015). MSC: 90C27 90C57 PDFBibTeX XMLCite \textit{M. Giandomenico} et al., SIAM J. Optim. 25, No. 3, 1944--1963 (2015; Zbl 1330.90093) Full Text: DOI Link
Letchford, Adam N.; Sørensen, Michael M. A new separation algorithm for the Boolean quadric and cut polytopes. (English) Zbl 1308.90209 Discrete Optim. 14, 61-71 (2014). MSC: 90C57 90C20 90C09 PDFBibTeX XMLCite \textit{A. N. Letchford} and \textit{M. M. Sørensen}, Discrete Optim. 14, 61--71 (2014; Zbl 1308.90209) Full Text: DOI
Burer, Samuel; Letchford, Adam N. Unbounded convex sets for non-convex mixed-integer quadratic programming. (English) Zbl 1291.90146 Math. Program. 143, No. 1-2 (A), 231-256 (2014). Reviewer: Efstratios Rappos (Aubonne) MSC: 90C11 90C26 90C57 PDFBibTeX XMLCite \textit{S. Burer} and \textit{A. N. Letchford}, Math. Program. 143, No. 1--2 (A), 231--256 (2014; Zbl 1291.90146) Full Text: DOI
Amaral, André R. S.; Letchford, Adam N. A polyhedral approach to the single row facility layout problem. (English) Zbl 1280.90132 Math. Program. 141, No. 1-2 (A), 453-477 (2013). MSC: 90C57 PDFBibTeX XMLCite \textit{A. R. S. Amaral} and \textit{A. N. Letchford}, Math. Program. 141, No. 1--2 (A), 453--477 (2013; Zbl 1280.90132) Full Text: DOI
Letchford, Adam N.; Sørensen, Michael M. Binary positive semidefinite matrices and associated integer polytopes. (English) Zbl 1235.90113 Math. Program. 131, No. 1-2 (A), 253-271 (2012). MSC: 90C22 90C27 90C57 PDFBibTeX XMLCite \textit{A. N. Letchford} and \textit{M. M. Sørensen}, Math. Program. 131, No. 1--2 (A), 253--271 (2012; Zbl 1235.90113) Full Text: DOI Link
Caprara, Alberto; Letchford, Adam N.; Salazar-González, Juan-José Decorous lower bounds for minimum linear arrangement. (English) Zbl 1243.90185 INFORMS J. Comput. 23, No. 1, 26-40 (2011). MSC: 90C27 05C62 05C85 90C57 PDFBibTeX XMLCite \textit{A. Caprara} et al., INFORMS J. Comput. 23, No. 1, 26--40 (2011; Zbl 1243.90185) Full Text: DOI Link
Giandomenico, Monia; Letchford, Adam N.; Rossi, Fabrizio; Smriglio, Stefano A new approach to the stable set problem based on ellipsoids. (English) Zbl 1341.90098 Günlük, Oktay (ed.) et al., Integer programming and combinatoral optimization. 15th international conference, IPCO 2011, New York, NY, USA, June 15–17, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-20806-5/pbk). Lecture Notes in Computer Science 6655, 223-234 (2011). MSC: 90C22 90C20 90C57 PDFBibTeX XMLCite \textit{M. Giandomenico} et al., Lect. Notes Comput. Sci. 6655, 223--234 (2011; Zbl 1341.90098) Full Text: DOI
Fortini, Matteo; Letchford, Adam N.; Lodi, Andrea; Wenger, Klaus M. Computing compatible tours for the symmetric traveling salesman problem. (English) Zbl 1279.90144 Math. Program. Comput. 3, No. 1, 59-78 (2011). MSC: 90C27 90C57 90C59 PDFBibTeX XMLCite \textit{M. Fortini} et al., Math. Program. Comput. 3, No. 1, 59--78 (2011; Zbl 1279.90144) Full Text: DOI Link
Galli, Laura; Letchford, Adam N. Small bipartite subgraph polytopes. (English) Zbl 1231.05221 Oper. Res. Lett. 38, No. 5, 337-340 (2010). MSC: 05C75 90C57 PDFBibTeX XMLCite \textit{L. Galli} and \textit{A. N. Letchford}, Oper. Res. Lett. 38, No. 5, 337--340 (2010; Zbl 1231.05221) Full Text: DOI Link
Kaparis, Konstantinos; Letchford, Adam N. Separation algorithms for 0-1 knapsack polytopes. (English) Zbl 1198.90297 Math. Program. 124, No. 1-2 (B), 69-91 (2010). MSC: 90C10 90C27 90C57 PDFBibTeX XMLCite \textit{K. Kaparis} and \textit{A. N. Letchford}, Math. Program. 124, No. 1--2 (B), 69--91 (2010; Zbl 1198.90297) Full Text: DOI Link
Caprara, Alberto; Letchford, Adam N. New techniques for cost sharing in combinatorial optimization games. (English) Zbl 1194.91036 Math. Program. 124, No. 1-2 (B), 93-118 (2010). MSC: 91A12 91A46 05C57 90C05 90C10 90C27 90C57 PDFBibTeX XMLCite \textit{A. Caprara} and \textit{A. N. Letchford}, Math. Program. 124, No. 1--2 (B), 93--118 (2010; Zbl 1194.91036) Full Text: DOI Link
Letchford, Adam N. Integer quadratic quasi-polyhedra. (English) Zbl 1285.90066 Eisenbrand, Friedrich (ed.) et al., Integer programming and combinatorial optimization. 14th international conference, IPCO 2010, Lausanne, Switzerland, June 9–11, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13035-9/pbk). Lecture Notes in Computer Science 6080, 258-270 (2010). MSC: 90C30 90C11 90C57 PDFBibTeX XMLCite \textit{A. N. Letchford}, Lect. Notes Comput. Sci. 6080, 258--270 (2010; Zbl 1285.90066) Full Text: DOI
Letchford, Adam N.; Oukil, Amar Exploiting sparsity in pricing routines for the capacitated arc routing problem. (English) Zbl 1158.90321 Comput. Oper. Res. 36, No. 7, 2320-2327 (2009). MSC: 90B10 90B06 90C35 90C57 PDFBibTeX XMLCite \textit{A. N. Letchford} and \textit{A. Oukil}, Comput. Oper. Res. 36, No. 7, 2320--2327 (2009; Zbl 1158.90321) Full Text: DOI Link
Letchford, Adam N.; Reinelt, Gerhard; Theis, Dirk Oliver Odd minimum cut sets and \(b\)-matchings revisited. (English) Zbl 1178.90290 SIAM J. Discrete Math. 22, No. 4, 1480-1487 (2008). MSC: 90C27 05C70 90C57 90C10 PDFBibTeX XMLCite \textit{A. N. Letchford} et al., SIAM J. Discrete Math. 22, No. 4, 1480--1487 (2008; Zbl 1178.90290) Full Text: DOI arXiv
Giandomenico, Monia; Letchford, Adam N. Exploring the relationship between max-cut and stable set relaxations. (English) Zbl 1134.90519 Math. Program. 106, No. 1 (A), 159-175 (2006). MSC: 90C35 90C27 90C57 PDFBibTeX XMLCite \textit{M. Giandomenico} and \textit{A. N. Letchford}, Math. Program. 106, No. 1 (A), 159--175 (2006; Zbl 1134.90519) Full Text: DOI
Letchford, Adam N.; Reinelt, Gerhard; Theis, Dirk Oliver A faster exact separation algorithm for blossom inequalities. (English) Zbl 1092.90542 Bienstock, Daniel (ed.) et al., Integer programming and combinatorial optimization. 10th international IPCO conference, New York, NY, USA, June 7–11, 2004. Proceedings. Berlin: Springer (ISBN 3-540-22113-1/pbk). Lecture Notes in Computer Science 3064, 196-205 (2004). MSC: 90C57 90C60 PDFBibTeX XMLCite \textit{A. N. Letchford} et al., Lect. Notes Comput. Sci. 3064, 196--205 (2004; Zbl 1092.90542) Full Text: DOI
Lysgaard, Jens; Letchford, Adam N.; Eglese, Richard W. A new branch-and-cut algorithm for the capacitated vehicle routing problem. (English) Zbl 1073.90068 Math. Program. 100, No. 2 (A), 423-445 (2004). Reviewer: Matthias Ehrgott (Auckland) MSC: 90C57 90B10 PDFBibTeX XMLCite \textit{J. Lysgaard} et al., Math. Program. 100, No. 2 (A), 423--445 (2004; Zbl 1073.90068) Full Text: DOI
Letchford, Adam N.; Lodi, Andrea Primal separation algorithms. (English) Zbl 1102.90074 4OR 1, No. 3, 209-224 (2003). MSC: 90C57 90C10 90C35 PDFBibTeX XMLCite \textit{A. N. Letchford} and \textit{A. Lodi}, 4OR 1, No. 3, 209--224 (2003; Zbl 1102.90074) Full Text: DOI
Caprara, Alberto; Letchford, Adam N. On the separation of split cuts and related inequalities. (English) Zbl 1030.90095 Math. Program. 94, No. 2-3 (B), 279-294 (2003). MSC: 90C27 90C57 90C10 PDFBibTeX XMLCite \textit{A. Caprara} and \textit{A. N. Letchford}, Math. Program. 94, No. 2--3 (B), 279--294 (2003; Zbl 1030.90095) Full Text: DOI
Letchford, Adam N.; Lodi, Andrea An augment-and-branch-and-cut framework for mixed 0-1 programming. (English) Zbl 1024.90506 Jünger, Michael (ed.) et al., Combinatorial optimization - Eureka, you shrink. Papers dedicated to Jack Edmonds. 5th international workshop, Aussois, France, March 5-9, 2001. Revised papers. Berlin: Springer. Lect. Notes Comput. Sci. 2570, 119-133 (2003). MSC: 90C10 90C57 90C27 PDFBibTeX XMLCite \textit{A. N. Letchford} and \textit{A. Lodi}, Lect. Notes Comput. Sci. 2570, 119--133 (2003; Zbl 1024.90506) Full Text: Link
Letchford, Adam N.; Lodi, Andrea Primal cutting plane algorithms revisited. (English) Zbl 1023.90087 Math. Methods Oper. Res. 56, No. 1, 67-81 (2002). MSC: 90C57 90C08 90C10 90C11 PDFBibTeX XMLCite \textit{A. N. Letchford} and \textit{A. Lodi}, Math. Methods Oper. Res. 56, No. 1, 67--81 (2002; Zbl 1023.90087) Full Text: DOI
Letchford, Adam N.; Eglese, Richard W.; Lysgaard, Jens Multistars, partial multistars and the capacitated vehicle routing problem. (English) Zbl 1023.90073 Math. Program. 94, No. 1 (A), 21-40 (2002). MSC: 90C35 90C57 90B06 90B20 90C27 90C10 PDFBibTeX XMLCite \textit{A. N. Letchford} et al., Math. Program. 94, No. 1 (A), 21--40 (2002; Zbl 1023.90073) Full Text: DOI
Letchford, Adam N. On disjunctive cuts for combinatorial optimization. (English) Zbl 1078.90039 J. Comb. Optim. 5, No. 3, 299-315 (2001). MSC: 90C10 90C57 PDFBibTeX XMLCite \textit{A. N. Letchford}, J. Comb. Optim. 5, No. 3, 299--315 (2001; Zbl 1078.90039) Full Text: DOI
Corberán, Angel; Letchford, Adam N.; Sanchis, José María A cutting plane algorithm for the general routing problem. (English) Zbl 0989.90026 Math. Program. 90, No. 2 (A), 291-316 (2001). MSC: 90B20 90C57 90C27 PDFBibTeX XMLCite \textit{A. Corberán} et al., Math. Program. 90, No. 2 (A), 291--316 (2001; Zbl 0989.90026) Full Text: DOI
Letchford, Adam N. Separating a superclass of comb inequalities in planar graphs. (English) Zbl 0977.90075 Math. Oper. Res. 25, No. 3, 443-454 (2000). MSC: 90C35 90C57 PDFBibTeX XMLCite \textit{A. N. Letchford}, Math. Oper. Res. 25, No. 3, 443--454 (2000; Zbl 0977.90075) Full Text: DOI Link
Eglese, Richard W.; Letchford, Adam N. Polyhedral theory for arc routing problems. (English) Zbl 0970.90071 Dror, Moshe (ed.), Arc routing. Theory, solutions and applications. Boston: Kluwer Academic Publishers. 199-230 (2000). Reviewer: T.Cipra (Praha) MSC: 90C27 90C57 90C35 PDFBibTeX XMLCite \textit{R. W. Eglese} and \textit{A. N. Letchford}, in: ARC routing. Theory, solutions and applications. Boston: Kluwer Academic Publishers. 199--230 (2000; Zbl 0970.90071)
Letchford, A. N.; Eglese, R. W. The rural postman problem with deadline classes. (English) Zbl 0955.90111 Eur. J. Oper. Res. 105, No. 3, 390-400 (1998). MSC: 90C27 90C10 90C57 PDFBibTeX XMLCite \textit{A. N. Letchford} and \textit{R. W. Eglese}, Eur. J. Oper. Res. 105, No. 3, 390--400 (1998; Zbl 0955.90111) Full Text: DOI